| 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
|
| Modifier and Type | Method and Description |
|---|---|
static <V> Weighted<Arborescence<V>> |
ChuLiuEdmonds.getMaxArborescence(WeightedGraph<V> graph)
Find an optimal arborescence of the given graph.
|
static <V> Weighted<Arborescence<V>> |
ChuLiuEdmonds.getMaxArborescence(WeightedGraph<V> graph,
V root)
Find an optimal arborescence of the given graph `graph`, rooted in the given node `root`.
|
| Modifier and Type | Method and Description |
|---|---|
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) |
| Modifier and Type | Method and Description |
|---|---|
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) |
| Modifier and Type | Method and Description |
|---|---|
static <T> Weighted<T> |
Weighted.weighted(T value,
double weight)
Convenience static constructor
|
| Modifier and Type | Method and Description |
|---|---|
int |
Weighted.compareTo(Weighted<T> other)
High weights first, use val.hashCode to break ties
|
Copyright © 2017 Grakn Labs Ltd. All rights reserved.