| Package | Description |
|---|---|
| org.jgrapht.alg |
Algorithms provided with JGraphT.
|
| org.jgrapht.experimental.dag |
Experimental package with directed acyclic graphs.
|
| Modifier and Type | Method and Description |
|---|---|
<V,E> void |
TransitiveClosure.closeDirectedAcyclicGraph(DirectedAcyclicGraph<V,E> graph)
Computes the transitive closure of a directed acyclic graph in O(n*m)
|
| Modifier and Type | Method and Description |
|---|---|
Set<V> |
DirectedAcyclicGraph.getAncestors(DirectedAcyclicGraph<V,E> graph,
V vertex) |
Set<V> |
DirectedAcyclicGraph.getDescendants(DirectedAcyclicGraph<V,E> graph,
V vertex) |
Copyright © 2017. All rights reserved.