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.
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.
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.
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
true if and only if a_node is a "node neighbor" of another_node 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
true if and only if node at index a_node_index is a "node neighbor" of node at
index another_node_index 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
true if and only if a_node is a "node neighbor" of another_node in this RootGraph.
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
true if and only if node at index a_node_index is a "node neighbor" of node at
index another_node_index in this RootGraph.
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.
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.