lib.easyjava.graph

Interface WeightedGraph<T>

Type Parameters:

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

All Superinterfaces:

Graph<T>, java.io.Serializable

All Known Implementing Classes:

WeightedDirectedGraph, WeightedUndirectedGraph

public interface WeightedGraph<T>
extends Graph<T>

A weighted 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. See WeightedDirectedGraph and WeightedUndirectedGraph for concrete implementations.

Author:

Rob Rua (robrua@alumni.cmu.edu)

Method Summary

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

Methods inherited from interface lib.easyjava.graph.Graph

addVertex, getEdges, getVertices, removeAllEdges, removeAllVertices

Method Detail

addEdge

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

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

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