The problem you may find is that A* does not compute every node on it's way to finding a path - it only checks the most likely node at each stage and therefore you wont necessarily have a full not-connected list.
One method might be to recursively check every node to it's adjacent nodes and compile a stack?
One method might be to recursively check every node to it's adjacent nodes and compile a stack?