If a node's (as in graph) neighbors are nodes connected to it with passable edges, what can I call nodes connected to a node with impassable edges? They would both be neighbors but only some would be "accessible neighbors" but I would like a more concise word.
Note that I have no real idea about proper terminology of graphs in maths, but would just like a word that an everyday man would understand.
EDIT: I realise I am not being clear; let me explain: I am a novice programmer trying to write some graph software and each node must store a list of nodes connected to it by an edge and this edge may be passable or impassable. All of the nodes are neighbors but only some of the nodes (those connected with a passable edge) are "accessible neighbors". Here is a very crude depiction:
Nodes 2, 3, 4 and 5 are "neighbors" but only 2, 5 and 4 are "accessible neighbors". If it remains unclear - please say! I guess I have not asked a very good question.