A graph whose all edges are directed.
An edge factory used by graphs for creating new edges.
The root interface in the graph hierarchy.
GraphMapping represents a bidirectional mapping between two graphs (called graph1 and graph2), which allows the caller to obtain the matching vertex or edge in either direction, from graph1 to graph2, or from graph2 to graph1.
A graph that supports listeners on structural change events.
A graph whose all edges are undirected.
A vertex factory used by graph algorithms for creating new vertices.
An interface for a graph whose edges have non-uniform weights.
A collection of utilities to assist with graph manipulation.
Copyright © 2016. All rights reserved.