net.junaraki.annobase.util.graph

Interface Graph<V,E>

Type Parameters:

V - type of vertices

E - type of edges

All Known Implementing Classes:

AbstractGraph, DependencyGraph

public interface Graph<V,E>

This interface provides a general graph.

Author:

Jun Araki

Method Summary

Modifier and Type	Method and Description
void	addEdge(E edge, V vertex1, V vertex2) Adds the given edge that connects vertex 1 to vertex 2.
void	addVertex(V vertex) Adds the given vertex to this graph.
java.util.Set<V>	getAdjacentVertices(V vertex) Returns vertices adjacent to the given vertex.
java.util.Set<E>	getEdges() Returns all edges in this graph.
java.util.Set<E>	getEdges(V vertex) Returns edges for the given vertex.
java.util.Set<V>	getVertices() Returns all vertices in this graph.
int	numEdges() Returns the number of edges.
int	numVertices() Returns the number of vertices.

Method Detail

getVertices

java.util.Set<V> getVertices()

Returns all vertices in this graph.

Returns:

getAdjacentVertices

java.util.Set<V> getAdjacentVertices(V vertex)

Returns vertices adjacent to the given vertex.

Parameters:

vertex -

Returns:

addVertex

void addVertex(V vertex)

Adds the given vertex to this graph.

Parameters:

vertex -

numVertices

int numVertices()

Returns the number of vertices.

Returns:

getEdges

java.util.Set<E> getEdges()

Returns all edges in this graph.

Returns:

getEdges

java.util.Set<E> getEdges(V vertex)

Returns edges for the given vertex.

Parameters:

vertex -

Returns:

addEdge

void addEdge(E edge,
             V vertex1,
             V vertex2)

Adds the given edge that connects vertex 1 to vertex 2. The two vertices are also added if they are not in this graph.

Parameters:

edge -

vertex1 -

vertex2 -

numEdges

int numEdges()

Returns the number of edges.

Returns: