Package  Description 

org.apache.calcite.util.graph 
Graphtheoretic algorithms and data structures.

Modifier and Type  Class and Description 

class 
DefaultDirectedGraph<V,E extends DefaultEdge>
Default implementation of
DirectedGraph . 
Modifier and Type  Method and Description 

static <V,E extends DefaultEdge> 
Graphs.makeImmutable(DirectedGraph<V,E> graph)
Returns a map of the shortest paths between any pair of nodes.

static <V,E extends DefaultEdge> 
TopologicalOrderIterator.of(DirectedGraph<V,E> graph) 
static <V,E extends DefaultEdge> 
BreadthFirstIterator.of(DirectedGraph<V,E> graph,
V root) 
static <V,E extends DefaultEdge> 
DepthFirstIterator.of(DirectedGraph<V,E> graph,
V start)
Creates an iterable over the vertices in the given graph in a depthfirst
iteration order.

static <V,E extends DefaultEdge> 
Graphs.predecessorListOf(DirectedGraph<V,E> graph,
V vertex) 
static <V,E extends DefaultEdge> 
DepthFirstIterator.reachable(java.util.Collection<V> list,
DirectedGraph<V,E> graph,
V start)
Populates a collection with the nodes reachable from a given node.

static <V,E extends DefaultEdge> 
BreadthFirstIterator.reachable(java.util.Set<V> set,
DirectedGraph<V,E> graph,
V root)
Populates a set with the nodes reachable from a given node.

Constructor and Description 

BreadthFirstIterator(DirectedGraph<V,E> graph,
V root) 
CycleDetector(DirectedGraph<V,E> graph) 
DepthFirstIterator(DirectedGraph<V,E> graph,
V start) 
TopologicalOrderIterator(DirectedGraph<V,E> graph) 
Copyright © 2012–2018 The Apache Software Foundation. All rights reserved.