cusack.hcg.games.multidesigns.algorithms

Class MultiGraphAdjacencyMatrix

java.lang.Object

cusack.hcg.games.multidesigns.algorithms.MultiGraphAdjacencyMatrix

All Implemented Interfaces:

SimpleGraph

public class MultiGraphAdjacencyMatrix
extends java.lang.Object
implements SimpleGraph

A multigraph implemented as an adjacency matrix. The number in each entry is the number of times the edge occurs. We will assume x and y are adjacent if A[x][y]>0, and not if A[x][y]<=0.

Author:

Modified by Chuck Cusack, April 2012

Constructor Summary

Constructors

Constructor and Description
MultiGraphAdjacencyMatrix(Graph graph)
MultiGraphAdjacencyMatrix(MultiGraphAdjacencyMatrix g)
MultiGraphAdjacencyMatrix(java.lang.String adjList)

Method Summary

Modifier and Type	Method and Description
void	addEdge(int i, int j) Unsafe but efficient edge addition.
boolean	addEdges(java.util.ArrayList<SimpleEdge> edges) Removes all of the edges from the list if they are all not present.
boolean	addEdgesWithinTolerance(java.util.ArrayList<SimpleEdge> edges)
void	fromString(java.lang.String adjacencyListAsString)
int	getDegree(int index) The degree will be defined as the sum of the weights of the edges, including negative weights.
DegreeSequence	getDegreeSequence()
int[]	getNonIsolatedVertices()
int	getNumberOfEdges() We count edge multiplicity and negative-weight edges.
int	getNumberOfVertices()
int	getTolerance()
boolean	isEdge(int i, int j)
void	removeEdge(int i, int j) Unsafe but efficient edge removal.
boolean	removeEdges(java.util.ArrayList<SimpleEdge> edges) Removes all of the edges from the list if they are all present.
boolean	removeEdgesWithTolerance(java.util.ArrayList<SimpleEdge> edges)
void	setTolerance(int tolerance)

Methods inherited from class java.lang.Object

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

Constructor Detail

MultiGraphAdjacencyMatrix

public MultiGraphAdjacencyMatrix(Graph graph)

MultiGraphAdjacencyMatrix

public MultiGraphAdjacencyMatrix(MultiGraphAdjacencyMatrix g)

MultiGraphAdjacencyMatrix

public MultiGraphAdjacencyMatrix(java.lang.String adjList)

Method Detail

fromString

public void fromString(java.lang.String adjacencyListAsString)

getDegreeSequence

public DegreeSequence getDegreeSequence()

Specified by:

getDegreeSequence in interface SimpleGraph

getDegree

public int getDegree(int index)

The degree will be defined as the sum of the weights of the edges, including negative weights. This may be a bad thing, but so be it.

Specified by:

getDegree in interface SimpleGraph

Parameters:

index -

Returns:

getNumberOfEdges

public int getNumberOfEdges()

We count edge multiplicity and negative-weight edges.

Specified by:

getNumberOfEdges in interface SimpleGraph

Returns:

addEdges

public boolean addEdges(java.util.ArrayList<SimpleEdge> edges)

Removes all of the edges from the list if they are all not present. Otherwise does nothing.

Parameters:

edges -

Returns:

removeEdges

public boolean removeEdges(java.util.ArrayList<SimpleEdge> edges)

Removes all of the edges from the list if they are all present. Otherwise does nothing.

Parameters:

edges -

Returns:

addEdge

public void addEdge(int i,
                    int j)

Unsafe but efficient edge addition. (Unsafe because it doesn't check that the edge is not there)

Parameters:

i -

j -

removeEdge

public void removeEdge(int i,
                       int j)

Unsafe but efficient edge removal. (Unsafe because it doesn't check that the edge is there)

Parameters:

i -

j -

isEdge

public boolean isEdge(int i,
                      int j)

getNumberOfVertices

public int getNumberOfVertices()

Specified by:

getNumberOfVertices in interface SimpleGraph

getNonIsolatedVertices

public int[] getNonIsolatedVertices()

getTolerance

public int getTolerance()

setTolerance

public void setTolerance(int tolerance)

addEdgesWithinTolerance

public boolean addEdgesWithinTolerance(java.util.ArrayList<SimpleEdge> edges)

removeEdgesWithTolerance

public boolean removeEdgesWithTolerance(java.util.ArrayList<SimpleEdge> edges)