Uses of Package
org.jgrapht

Packages that use org.jgrapht
org.jgrapht The front-end API's interfaces and classes, including Graph, DirectedGraph and UndirectedGraph
org.jgrapht.alg Algorithms provided with JGraphT
org.jgrapht.alg.cycle Algorithms for enumeration of simple cycles in graphs. 
org.jgrapht.alg.util Utilities used by JGraphT algorithms. 
org.jgrapht.experimental A package that contains experimental work or work-in-progress that is not yet ready to be included in a release. 
org.jgrapht.experimental.alg   
org.jgrapht.experimental.alg.color   
org.jgrapht.experimental.dag   
org.jgrapht.experimental.isomorphism Algorithms which provide isomorphism check between two graphs. 
org.jgrapht.ext Extensions and integration means to other products. 
org.jgrapht.generate Generators for graphs of various topologies. 
org.jgrapht.graph Implementations of various graphs. 
org.jgrapht.traverse Graph traversal means. 
 

Classes in org.jgrapht used by org.jgrapht
DirectedGraph
          A graph whose all edges are directed.
EdgeFactory
          An edge factory used by graphs for creating new edges.
Graph
          The root interface in the graph hierarchy.
GraphPath
          A GraphPath represents a path in a Graph.
Graphs
          A collection of utilities to assist with graph manipulation.
UndirectedGraph
          A graph whose all edges are undirected.
 

Classes in org.jgrapht used by org.jgrapht.alg
DirectedGraph
          A graph whose all edges are directed.
Graph
          The root interface in the graph hierarchy.
GraphPath
          A GraphPath represents a path in a Graph.
UndirectedGraph
          A graph whose all edges are undirected.
WeightedGraph
          An interface for a graph whose edges have non-uniform weights.
 

Classes in org.jgrapht used by org.jgrapht.alg.cycle
DirectedGraph
          A graph whose all edges are directed.
UndirectedGraph
          A graph whose all edges are undirected.
 

Classes in org.jgrapht used by org.jgrapht.alg.util
UndirectedGraph
          A graph whose all edges are undirected.
 

Classes in org.jgrapht used by org.jgrapht.experimental
Graph
          The root interface in the graph hierarchy.
VertexFactory
          A vertex factory used by graph algorithms for creating new vertices.
 

Classes in org.jgrapht used by org.jgrapht.experimental.alg
Graph
          The root interface in the graph hierarchy.
 

Classes in org.jgrapht used by org.jgrapht.experimental.alg.color
Graph
          The root interface in the graph hierarchy.
 

Classes in org.jgrapht used by org.jgrapht.experimental.dag
DirectedGraph
          A graph whose all edges are directed.
Graph
          The root interface in the graph hierarchy.
 

Classes in org.jgrapht used by org.jgrapht.experimental.isomorphism
Graph
          The root interface in the graph hierarchy.
GraphMapping
          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.
 

Classes in org.jgrapht used by org.jgrapht.ext
DirectedGraph
          A graph whose all edges are directed.
Graph
          The root interface in the graph hierarchy.
ListenableGraph
          A graph that supports listeners on structural change events.
UndirectedGraph
          A graph whose all edges are undirected.
 

Classes in org.jgrapht used by org.jgrapht.generate
EdgeFactory
          An edge factory used by graphs for creating new edges.
Graph
          The root interface in the graph hierarchy.
VertexFactory
          A vertex factory used by graph algorithms for creating new vertices.
WeightedGraph
          An interface for a graph whose edges have non-uniform weights.
 

Classes in org.jgrapht used by org.jgrapht.graph
DirectedGraph
          A graph whose all edges are directed.
EdgeFactory
          An edge factory used by graphs for creating new edges.
Graph
          The root interface in the graph hierarchy.
GraphMapping
          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.
GraphPath
          A GraphPath represents a path in a Graph.
ListenableGraph
          A graph that supports listeners on structural change events.
UndirectedGraph
          A graph whose all edges are undirected.
VertexFactory
          A vertex factory used by graph algorithms for creating new vertices.
WeightedGraph
          An interface for a graph whose edges have non-uniform weights.
 

Classes in org.jgrapht used by org.jgrapht.traverse
DirectedGraph
          A graph whose all edges are directed.
Graph
          The root interface in the graph hierarchy.
 



Copyright © 2013. All rights reserved.