Search Java Classes and Packages
#Org.jgrapht Classes and Interfaces - 218 results found.
| Name | Description | Type | Package | Framework |
| AbstractBaseGraph | The most general implementation of the Graph interface. | Class | org.jgrapht.graph | JGraph |
| AbstractBaseGraph .DirectedEdgeContainer | A container for vertex edges. | Class | org.jgrapht.graph.AbstractBaseGraph | JGraph |
| AbstractGraph | A skeletal implementation of the Graph interface, to minimize the effort required to implement graph interfaces. | Class | org.jgrapht.graph | JGraph |
| AbstractGraphBuilder | Base class for builders of GraphSee Also:DirectedGraphBuilderBase, | Class | org.jgrapht.graph.builder | JGraph |
| AbstractGraphIterator | An empty implementation of a graph iterator to minimize the effort required to implement graph iterators. | Class | org.jgrapht.traverse | JGraph |
| AdaptiveIsomorphismInspectorFactory | This class serves as a factory for GraphIsomorphismInspector concrete implementations. | Class | org.jgrapht.experimental.isomorphism | JGraph |
| ApproximationAlgorithm | Interface | org.jgrapht.experimental.alg | JGraph | |
| ArrayPermutationsIter | An interface to iterate over array permutations. | Interface | org.jgrapht.experimental.permutation | JGraph |
| ArrayUnenforcedSet | Helper for efficiently representing small sets whose elements are known to be unique by construction, implying we don't need to enforce the uniqueness | Class | org.jgrapht.util | JGraph |
| AsUndirectedGraph | An undirected view of the backing directed graph specified in the constructor. | Class | org.jgrapht.graph | JGraph |
| AsUnweightedDirectedGraph | An unweighted view of the backing weighted graph specified in the constructor. | Class | org.jgrapht.graph | JGraph |
| AsUnweightedGraph | An unweighted view of the backing weighted graph specified in the constructor. | Class | org.jgrapht.graph | JGraph |
| AsWeightedGraph | A weighted view of the backing graph specified in the constructor. | Class | org.jgrapht.graph | JGraph |
| BellmanFordShortestPath | algorithm: weights could be negative, paths could be constrained by a maximum number of edges. | Class | org.jgrapht.alg | JGraph |
| BiconnectivityInspector | Inspects a graph for the biconnectivity property. | Class | org.jgrapht.alg | JGraph |
| BlockCutpointGraph | Definition of a block of a graph in MathWorld. | Class | org.jgrapht.alg | JGraph |
| BreadthFirstIterator | A breadth-first iterator for a directed and an undirected graph. | Class | org.jgrapht.traverse | JGraph |
| BronKerboschCliqueFinder | This class implements Bron-Kerbosch clique detection algorithm as it is described in [Samudrala R. | Class | org.jgrapht.alg | JGraph |
| BrownBacktrackColoring | Class | org.jgrapht.experimental.alg.color | JGraph | |
| ChromaticNumber | chromatic number of a graph to be calculated. | Class | org.jgrapht.alg | JGraph |
| ClassBasedEdgeFactory | An EdgeFactory for producing edges by using a class as a factory. | Class | org.jgrapht.graph | JGraph |
| ClassBasedVertexFactory | A VertexFactory for producing vertices by using a class as a factory. | Class | org.jgrapht.graph | JGraph |
| CliqueMinimalSeparatorDecomposition | Clique Minimal Separator Decomposition using MCS-M+ and Atoms algorithm as described in Berry et al. | Class | org.jgrapht.alg | JGraph |
| ClosestFirstIterator | A closest-first iterator for a directed or undirected graph. | Class | org.jgrapht.traverse | JGraph |
| CollectionPermutationIter | Given a container with elements (Collection,Enumeration,array) defines a permutation iterator which returns, on each iteration, a differnt permutation | Class | org.jgrapht.experimental.permutation | JGraph |
| CompleteBipartiteGraphGenerator | Generates a complete bipartite graph of any size. | Class | org.jgrapht.generate | JGraph |
| CompleteGraphDemo | Class | org.jgrapht.demo | JGraph | |
| CompleteGraphGenerator | Generates a complete graph of any size. | Class | org.jgrapht.generate | JGraph |
| ComponentAttributeProvider | Provides display attributes for vertices and/or edges in a graph. | Interface | org.jgrapht.ext | JGraph |
| CompoundPermutationIter | For permutation like this: 1,2 are the same eq. | Class | org.jgrapht.experimental.permutation | JGraph |
| ConnectedComponentTraversalEvent | A traversal event with respect to a connected component. | Class | org.jgrapht.event | JGraph |
| ConnectivityInspector | Allows obtaining various connectivity aspects of a graph. | Class | org.jgrapht.alg | JGraph |
| CrossComponentIterator | Provides a cross-connected-component traversal functionality for iteratorSince:Jan 31, 2004Author:Barak Naveh | Class | org.jgrapht.traverse | JGraph |
| CrossComponentIterator .VisitColor | Standard vertex visit state enumeration. | Class | org.jgrapht.traverse.CrossComponentIterator | JGraph |
| CycleDetector | Performs cycle detection on a graph. | Class | org.jgrapht.alg | JGraph |
| DefaultDirectedGraph | A directed graph. | Class | org.jgrapht.graph | JGraph |
| DefaultDirectedWeightedGraph | A directed weighted graph. | Class | org.jgrapht.graph | JGraph |
| DefaultEdge | A default implementation for edges in a Graph. | Class | org.jgrapht.graph | JGraph |
| DefaultGraphMapping | getVertex/EdgeCorrespondence is based on the performance of the concrete Map class which is passed in the constructor. | Class | org.jgrapht.graph | JGraph |
| DefaultListenableGraph | A graph backed by the the graph specified at the constructor, which can be listened by GraphListener s and by | Class | org.jgrapht.graph | JGraph |
| DefaultWeightedEdge | A default implementation for edges in a WeightedGraph. | Class | org.jgrapht.graph | JGraph |
| DepthFirstIterator | A depth-first iterator for a directed and an undirected graph. | Class | org.jgrapht.traverse | JGraph |
| DijkstraShortestPath | An implementation of Dijkstra's shortest path algorithm using ClosestFirstIterator. | Class | org.jgrapht.alg | JGraph |
| DirectedAcyclicGraph | DirectedAcyclicGraph implements a DAG that can be modified (vertices & edges added and removed), is guaranteed to remain acyclic, and provides fast | Class | org.jgrapht.experimental.dag | JGraph |
| DirectedAcyclicGraph .CycleFoundException | Exception used in dfsF when a cycle is foundAuthor:gilespSee Also:Serialized Form | Class | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedAcyclicGraph .Region | Region is an *inclusive* range of indices. | Class | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedAcyclicGraph .TopoOrderMapping | For performance tuning, an interface for storing the topological orderingget the topological index of the given vertex. | Interface | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedAcyclicGraph .TopoOrderMappingFactory | DirectedAcyclicGraph. | Interface | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedAcyclicGraph .Visited | this interface allows specification of a strategy for marking vertices as visited (based on their topological index, so the vertex type isn't part | Interface | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedAcyclicGraph .VisitedArrayImpl | This implementation, somewhat to my surprise, is slower than the ArrayList version, probably due to its reallocation of the underlying | Class | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedAcyclicGraph .VisitedArrayListImpl | This implementation seems to offer the best performance in most cases. | Class | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedAcyclicGraph .VisitedBitSetImpl | This implementation is close to the performance of VisitedArrayListImpl, with 1/8 the memory usage. | Class | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedAcyclicGraph .VisitedFactory | DirectedAcyclicGraph. | Interface | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedAcyclicGraph .VisitedHashSetImpl | This implementation doesn't seem to perform as well, though I can imagine circumstances where it should shine (lots and lots of vertices). | Class | org.jgrapht.experimental.dag.DirectedAcyclicGraph | JGraph |
| DirectedGraph | A graph whose all edges are directed. | Interface | org.jgrapht | JGraph |
| DirectedGraphBuilder | A builder class for Graph. | Class | org.jgrapht.graph.builder | JGraph |
| DirectedGraphBuilderBase | Base class for DirectedGraphBuilder for extending. | Class | org.jgrapht.graph.builder | JGraph |
| DirectedGraphUnion | Class | org.jgrapht.graph | JGraph | |
| DirectedMaskSubgraph | A directed graph that is a MaskSubgraph on another graph. | Class | org.jgrapht.graph | JGraph |
| DirectedMultigraph | A directed multigraph. | Class | org.jgrapht.graph | JGraph |
| DirectedNeighborIndex | Maintains a cache of each vertex's neighbors. | Class | org.jgrapht.alg | JGraph |
| DirectedPseudograph | A directed pseudograph. | Class | org.jgrapht.graph | JGraph |
| DirectedSimpleCycles | A common interface for classes implementing algorithms for enumeration of the simple cycles of a directed graph. | Interface | org.jgrapht.alg.cycle | JGraph |
| DirectedSubgraph | A directed graph that is a subgraph on other graph. | Class | org.jgrapht.graph | JGraph |
| DirectedWeightedGraphBuilder | A builder class for directed weighted graphs}. | Class | org.jgrapht.graph.builder | JGraph |
| DirectedWeightedGraphBuilderBase | Base class for DirectedWeightedGraphBuilder for extending. | Class | org.jgrapht.graph.builder | JGraph |
| DirectedWeightedMultigraph | A directed weighted multigraph. | Class | org.jgrapht.graph | JGraph |
| DirectedWeightedPseudograph | A directed weighted pseudograph. | Class | org.jgrapht.graph | JGraph |
| DirectedWeightedSubgraph | A directed weighted graph that is a subgraph on other graph. | Class | org.jgrapht.graph | JGraph |
| DOTExporter | Exports a graph into a DOT file. | Class | org.jgrapht.ext | JGraph |
| EdgeFactory | An edge factory used by graphs for creating new edges. | Interface | org.jgrapht | JGraph |
| EdgeNameProvider | Assigns a display name for each of the graph edes. | Interface | org.jgrapht.ext | JGraph |
| EdgeReversedGraph | Provides an edge-reversed view g' of a directed graph g. | Class | org.jgrapht.graph | JGraph |
| EdgeSetFactory | A factory for edge sets. | Interface | org.jgrapht.graph | JGraph |
| EdgeTraversalEvent | A traversal event for a graph edge. | Class | org.jgrapht.event | JGraph |
| EdmondsBlossomShrinking | An implementation of Edmonds Blossom Shrinking algorithm for constructing maximum matchings on graphs. | Class | org.jgrapht.alg | JGraph |
| EdmondsKarpMaximumFlow | directed graph where each edge has a capacity and each edge receives a flow. | Class | org.jgrapht.alg | JGraph |
| EmptyGraphGenerator | graph of any size. | Class | org.jgrapht.generate | JGraph |
| EquivalenceComparator | This interface distinguishes between Equivalence sets. | Interface | org.jgrapht.experimental.equivalence | JGraph |
| EquivalenceComparatorChain | A container of comparators, which are tested in a chain until the first result can be supplied. | Interface | org.jgrapht.experimental.equivalence | JGraph |
| EquivalenceComparatorChainBase | This class implements comparator chaining. | Class | org.jgrapht.experimental.equivalence | JGraph |
| EquivalenceSet | EquivalenceSet is a Set of elements which have been determined to be equivalent using EquivalenceComparator. | Class | org.jgrapht.experimental.equivalence | JGraph |
| EquivalenceSetCreator | Class | org.jgrapht.experimental.equivalence | JGraph | |
| EulerianCircuit | This algorithm will check whether a graph is Eulerian (hence it contains an circuit). | Class | org.jgrapht.alg | JGraph |
| ExactAlgorithm | Interface | org.jgrapht.experimental.alg | JGraph | |
| FibonacciHeap | This class implements a Fibonacci heap data structure. | Class | org.jgrapht.util | JGraph |
| FibonacciHeapNode | for maintaining the structure of the heap. | Class | org.jgrapht.util | JGraph |
| FloydWarshallShortestPaths | Floyd-Warshall algorithm finds all shortest paths (all n^2 of them) in O(n^3) time. | Class | org.jgrapht.alg | JGraph |
| GmlExporter | Exports a graph into a GML file (Graph Modelling Language). | Class | org.jgrapht.ext | JGraph |
| Graph | The root interface in the graph hierarchy. | Interface | org.jgrapht | JGraph |
| GraphChangeEvent | An event which indicates that a graph has changed. | Class | org.jgrapht.event | JGraph |
| GraphDelegator | A graph backed by the the graph specified at the constructor, which delegates all its methods to the backing graph. | Class | org.jgrapht.graph | JGraph |
| GraphEdgeChangeEvent | An event which indicates that a graph edge has changed, or is about to change. | Class | org.jgrapht.event | JGraph |
| GraphGenerator | GraphGenerator defines an interface for generating new graph structures. | Interface | org.jgrapht.generate | JGraph |
| GraphHelper | A collection of utilities to assist the working with graphs. | Class | org.jgrapht | JGraph |
| GraphIsomorphismInspector | Isomorphism Overview Isomorphism is the problem of testing whether two graphs are topologically | Interface | org.jgrapht.experimental.isomorphism | JGraph |
| GraphIterator | Interface | org.jgrapht.traverse | JGraph | |
| GraphListener | A listener that is notified when the graph changes. | Interface | org.jgrapht.event | JGraph |
| GraphMapping | GraphMapping represents a bidirectional mapping between two graphs (called graph1 and graph2), which allows the caller to obtain the matching vertex or | Interface | org.jgrapht | JGraph |
| GraphMLExporter | Exports a graph into a GraphML file. | Class | org.jgrapht.ext | JGraph |
| GraphOrdering | Holds graph information as int labels only. | Class | org.jgrapht.experimental.isomorphism | JGraph |
| GraphPath | A GraphPath represents a path in a Graph. | Interface | org.jgrapht | JGraph |
| GraphPathImpl | GraphPathImpl is a default implementation of GraphPath. | Class | org.jgrapht.graph | JGraph |
| GraphReader | Class | org.jgrapht.experimental | JGraph | |
| Graphs | A collection of utilities to assist with graph manipulation. | Class | org.jgrapht | JGraph |
| GraphSquare | Class | org.jgrapht.experimental | JGraph | |
| GraphTests | Class | org.jgrapht.experimental | JGraph | |
| GraphUnion | Read-only union of two graphs: G1 and G2. | Class | org.jgrapht.graph | JGraph |
| GraphVertexChangeEvent | An event which indicates that a graph vertex has changed, or is about to change. | Class | org.jgrapht.event | JGraph |
| GreedyColoring | Class | org.jgrapht.experimental.alg.color | JGraph | |
| GridGraphGenerator | Generates a bidirectional grid graph of any size. | Class | org.jgrapht.generate | JGraph |
| HamiltonianCycle | This class will deal with finding the optimal or approximately optimal minimum tour (hamiltonian cycle) or commonly known as the Traveling | Class | org.jgrapht.alg | JGraph |
| HelloJGraphT | A simple introduction to using JGraphT. | Class | org.jgrapht.demo | JGraph |
| HopcroftKarpBipartiteMatching | This class is an implementation of the Hopcroft-Karp algorithm which finds a maximum matching in an undirected simple bipartite graph. | Class | org.jgrapht.alg | JGraph |
| HyperCubeGraphGenerator | cube graph of any size. | Class | org.jgrapht.generate | JGraph |
| IntArrayGraphAlgorithm | Class | org.jgrapht.experimental.alg | JGraph | |
| IntegerEdgeNameProvider | Assigns a unique integer to represent each edge. | Class | org.jgrapht.ext | JGraph |
| IntegerNameProvider | Assigns a unique integer to represent each vertex. | Class | org.jgrapht.ext | JGraph |
| IntegerPermutationIter | Iterates through permutations of N elements. | Class | org.jgrapht.experimental.permutation | JGraph |
| IsomorphismRelation | Holds an isomorphism relation for two graphs. | Class | org.jgrapht.experimental.isomorphism | JGraph |
| JGraphAdapterDemo | A demo applet that shows how to use JGraph to visualize JGraphT graphs. | Class | org.jgrapht.demo | JGraph |
| JGraphModelAdapter | An adapter that reflects a JGraphT graph as a JGraph graph. | Class | org.jgrapht.ext | JGraph |
| JGraphModelAdapter .CellFactory | Creates the JGraph cells that reflect the respective JGraphT elements. | Interface | org.jgrapht.ext.JGraphModelAdapter | JGraph |
| JGraphModelAdapter .DefaultCellFactory | A simple default cell factory. | Class | org.jgrapht.ext.JGraphModelAdapter | JGraph |
| JGraphXAdapter | Adapter to draw a JGraphT graph with the JGraphX drawing library. | Class | org.jgrapht.ext | JGraph |
| JGraphXAdapterDemo | A demo applet that shows how to use JGraphX to visualize JGraphT graphs. | Class | org.jgrapht.demo | JGraph |
| JohnsonSimpleCycles | Find all simple cycles of a directed graph using the Johnson's algorithm. | Class | org.jgrapht.alg.cycle | JGraph |
| KruskalMinimumSpanningTree | An implementation of Kruskal's minimum spanning tree algorithm. | Class | org.jgrapht.alg | JGraph |
| KShortestPaths | The algorithm determines the k shortest simple paths in increasing order of weight. | Class | org.jgrapht.alg | JGraph |
| KuhnMunkresMinimalWeightBipartitePerfectMatching | Kuhn-Munkres algorithm (named in honor of Harold Kuhn and James Munkres) solving assignment problem also known as hungarian algorithm | Class | org.jgrapht.alg | JGraph |
| KuhnMunkresMinimalWeightBipartitePerfectMatching .KuhnMunkresMatrixImplementation | Class | org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching | JGraph | |
| LinearGraphGenerator | Generates a linear graph of any size. | Class | org.jgrapht.generate | JGraph |
| ListenableDirectedGraph | A directed graph which is also ListenableGraph. | Class | org.jgrapht.graph | JGraph |
| ListenableDirectedWeightedGraph | A directed weighted graph which is also ListenableGraph. | Class | org.jgrapht.graph | JGraph |
| ListenableGraph | A graph that supports listeners on structural change events. | Interface | org.jgrapht | JGraph |
| ListenableUndirectedGraph | An undirected graph which is also ListenableGraph. | Class | org.jgrapht.graph | JGraph |
| ListenableUndirectedWeightedGraph | An undirected weighted graph which is also ListenableGraph. | Class | org.jgrapht.graph | JGraph |
| MaskFunctor | A functor interface for masking out vertices and edges of a graph. | Interface | org.jgrapht.graph | JGraph |
| MaskSubgraph | An unmodifiable subgraph induced by a vertex/edge masking function. | Class | org.jgrapht.graph | JGraph |
| MatchingAlgorithm | Allows to derive matching fromReturns set of edges making up the matching | Interface | org.jgrapht.alg.interfaces | JGraph |
| MathUtil | Math Utilities. | Class | org.jgrapht.util | JGraph |
| MatrixExporter | Exports a graph to a plain text matrix format, which can be processed by matrix manipulation software, such as | Class | org.jgrapht.ext | JGraph |
| MinimumSpanningTree | minimum spanning tree from given undirected connected graph. | Interface | org.jgrapht.alg.interfaces | JGraph |
| MinSourceSinkCut | Given a directed, weighted graph G(V,E). | Class | org.jgrapht.alg | JGraph |
| ModifiableInteger | The ModifiableInteger class wraps a value of the primitive type int in an object, similarly to Integer. | Class | org.jgrapht.util | JGraph |
| Multigraph | A multigraph. | Class | org.jgrapht.graph | JGraph |
| NaiveLcaFinder | Class | org.jgrapht.alg | JGraph | |
| NeighborIndex | Maintains a cache of each vertex's neighbors. | Class | org.jgrapht.alg | JGraph |
| ParanoidGraph | ParanoidGraph provides a way to verify that objects added to a graph obey the standard equals/hashCode contract. | Class | org.jgrapht.graph | JGraph |
| PartiteRandomGraphGenerator | PartiteRandomGraphGenerator generates a partite uniform random graph of any size. | Class | org.jgrapht.experimental | JGraph |
| PatonCycleBase | Find a cycle base of an undirected graph using the Paton's algorithm. | Class | org.jgrapht.alg.cycle | JGraph |
| PerformanceDemo | A simple demo to test memory and CPU consumption on a graph with 3 million NOTE: To run this demo you may need to increase the JVM max mem size. | Class | org.jgrapht.demo | JGraph |
| PermutationFactory | Factory to create Permutations of several types and use them as Enumerations. | Class | org.jgrapht.experimental.permutation | JGraph |
| PrefetchIterator | Utility class to help implement an iterator/enumerator in which the hasNext() method needs to calculate the next elements ahead of time. | Class | org.jgrapht.util | JGraph |
| PrefetchIterator .NextElementFunctor | You must implement that NoSuchElementException is thrown on nextElement() if it is out of bound. | Interface | org.jgrapht.util.PrefetchIterator | JGraph |
| PrimMinimumSpanningTree | An implementation of Prim's algorithm that finds a minimum spanning tree/forest subject to | Class | org.jgrapht.alg | JGraph |
| Pseudograph | A pseudograph. | Class | org.jgrapht.graph | JGraph |
| RandomGraphGenerator | This Generator creates a random-topology graph of a specified number of vertexes and edges. | Class | org.jgrapht.generate | JGraph |
| RandomGraphGenerator .EdgeTopologyFactory | This class is used to generate the edge topology for a graph. | Interface | org.jgrapht.generate.RandomGraphGenerator | JGraph |
| RandomGraphHelper | UniformRandomGraphGenerator generates a uniform random graph of any size. | Class | org.jgrapht.experimental | JGraph |
| RingGraphGenerator | Generates a ring graph of any size. | Class | org.jgrapht.generate | JGraph |
| ScaleFreeGraphGenerator | Generates directed or undirected scale-free network of any size. | Class | org.jgrapht.generate | JGraph |
| SimpleDirectedGraph | A simple directed graph. | Class | org.jgrapht.graph | JGraph |
| SimpleDirectedWeightedGraph | A simple directed weighted graph. | Class | org.jgrapht.graph | JGraph |
| SimpleGraph | A simple graph. | Class | org.jgrapht.graph | JGraph |
| SimpleGraphPath | A vertex-based representation of a simple path. | Class | org.jgrapht.graph | JGraph |
| SimpleWeightedBipartiteGraphMatrixGenerator | Class | org.jgrapht.generate | JGraph | |
| SimpleWeightedGraph | A simple weighted graph. | Class | org.jgrapht.graph | JGraph |
| SimpleWeightedGraphMatrixGenerator | Class | org.jgrapht.generate | JGraph | |
| StarGraphGenerator | graph of any size. | Class | org.jgrapht.generate | JGraph |
| StoerWagnerMinimumCut | Wagner minimum cut algorithm. | Class | org.jgrapht.alg | JGraph |
| StringEdgeNameProvider | Generates edge names by invoking Object. | Class | org.jgrapht.ext | JGraph |
| StringNameProvider | Generates vertex names by invoking Object. | Class | org.jgrapht.ext | JGraph |
| StrongConnectivityInspector | Complements the ConnectivityInspector class with the capability to compute the strongly connected components of a directed | Class | org.jgrapht.alg | JGraph |
| Subgraph | A subgraph is a graph that has a subset of vertices and a subset of edges with respect to some base graph. | Class | org.jgrapht.graph | JGraph |
| SzwarcfiterLauerSimpleCycles | Find all simple cycles of a directed graph using the Schwarcfiter and Lauer's J. | Class | org.jgrapht.alg.cycle | JGraph |
| TarjanLowestCommonAncestor | Class | org.jgrapht.alg | JGraph | |
| TarjanLowestCommonAncestor .LcaRequestResponse | Class | org.jgrapht.alg.TarjanLowestCommonAncestor | JGraph | |
| TarjanSimpleCycles | Find all simple cycles of a directed graph using the Tarjan's algorithm. | Class | org.jgrapht.alg.cycle | JGraph |
| TiernanSimpleCycles | Find all simple cycles of a directed graph using the Tiernan's algorithm. | Class | org.jgrapht.alg.cycle | JGraph |
| TopologicalOrderIterator | topological sort is a permutation p of the vertices of a graph such that an edge (i,j) implies that i appears before j | Class | org.jgrapht.traverse | JGraph |
| TransitiveClosure | Constructs the transitive closure of the input graph. | Class | org.jgrapht.alg | JGraph |
| TraversalListener | A listener on graph iterator or on a graph traverser. | Interface | org.jgrapht.event | JGraph |
| TraversalListenerAdapter | An empty do-nothing implementation of the TraversalListener interface used for subclasses. | Class | org.jgrapht.event | JGraph |
| TypeUtil | TypeUtil isolates type-unsafety so that code which uses it for legitimate reasons can stay warning-free. | Class | org.jgrapht.util | JGraph |
| UndirectedCycleBase | A common interface for classes implementing algorithms for finding a cycle base of an undirected graph. | Interface | org.jgrapht.alg.cycle | JGraph |
| UndirectedGraph | A graph whose all edges are undirected. | Interface | org.jgrapht | JGraph |
| UndirectedGraphBuilder | A builder class for Graph. | Class | org.jgrapht.graph.builder | JGraph |
| UndirectedGraphBuilderBase | Base class for UndirectedGraphBuilder for extending. | Class | org.jgrapht.graph.builder | JGraph |
| UndirectedGraphUnion | See Also:Serialized FormReturns the degree of the specified vertex. | Class | org.jgrapht.graph | JGraph |
| UndirectedMaskSubgraph | An undirected graph that is a MaskSubgraph on another graph. | Class | org.jgrapht.graph | JGraph |
| UndirectedSubgraph | An undirected graph that is a subgraph on other graph. | Class | org.jgrapht.graph | JGraph |
| UndirectedWeightedGraphBuilder | A builder class for undirected weighted graphs. | Class | org.jgrapht.graph.builder | JGraph |
| UndirectedWeightedGraphBuilderBase | Base class for UndirectedWeightedGraphBuilder for extending. | Class | org.jgrapht.graph.builder | JGraph |
| UndirectedWeightedSubgraph | An undirected weighted graph that is a subgraph on other graph. | Class | org.jgrapht.graph | JGraph |
| UniformEquivalenceComparator | This Equivalence comparator acts as if all elements are in one big global equivalence class. | Class | org.jgrapht.experimental.equivalence | JGraph |
| UniformRandomGraphGenerator | UniformRandomGraphGenerator generates a uniform random graph of any size. | Class | org.jgrapht.experimental | JGraph |
| UnionFind | An implementation of Union Find data structure. | Class | org.jgrapht.alg.util | JGraph |
| UnmodifiableDirectedGraph | A directed graph that cannot be modified. | Class | org.jgrapht.graph | JGraph |
| UnmodifiableGraph | An unmodifiable view of the backing graph specified in the constructor. | Class | org.jgrapht.graph | JGraph |
| UnmodifiableUndirectedGraph | An undirected graph that cannot be modified. | Class | org.jgrapht.graph | JGraph |
| VertexCovers | Algorithms to find a vertex cover for a graph. | Class | org.jgrapht.alg | JGraph |
| VertexDegreeComparator | Compares two vertices based on their degree. | Class | org.jgrapht.alg.util | JGraph |
| VertexDegreeEquivalenceComparator | Two vertexes are equivalent under this comparator if and only if: they have the same IN degree | Class | org.jgrapht.experimental.isomorphism | JGraph |
| VertexFactory | A vertex factory used by graph algorithms for creating new vertices. | Interface | org.jgrapht | JGraph |
| VertexNameProvider | Assigns a display name for each of the graph vertices. | Interface | org.jgrapht.ext | JGraph |
| VertexPair | Representation of a pair of vertices; to be replaced by Pair | Class | org.jgrapht.util | JGraph |
| VertexSetListener | A listener that is notified when the graph's vertex set changes. | Interface | org.jgrapht.event | JGraph |
| VertexTraversalEvent | A traversal event for a graph vertex. | Class | org.jgrapht.event | JGraph |
| VisioExporter | Exports a graph to a csv format that can be imported into MS Visio. | Class | org.jgrapht.ext | JGraph |
| WeightCombiner | Binary operator for edge weights. | Interface | org.jgrapht.util | JGraph |
| WeightedGraph | An interface for a graph whose edges have non-uniform weights. | Interface | org.jgrapht | JGraph |
| WeightedGraphGenerator | Class | org.jgrapht.generate | JGraph | |
| WeightedGraphGeneratorAdapter | WeightedGraphGenerator defines an interface for generating graph structures having edges weighted with real values. | Class | org.jgrapht.generate | JGraph |
| WeightedMatchingAlgorithm | Allows to derive weighted matching from general graphSee Also:MatchingAlgorithm | Interface | org.jgrapht.alg.interfaces | JGraph |
| WeightedMultigraph | A weighted multigraph. | Class | org.jgrapht.graph | JGraph |
| WeightedPseudograph | A weighted pseudograph. | Class | org.jgrapht.graph | JGraph |
| WheelGraphGenerator | graph of any size. | Class | org.jgrapht.generate | JGraph |