edu.stanford.math.plex4.graph

Interface AbstractUndirectedGraph

All Superinterfaces:

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

All Known Subinterfaces:

AbstractWeightedUndirectedGraph

All Known Implementing Classes:

UndirectedListGraph, UndirectedWeightedListGraph

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

This interface abstracts the functionality of an unweighted graph. The graph must be undirected. The vertices of the graph are labeled {0, ..., n - 1}, where n is the number of vertices.

Author:

Andrew Tausz

Method Summary

Methods

Modifier and Type	Method and Description
void	addEdge(int i, int j) This function adds the edge (i, j) to the graph.
boolean	containsEdge(int i, int j) This function returns true if the edge (i, j) is in the graph, and false otherwise.
int	getDegree(int v)
int[]	getDegreeSequence()
gnu.trove.TIntHashSet	getLowerNeighbors(int i) This function returns the set of neighbors of vertex i in the graph which have indices less than i.
int[]	getNeighbors(int v)
int	getNumEdges() Gets the number of edges in the graph.
int	getNumVertices() Gets the number of vertices in the graph.
java.util.Iterator<edu.stanford.math.primitivelib.autogen.pair.IntIntPair>	iterator() This function returns an edge iterator that allows the user to iterate over the set of edges in the graph.
void	removeEdge(int i, int j) This function removes the edge (i, j) from the graph.

Method Detail

getNumVertices

int getNumVertices()

Gets the number of vertices in the graph.

Returns:

the number of vertices in the graph

getNumEdges

int getNumEdges()

Gets the number of edges in the graph.

Returns:

the number of edges in the graph

containsEdge

boolean containsEdge(int i,
                   int j)

This function returns true if the edge (i, j) is in the graph, and false otherwise.

Parameters:

i - the first vertex of the edge

j - the second vertex of the edge

Returns:

true if (i, j) is an edge in the graph and false otherwise

addEdge

void addEdge(int i,
           int j)

This function adds the edge (i, j) to the graph.

Parameters:

i - the first vertex of the edge to add

j - the second vertex of the edge to add

removeEdge

void removeEdge(int i,
              int j)

This function removes the edge (i, j) from the graph.

Parameters:

i - the first vertex of the edge to add

j - the second vertex of the edge to add

getLowerNeighbors

gnu.trove.TIntHashSet getLowerNeighbors(int i)

This function returns the set of neighbors of vertex i in the graph which have indices less than i.

Parameters:

i - the vertex to query

Returns:

the set of j such that j < i and i ~ j

iterator

java.util.Iterator<edu.stanford.math.primitivelib.autogen.pair.IntIntPair> iterator()

This function returns an edge iterator that allows the user to iterate over the set of edges in the graph.

Specified by:

iterator in interface java.lang.Iterable<edu.stanford.math.primitivelib.autogen.pair.IntIntPair>

Returns:

an Iterator

getDegree

int getDegree(int v)

getNeighbors

int[] getNeighbors(int v)

getDegreeSequence

int[] getDegreeSequence()