Deprecated.Use getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean) instead;
if you decide to use this method anyways: this method returns true if and only if
either 1) there exists a directed edge E in this GraphPerspective such that the from
node specified is E's source node and the target node specified is E's target node
or 2) there exists an undirected edge E in this GraphPerspective such that E's
endpoints are the from and to nodes specified.
Deprecated.Use getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean) instead;
if you decide to use this method anyways: this method returns true if and only if
either 1) there exists a directed edge E in this GraphPerspective such that
from_node_index is E's source node's index and to_node_index is E's target node's
index or 2) there exists an undirected edge E in this GraphPerspective such that E's
endpoint nodes have indices from_node_index and to_node_index.
Deprecated.Use getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean) instead;
if you decide to use this method anyways: this method returns true if and only if
either 1) there exists a directed edge E in this RootGraph such that the from
node specified is E's source node and the target node specified is E's target node
or 2) there exists an undirected edge E in this RootGraph such that E's endpoints
are the from and to nodes specified.
Deprecated.Use getAdjacentEdgeIndicesArray(int, boolean, boolean, boolean) instead;
if you decide to use this method anyways: this method returns true if and only if
either 1) there exists a directed edge E in this RootGraph such that
from_node_index is E's source node's index and to_node_index is E's target node's
index or 2) there exists an undirected edge E in this RootGraph such that E's
endpoint nodes have indices from_node_index and to_node_index.
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.