Uses of Interface
org.apache.calcite.util.graph.DirectedGraph
-
Packages that use DirectedGraph Package Description org.apache.calcite.plan Defines interfaces for constructing rule-based optimizers of relational expressions.org.apache.calcite.plan.hep Provides a heuristic planner implementation for the interfaces inorg.apache.calcite.plan
.org.apache.calcite.rel.rules Provides a core set of planner rules.org.apache.calcite.util.graph Graph-theoretic algorithms and data structures. -
-
Uses of DirectedGraph in org.apache.calcite.plan
Fields in org.apache.calcite.plan declared as DirectedGraph Modifier and Type Field Description (package private) DirectedGraph<Convention,DefaultEdge>
ConventionTraitDef.ConversionData. conversionGraph
-
Uses of DirectedGraph in org.apache.calcite.plan.hep
Fields in org.apache.calcite.plan.hep declared as DirectedGraph Modifier and Type Field Description private DirectedGraph<HepRelVertex,DefaultEdge>
HepPlanner. graph
Query graph, with edges directed from parent to child. -
Uses of DirectedGraph in org.apache.calcite.rel.rules
Methods in org.apache.calcite.rel.rules that return DirectedGraph Modifier and Type Method Description private DirectedGraph<java.lang.Integer,DefaultEdge>
ProjectToWindowRule.WindowedAggRelSplitter. createGraphFromExpression(java.util.List<RexNode> exprs)
Methods in org.apache.calcite.rel.rules with parameters of type DirectedGraph Modifier and Type Method Description private java.util.List<java.lang.Integer>
ProjectToWindowRule.WindowedAggRelSplitter. getRank(DirectedGraph<java.lang.Integer,DefaultEdge> graph)
private boolean
ProjectToWindowRule.WindowedAggRelSplitter. isDependent(DirectedGraph<java.lang.Integer,DefaultEdge> graph, java.util.List<java.lang.Integer> rank, int ordinal1, int ordinal2)
-
Uses of DirectedGraph in org.apache.calcite.util.graph
Classes in org.apache.calcite.util.graph that implement DirectedGraph Modifier and Type Class Description class
AttributedDirectedGraph<V,E extends DefaultEdge>
Directed graph where edges have attributes and allows multiple edges between any two vertices provided that their attributes are different.class
DefaultDirectedGraph<V,E extends DefaultEdge>
Default implementation ofDirectedGraph
.Fields in org.apache.calcite.util.graph declared as DirectedGraph Modifier and Type Field Description private DirectedGraph<V,E>
BreadthFirstIterator. graph
private DirectedGraph<V,E>
CycleDetector. graph
Methods in org.apache.calcite.util.graph with parameters of type DirectedGraph Modifier and Type Method Description private static <V,E extends DefaultEdge>
java.util.List<V>DepthFirstIterator. buildList(DirectedGraph<V,E> graph, V start)
private static <V,E extends DefaultEdge>
voidDepthFirstIterator. buildListRecurse(java.util.Collection<V> list, java.util.Set<V> activeVertices, DirectedGraph<V,E> graph, V start)
static <V,E extends DefaultEdge>
Graphs.FrozenGraph<V,E>Graphs. makeImmutable(DirectedGraph<V,E> graph)
Returns a map of the shortest paths between any pair of nodes.static <V,E extends DefaultEdge>
java.lang.Iterable<V>BreadthFirstIterator. of(DirectedGraph<V,E> graph, V root)
static <V,E extends DefaultEdge>
java.lang.Iterable<V>DepthFirstIterator. of(DirectedGraph<V,E> graph, V start)
Creates an iterable over the vertices in the given graph in a depth-first iteration order.static <V,E extends DefaultEdge>
java.lang.Iterable<V>TopologicalOrderIterator. of(DirectedGraph<V,E> graph)
static <V,E extends DefaultEdge>
java.util.List<V>Graphs. predecessorListOf(DirectedGraph<V,E> graph, V vertex)
static <V,E extends DefaultEdge>
voidBreadthFirstIterator. reachable(java.util.Set<V> set, DirectedGraph<V,E> graph, V root)
Populates a set with the nodes reachable from a given node.static <V,E extends DefaultEdge>
voidDepthFirstIterator. reachable(java.util.Collection<V> list, DirectedGraph<V,E> graph, V start)
Populates a collection with the nodes reachable from a given node.Constructors in org.apache.calcite.util.graph with parameters of type DirectedGraph Constructor 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)
-