-
directed
boolean directed
set to true to get a directed graph and false to get an undirected graph.
An undirected graph does not treat the order of node in an edgeLabel as significant.
In other words, g.getEdge("a", "b") == g.getEdge("b", "a") for an undirected graph.
Default: true.
-
multiGraph
boolean multiGraph
set to true to allow a graph to have multiple edgeLabel between the same pair of nodes.
Default: false.
-
compound
boolean compound
set to true to allow a graph to have compound node - node which can be the parent of other nodes.
Default: false.
-
nodes
Map<K,V> nodes
nodeId -> node data
-
in
Map<K,V> in
nodeId -> edgeId -> in Edge
-
pred
Map<K,V> pred
nodeId -> in nodeId -> link count
-
out
Map<K,V> out
nodeId -> edgeId -> out Edge
-
sucs
Map<K,V> sucs
nodeId -> out nodeId -> link count
-
edgeObjs
Map<K,V> edgeObjs
edgeId -> Edge object
-
edgeLabels
Map<K,V> edgeLabels
edgeId -> getEdge data
-
parent
Map<K,V> parent
node -> parent node
-
children
Map<K,V> children
node -> children node -> true
-
nodeCount
int nodeCount
Number of node in the graph. Should only be changed by the implementation.
-
edgeCount
int edgeCount
Number of getEdge in the graph. Should only be changed by the implementation.