| Package | Description | 
|---|---|
| org.clafer.graph | 
 This package provides data structure and algorithms for directed graphs. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
KeyGraph<V>
A graph where every data is mapped to exactly one node. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
static <V> List<Set<V>> | 
GraphUtil.computeStronglyConnectedComponents(Graph<V> graph)
Compute the strongly connected components in the graph in topological
 order. 
 | 
static <V> boolean | 
GraphUtil.hasPath(Vertex<V> start,
              Vertex<V> end,
              Graph<V> graph)  | 
Copyright © 2013. All Rights Reserved.