Deprecated.Use getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean) instead;
if you decide to use this method anyways, please note that the definition
of "node neighbor" is such: Node A is a "node neighbor" of node B if and only
if there exists an edge [directed or undirected] E such that A is E's target and
B is E's source, or
A is E's source and B is E's target; this method then returns a non-repeating list
of indices of all nodes N in this
GraphPerspective such that N is a "node neighbor" of the node at specified index,
or null if no node at specified index exists in this GraphPerspective.
Deprecated.Use getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean) instead;
if you decide to use this method anyways, please note that the definition
of "node neighbor" is such: Node A is a "node neighbor" of node B if and only
if there exists an edge [directed or undirected] E such that A is E's target and
B is E's source, or
A is E's source and B is E's target; this method then returns a non-repeating list
of all nodes N in this
GraphPerspective such that N is a "node neighbor" of node, the input parameter.
Deprecated.Use getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean) instead;
if you decide to use this method anyways, please note that the definition
of "node neighbor" is such: Node A is a "node neighbor" of node B if and only
if there exists an edge [directed or undirected] E such that A is E's target and
B is E's source, or
A is E's source and B is E's target; this method then returns a non-repeating list
of all nodes N in this
RootGraph such that N is a "node neighbor" of node, the input parameter.
Nodes and Edges comprise an additional directed graph through the
contains-a relationship, in which a MetaParent Node contains each of its
MetaChild Nodes and Edges.
Nodes and Edges comprise an additional directed graph through the
contains-a relationship, in which a MetaParent Node contains each of its
MetaChild Nodes and Edges.
Nodes and Edges comprise an additional directed graph through the
contains-a relationship, in which a MetaParent Node contains each of its
MetaChild Nodes and Edges.
Nodes and Edges comprise an additional directed graph through the
contains-a relationship, in which a MetaParent Node contains each of its
MetaChild Nodes and Edges.