Package | Description |
---|---|
org.jgrapht.alg |
Algorithms provided with JGraphT.
|
org.jgrapht.experimental.dag |
Experimental package with directed acyclic graphs.
|
org.jgrapht.graph |
Implementations of various graphs.
|
Modifier and Type | Method and Description |
---|---|
<V,E> void |
TransitiveClosure.closeSimpleDirectedGraph(SimpleDirectedGraph<V,E> graph)
Computes the transitive closure of the given graph.
|
Modifier and Type | Class and Description |
---|---|
class |
DirectedAcyclicGraph<V,E>
DirectedAcyclicGraph implements a DAG that can be modified (vertices & edges added and
removed), is guaranteed to remain acyclic, and provides fast topological order iteration.
|
Modifier and Type | Class and Description |
---|---|
class |
SimpleDirectedWeightedGraph<V,E>
A simple directed weighted graph.
|
Modifier and Type | Method and Description |
---|---|
static <V,E> DirectedGraphBuilderBase<V,E,? extends SimpleDirectedGraph<V,E>,?> |
SimpleDirectedGraph.builder(Class<? extends E> edgeClass)
Create a builder for this kind of graph.
|
static <V,E> DirectedGraphBuilderBase<V,E,? extends SimpleDirectedGraph<V,E>,?> |
SimpleDirectedGraph.builder(EdgeFactory<V,E> ef)
Create a builder for this kind of graph.
|
Copyright © 2016. All rights reserved.