ai.grakn.graql.internal.gremlin.spanningtree

Class ChuLiuEdmonds

java.lang.Object

ai.grakn.graql.internal.gremlin.spanningtree.ChuLiuEdmonds

public class ChuLiuEdmonds
extends Object

Chu-Liu-Edmonds' algorithm for finding a maximum branching in a complete, directed graph in O(n^2) time. Implementation is based on Tarjan's "Finding Optimum Branchings" paper: http://cw.felk.cvut.cz/lib/exe/fetch.php/courses/a4m33pal/cviceni/tarjan-finding-optimum-branchings.pdf

Author:

sthomson@cs.cmu.edu, Jason Liu

Constructor Summary

Constructors

Constructor and Description
ChuLiuEdmonds()

Method Summary

Modifier and Type	Method and Description
static <V> Weighted<Arborescence<V>>	getMaxArborescence(WeightedGraph<V> graph) Find an optimal arborescence of the given graph.
static <V> Weighted<Arborescence<V>>	getMaxArborescence(WeightedGraph<V> graph, V root) Find an optimal arborescence of the given graph `graph`, rooted in the given node `root`.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

ChuLiuEdmonds

public ChuLiuEdmonds()

Method Detail

getMaxArborescence

public static <V> Weighted<Arborescence<V>> getMaxArborescence(WeightedGraph<V> graph,
                                                               V root)

Find an optimal arborescence of the given graph `graph`, rooted in the given node `root`.

getMaxArborescence

public static <V> Weighted<Arborescence<V>> getMaxArborescence(WeightedGraph<V> graph)

Find an optimal arborescence of the given graph.