Uses of Package
org.jgrapht
-
Packages that use org.jgrapht Package Description org.jgrapht org.jgrapht.alg Algorithms provided with JGraphT.org.jgrapht.alg.cycle Algorithms for enumeration of simple cycles in graphs.org.jgrapht.alg.flow Flow related algorithms.org.jgrapht.alg.interfaces Algorithm related interfaces.org.jgrapht.alg.isomorphism Algorithms for (sub)graph isomorphism.org.jgrapht.alg.matching Algorithms for the computation of matchings.org.jgrapht.alg.scoring Vertex and/or edge scoring algorithms.org.jgrapht.alg.shortestpath Shortest-path related algorithms.org.jgrapht.alg.spanning Spanning tree and spanner algorithms.org.jgrapht.alg.util Utilities used by JGraphT algorithms.org.jgrapht.alg.vertexcover Vertex cover algorithms.org.jgrapht.experimental Experimental work or work-in-progress.org.jgrapht.experimental.alg Experimental package with algorithms.org.jgrapht.experimental.alg.color Experimental package with graph coloring algorithms.org.jgrapht.experimental.dag Experimental package with directed acyclic graphs.org.jgrapht.generate Generators for graphs of various topologies.org.jgrapht.graph Implementations of various graphs.org.jgrapht.graph.builder Various builder for graphs.org.jgrapht.traverse Graph traversal means. -
Classes in org.jgrapht used by org.jgrapht Class Description 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.UndirectedGraph A graph whose all edges are undirected. -
Classes in org.jgrapht used by org.jgrapht.alg Class Description DirectedGraph A graph whose all edges are directed.Graph The root interface in the graph hierarchy.GraphPath 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 Class Description DirectedGraph A graph whose all edges are directed.Graph The root interface in the graph hierarchy.GraphPath UndirectedGraph A graph whose all edges are undirected. -
Classes in org.jgrapht used by org.jgrapht.alg.flow Class Description Graph The root interface in the graph hierarchy. -
Classes in org.jgrapht used by org.jgrapht.alg.interfaces Class Description DirectedGraph A graph whose all edges are directed.Graph The root interface in the graph hierarchy.GraphPath UndirectedGraph A graph whose all edges are undirected. -
Classes in org.jgrapht used by org.jgrapht.alg.isomorphism Class Description 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.alg.matching Class Description Graph The root interface in the graph hierarchy.UndirectedGraph A graph whose all edges are undirected. -
Classes in org.jgrapht used by org.jgrapht.alg.scoring Class Description DirectedGraph A graph whose all edges are directed.Graph The root interface in the graph hierarchy. -
Classes in org.jgrapht used by org.jgrapht.alg.shortestpath Class Description DirectedGraph A graph whose all edges are directed.Graph The root interface in the graph hierarchy.GraphPath -
Classes in org.jgrapht used by org.jgrapht.alg.spanning Class Description Graph The root interface in the graph hierarchy.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.util Class Description UndirectedGraph A graph whose all edges are undirected. -
Classes in org.jgrapht used by org.jgrapht.alg.vertexcover Class Description UndirectedGraph A graph whose all edges are undirected. -
Classes in org.jgrapht used by org.jgrapht.experimental Class Description Graph The root interface in the graph hierarchy. -
Classes in org.jgrapht used by org.jgrapht.experimental.alg Class Description Graph The root interface in the graph hierarchy. -
Classes in org.jgrapht used by org.jgrapht.experimental.alg.color Class Description Graph The root interface in the graph hierarchy. -
Classes in org.jgrapht used by org.jgrapht.experimental.dag Class Description 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. -
Classes in org.jgrapht used by org.jgrapht.generate Class Description 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 Class Description 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 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.graph.builder Class Description DirectedGraph A graph whose all edges are directed.Graph The root interface in the graph hierarchy.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.traverse Class Description DirectedGraph A graph whose all edges are directed.Graph The root interface in the graph hierarchy.