edu.stanford.math.plex4.graph

Interface AbstractWeightedUndirectedGraph

All Superinterfaces:

AbstractUndirectedGraph, java.lang.Iterable<edu.stanford.math.primitivelib.autogen.pair.IntIntPair>, java.io.Serializable

All Known Implementing Classes:

UndirectedWeightedListGraph

public interface AbstractWeightedUndirectedGraph
extends AbstractUndirectedGraph

This interface defines functionality for a weighted graph. The graph may be directed or undirected.

Author:

Andrew Tausz

Method Summary

Methods

Modifier and Type	Method and Description
void	addEdge(int i, int j, double weight) This function adds an edge with specified weight.
double	getWeight(int i, int j) This function returns the weight of the edge (i, j).

Methods inherited from interface edu.stanford.math.plex4.graph.AbstractUndirectedGraph

addEdge, containsEdge, getDegree, getDegreeSequence, getLowerNeighbors, getNeighbors, getNumEdges, getNumVertices, iterator, removeEdge

Method Detail

getWeight

double getWeight(int i,
               int j)

This function returns the weight of the edge (i, j).

Parameters:

i - the index of the first vertex of the edge

j - the index of the second vertex of the edge

Returns:

the weight of the edge (i, j)

addEdge

void addEdge(int i,
           int j,
           double weight)

This function adds an edge with specified weight.

Parameters:

i - the index of the first vertex of the edge

j - the index of the second vertex of the edge

weight - the weight of the edge