cusack.hcg.graph

Class EfficientListGraph

java.lang.Object

cusack.hcg.graph.EfficientListGraph

Direct Known Subclasses:

EfficientPebbleGraph

public class EfficientListGraph
extends java.lang.Object

An efficient implementation of a graph data structure. This class uses many bad OOP principles for the sake of efficiency. For instance, there are no accessors, etc. Instead, direct access is allowed. Sure it only saves a little bit, but every little bit counts. *

Author:

Modified by Chuck Cusack, April 2010

Field Summary

Fields

Modifier and Type	Field and Description
int[][]	adjList
int	numberVertices

Constructor Summary

Constructors

Constructor and Description
EfficientListGraph(EfficientListGraph g)
EfficientListGraph(Graph graph)

Method Summary

Modifier and Type	Method and Description
int	degree(int n)
void	fromString(java.lang.String adjacencyListAsString)
int	getNumberVertices()

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

numberVertices

public int numberVertices

adjList

public int[][] adjList

Constructor Detail

EfficientListGraph

public EfficientListGraph(Graph graph)

EfficientListGraph

public EfficientListGraph(EfficientListGraph g)

Method Detail

fromString

public void fromString(java.lang.String adjacencyListAsString)

degree

public int degree(int n)

getNumberVertices

public int getNumberVertices()