nick.graph
Interface GraphInterface<E>

All Known Implementing Classes:

AdjacencyListGraph, AdjacencyMatrixGraph

public interface GraphInterface<E>

This interface is used to provide a framework for different graph implementations. The two standard implementations use adjacency lists and a adjacency matrix. By using the contract specified by this interface algorithms (such as depth first search and breadth first search) may call the same methods in the same way.

Subclasses of this class should implement vertices in such a way that no two vertices have the same name.

Version:

March 15, 2009

Author:

Nick Aschenbach

Method Summary

void	addEdge(java.lang.String vertex1, java.lang.String vertex2, E edge_value)
void	addEdge(java.lang.String vertex1, java.lang.String vertex2, E edge_value, java.lang.String edge_name)
void	addVertex(java.lang.String vertex_name)
void	addVertex(java.lang.String vertex_name, E vertex_value)
java.util.Set<E>	edges()
java.lang.String	getAVertex()
java.util.Set<E>	getEdges(java.lang.String vertex)
java.util.Set<java.lang.String>	getNeighbors(java.lang.String vertex)
java.util.Set<java.lang.String>	vertices()

Method Detail

addVertex

void addVertex(java.lang.String vertex_name)

addVertex

void addVertex(java.lang.String vertex_name,
               E vertex_value)

addEdge

void addEdge(java.lang.String vertex1,
             java.lang.String vertex2,
             E edge_value)

addEdge

void addEdge(java.lang.String vertex1,
             java.lang.String vertex2,
             E edge_value,
             java.lang.String edge_name)

vertices

java.util.Set<java.lang.String> vertices()

edges

java.util.Set<E> edges()

getNeighbors

java.util.Set<java.lang.String> getNeighbors(java.lang.String vertex)

getEdges

java.util.Set<E> getEdges(java.lang.String vertex)

getAVertex

java.lang.String getAVertex()