Uses of Class
ai.grakn.graql.internal.gremlin.spanningtree.graph.DirectedEdge

Packages that use DirectedEdge

Package	Description
ai.grakn.graql.internal.gremlin.fragment
ai.grakn.graql.internal.gremlin.spanningtree
ai.grakn.graql.internal.gremlin.spanningtree.graph

Uses of DirectedEdge in ai.grakn.graql.internal.gremlin.fragment

Methods in ai.grakn.graql.internal.gremlin.fragment that return types with arguments of type DirectedEdge

Modifier and Type	Method and Description
Set<Weighted<DirectedEdge<Node>>>	Fragment.getDirectedEdges(Map<NodeId,Node> nodes, Map<Node,Map<Node,Fragment>> edgeToFragment) Convert the fragment to a set of weighted edges for query planning

Uses of DirectedEdge in ai.grakn.graql.internal.gremlin.spanningtree

Fields in ai.grakn.graql.internal.gremlin.spanningtree declared as DirectedEdge

Modifier and Type	Field and Description
DirectedEdge<V>	ExclusiveEdge.edge

Fields in ai.grakn.graql.internal.gremlin.spanningtree with type parameters of type DirectedEdge

Modifier and Type	Field and Description
List<DirectedEdge<V>>	ExclusiveEdge.excluded

Methods in ai.grakn.graql.internal.gremlin.spanningtree with parameters of type DirectedEdge

Modifier and Type	Method and Description
boolean	Arborescence.contains(DirectedEdge<V> e)
static <T> ExclusiveEdge<T>	ExclusiveEdge.of(DirectedEdge<T> edge, double weight)
static <T> ExclusiveEdge<T>	ExclusiveEdge.of(DirectedEdge<T> edge, List<DirectedEdge<T>> excluded, double weight)

Method parameters in ai.grakn.graql.internal.gremlin.spanningtree with type arguments of type DirectedEdge

Modifier and Type	Method and Description
static <T> ExclusiveEdge<T>	ExclusiveEdge.of(DirectedEdge<T> edge, List<DirectedEdge<T>> excluded, double weight)

Uses of DirectedEdge in ai.grakn.graql.internal.gremlin.spanningtree.graph

Methods in ai.grakn.graql.internal.gremlin.spanningtree.graph that return DirectedEdge

Modifier and Type	Method and Description
DirectedEdge<V>	DirectedEdge.EdgeBuilder.to(V destination)

Methods in ai.grakn.graql.internal.gremlin.spanningtree.graph that return types with arguments of type DirectedEdge

Modifier and Type	Method and Description
static <T> com.google.common.base.Predicate<DirectedEdge<T>>	DirectedEdge.competesWith(Set<DirectedEdge<T>> required)
abstract Collection<Weighted<DirectedEdge<V>>>	WeightedGraph.getIncomingEdges(V destinationNode)
Collection<Weighted<DirectedEdge<V>>>	SparseWeightedGraph.getIncomingEdges(V destinationNode)
Collection<Weighted<DirectedEdge<V>>>	DenseWeightedGraph.getIncomingEdges(V destinationNode)
static <T> com.google.common.base.Predicate<DirectedEdge<T>>	DirectedEdge.hasDestination(T node)
static <T> com.google.common.base.Predicate<DirectedEdge<T>>	DirectedEdge.isAutoCycle()
static <T> com.google.common.base.Predicate<DirectedEdge<T>>	DirectedEdge.isIn(Set<DirectedEdge<T>> banned)

Method parameters in ai.grakn.graql.internal.gremlin.spanningtree.graph with type arguments of type DirectedEdge

Modifier and Type	Method and Description
static <T> com.google.common.base.Predicate<DirectedEdge<T>>	DirectedEdge.competesWith(Set<DirectedEdge<T>> required)
WeightedGraph<V>	WeightedGraph.filterEdges(com.google.common.base.Predicate<DirectedEdge<V>> predicate)
static <T> SparseWeightedGraph<T>	SparseWeightedGraph.from(Iterable<T> nodes, Iterable<Weighted<DirectedEdge<T>>> edges)
static <T> SparseWeightedGraph<T>	SparseWeightedGraph.from(Iterable<Weighted<DirectedEdge<T>>> edges)
static <T> com.google.common.base.Predicate<DirectedEdge<T>>	DirectedEdge.isIn(Set<DirectedEdge<T>> banned)