urv.omolsr.util
Class GraphUtils<N,W>

java.lang.Object
  urv.omolsr.util.GraphUtils<N,W>

public class GraphUtils<N,W>
extends java.lang.Object

This class is used to compute the minimum spanning tree for a network graph, that represents a multicast group. We find this tree using the Prim's Algorithm.

Author:

Gerard Paris Aixala

Field Summary

(package private) Weight

dummyWeight

Constructor Summary

GraphUtils()

Method Summary

NetworkGraph<N,W>

computeMinimumSpanningTree(NetworkGraph<N,W> graph, N source) Computes a minimum spanning tree for the specified graph and source node

Methods inherited from class java.lang.Object

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

Field Detail

dummyWeight

final Weight dummyWeight

Constructor Detail

GraphUtils

public GraphUtils()

Method Detail

computeMinimumSpanningTree

public NetworkGraph<N,W> computeMinimumSpanningTree(NetworkGraph<N,W> graph,
                                                    N source)

Computes a minimum spanning tree for the specified graph and source node

Parameters:

graph - A network graph

source - The source node to compute the tree from

Returns:

the computed spanning tree