org.biojava.spark.graph

Class WeightedGraph

java.lang.Object

org.biojava.spark.graph.WeightedGraph

public class WeightedGraph
extends Object

Author:

Yana Valasatava

Constructor Summary

Constructors

Constructor and Description
WeightedGraph()

Method Summary

Modifier and Type	Method and Description
static org.jgrapht.Graph<Integer,org.jgrapht.graph.DefaultWeightedEdge>	build(List<scala.Tuple3<Integer,Integer,Double>> data) Builds a simple weighted graph
static org.jgrapht.Graph<Integer,org.jgrapht.graph.DefaultWeightedEdge>	getMinimumSpanningTree(org.jgrapht.Graph<Integer,org.jgrapht.graph.DefaultWeightedEdge> graph) Builds a graph that contains a Minimum Spanning Tree
static List<List<Integer>>	traverse(org.jgrapht.Graph<Integer,org.jgrapht.graph.DefaultWeightedEdge> graph) Builds a path (root and branches) to traverse a graph

Methods inherited from class java.lang.Object

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

Constructor Detail

WeightedGraph

public WeightedGraph()

Method Detail

build

public static org.jgrapht.Graph<Integer,org.jgrapht.graph.DefaultWeightedEdge> build(List<scala.Tuple3<Integer,Integer,Double>> data)

Builds a simple weighted graph

Parameters:

data - The input list of tuples each holds two indices and distance between them

getMinimumSpanningTree

public static org.jgrapht.Graph<Integer,org.jgrapht.graph.DefaultWeightedEdge> getMinimumSpanningTree(org.jgrapht.Graph<Integer,org.jgrapht.graph.DefaultWeightedEdge> graph)

Builds a graph that contains a Minimum Spanning Tree

Parameters:

graph - The input weighted graph

traverse

public static List<List<Integer>> traverse(org.jgrapht.Graph<Integer,org.jgrapht.graph.DefaultWeightedEdge> graph)

Builds a path (root and branches) to traverse a graph

Parameters:

graph - The input graph