A directed graph whose nodes are unique Objects with unique String labels and whose edges are IEdge objects. For each node, the list of labels of construction edges going out of a node has no duplicates, and there are no duplicate alternation or inheritance edges. Calling .ToString() on a node must return the label; these invariants must hold: getNode(String.valueOf(v)) == v String.valueOf(getNode(l)) == l (Note that a node is allowed to be null.) A node should also define .hashCode() and .Equals() properly so that it may be used as a HashMap key.
For a list of all members of this type, see IClassGraph Members.
Namespace: edu.neu.ccs.demeter.APRlib
Assembly: APRlib (in APRlib.dll)