lib.easyjava.graph.directed

Class WeightedDirectedGraph<T>

java.lang.Object

lib.easyjava.graph.directed.DirectedGraph<T>

lib.easyjava.graph.directed.WeightedDirectedGraph<T>

Type Parameters:

T - the type of the data to store in Vertices of this graph

All Implemented Interfaces:

java.io.Serializable, Graph<T>, WeightedGraph<T>

public class WeightedDirectedGraph<T>
extends DirectedGraph<T>
implements WeightedGraph<T>

A weighted directed graph which contains Vertices which store data and Edges. All operations called on a graph or its components automatically manage the state of the entire graph, allowing many ways to interact with the graph.

Author:

Rob Rua (robrua@alumni.cmu.edu)

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
WeightedDirectedGraph() Creates a new weighted directed graph
WeightedDirectedGraph(java.util.Collection<T> vertexData) Creates a new weighted directed graph with the given data in vertices
WeightedDirectedGraph(MultiMap<T,Pair<T,java.lang.Double>> connections) Creates a new weighted undirected graph with the connections described by a multimap.

Method Summary

Modifier and Type	Method and Description
WeightedDirectedEdge<T>	addEdge(Vertex<T> source, Vertex<T> target, double weight) Adds an Edge to the graph between two Vertices with the given weight
WeightedDirectedVertex<T>	addVertex(T data) Adds a new vertex to the graph with the given data

Methods inherited from class lib.easyjava.graph.directed.DirectedGraph

getEdges, getVertices, removeAllEdges, removeAllVertices, toString

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface lib.easyjava.graph.Graph

getEdges, getVertices, removeAllEdges, removeAllVertices

Constructor Detail

WeightedDirectedGraph

public WeightedDirectedGraph()

Creates a new weighted directed graph

WeightedDirectedGraph

public WeightedDirectedGraph(java.util.Collection<T> vertexData)

Creates a new weighted directed graph with the given data in vertices

Parameters:

vertexData - the data to make vertices out of

WeightedDirectedGraph

public WeightedDirectedGraph(MultiMap<T,Pair<T,java.lang.Double>> connections)

Creates a new weighted undirected graph with the connections described by a multimap. An edge will be made from each key to each of its values with its assigned weight

Parameters:

connections - a map with pairs which describe the connections and weights that should exist in the graph

Method Detail

addEdge

public WeightedDirectedEdge<T> addEdge(Vertex<T> source,
                                       Vertex<T> target,
                                       double weight)

Description copied from interface: WeightedGraph

Adds an Edge to the graph between two Vertices with the given weight

Specified by:

addEdge in interface WeightedGraph<T>

Parameters:

source - the Vertex the edge starts at (arbitrary for undirected graphs)

target - the Vertex the edge ends at (arbitrary for undirected graphs)

weight - the weight of this edge

Returns:

the created edge

addVertex

public WeightedDirectedVertex<T> addVertex(T data)

Description copied from interface: Graph

Adds a new vertex to the graph with the given data

Specified by:

addVertex in interface Graph<T>

Parameters:

data - the data to add to the graph

Returns:

the Vertex that was created