||An abstract implementation of a directed graph that contains default methods
for basic topology traversal operations.
||The most basic implementation of Edge.
||Data structure for representing a simple directed graph.
||Allows the user to create a Graph representing a portion of an EdifCell based
on a specific EdifCellInstance in that EdifCell.
||Represents a Map between node objects within a
and a Collection of Edge objects.