Interface SimpleGraph

All Superinterfaces:
All Known Implementing Classes:
AbstractSimpleGraph, DirectedSimpleGraph, UndirectedSimpleGraph

public interface SimpleGraph
extends Graph

        This interface declares that each implemented class is a graph that does
        not contain duplicate edges, and does not contain self loops. For
        directed graphs, this means for node n1 and n2, it is possible to have
        both edges (n1, n2) and (n2, n1), but not two separate (n1, n2).

1.0 (September 20, 2005) Change History: 1.0 - Initial version
Kevin Yuk-Lap Yip

Method Summary
Methods inherited from interface org.gersteinlab.tyna.core.graph.Graph
addEdge, addNode, containsEdge, containsNode, getAttr, getAttrs, getEdgeCount, getEdgeIterator, getEdgeNodePairs, getNode, getNodeCount, getNodeIterator, setAttr