A* Pathfinding - a problem

it's like an invisible wall.
if you take nodes (pathfinding), you have a "connected list" between the nodes.
in A* all nodes are connected with each others (apart from walls), and i want to code a list, where nodes are written, that aren't connected

hope you understand