scratch.joshua.jung_2_0.core

Class SimpleUndirectedSparseGraph<V,E>

java.lang.Object

scratch.joshua.jung_2_0.core.SimpleAbstractSparseGraph<V,E>

scratch.joshua.jung_2_0.core.SimpleUndirectedSparseGraph<V,E>

All Implemented Interfaces:

ArchetypeGraph<V,E>, Graph<V,E>, UndirectedGraph<V,E>

public class SimpleUndirectedSparseGraph<V,E>
extends SimpleAbstractSparseGraph<V,E>
implements UndirectedGraph<V,E>

Field Summary

Fields

Modifier and Type	Field and Description
protected java.util.Map<E,Pair<V>>	edges
protected java.util.Map<V,java.util.Set<E>>	vertices

Constructor Summary

Constructors

Constructor and Description
SimpleUndirectedSparseGraph()

Method Summary

Methods

Modifier and Type	Method and Description
boolean	addUndirectedEdge(E edge, V v1, V v2)
boolean	addVertex(V vertex)
E	findEdge(V v1, V v2)
java.util.Collection<E>	getEdges()
Pair<V>	getEndpoints(E edge)
java.util.Collection<E>	getIncidentEdges(V vertex)
java.util.Collection<E>	getInEdges(V vertex)
java.util.Collection<V>	getNeighbors(V vertex)
java.util.Collection<E>	getOutEdges(V vertex)
java.util.Collection<V>	getPredecessors(V vertex)
java.util.Collection<V>	getSuccessors(V vertex)
java.util.Collection<V>	getVertices()
boolean	removeEdge(E edge)
boolean	removeVertex(V vertex)

Methods inherited from class scratch.joshua.jung_2_0.core.SimpleAbstractSparseGraph

areIncident, areNeighbors, degree, getIncidentVertices, getOpposite, inDegree, isPredecessor, isSuccessor, numNeighbors, numPredecessors, numSuccessors, outDegree

Methods inherited from class java.lang.Object

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

Methods inherited from interface scratch.joshua.jung_2_0.core.Graph

getOpposite, inDegree, isPredecessor, isSuccessor, numPredecessors, numSuccessors, outDegree

Methods inherited from interface scratch.joshua.jung_2_0.core.ArchetypeGraph

areIncident, areNeighbors, degree, getIncidentVertices, numNeighbors

Field Detail

vertices

protected java.util.Map<V,java.util.Set<E>> vertices

edges

protected java.util.Map<E,Pair<V>> edges

Constructor Detail

SimpleUndirectedSparseGraph

public SimpleUndirectedSparseGraph()

Method Detail

getEdges

public java.util.Collection<E> getEdges()

Specified by:

getEdges in interface ArchetypeGraph<V,E>

getVertices

public java.util.Collection<V> getVertices()

Specified by:

getVertices in interface ArchetypeGraph<V,E>

addVertex

public boolean addVertex(V vertex)

Specified by:

addVertex in interface ArchetypeGraph<V,E>

removeVertex

public boolean removeVertex(V vertex)

Specified by:

removeVertex in interface ArchetypeGraph<V,E>

addUndirectedEdge

public boolean addUndirectedEdge(E edge,
                        V v1,
                        V v2)

Specified by:

addUndirectedEdge in interface UndirectedGraph<V,E>

removeEdge

public boolean removeEdge(E edge)

Specified by:

removeEdge in interface ArchetypeGraph<V,E>

getInEdges

public java.util.Collection<E> getInEdges(V vertex)

Specified by:

getInEdges in interface Graph<V,E>

getOutEdges

public java.util.Collection<E> getOutEdges(V vertex)

Specified by:

getOutEdges in interface Graph<V,E>

getPredecessors

public java.util.Collection<V> getPredecessors(V vertex)

Specified by:

getPredecessors in interface Graph<V,E>

getSuccessors

public java.util.Collection<V> getSuccessors(V vertex)

Specified by:

getSuccessors in interface Graph<V,E>

getNeighbors

public java.util.Collection<V> getNeighbors(V vertex)

Specified by:

getNeighbors in interface ArchetypeGraph<V,E>

getIncidentEdges

public java.util.Collection<E> getIncidentEdges(V vertex)

Specified by:

getIncidentEdges in interface ArchetypeGraph<V,E>

findEdge

public E findEdge(V v1,
         V v2)

Specified by:

findEdge in interface ArchetypeGraph<V,E>

getEndpoints

public Pair<V> getEndpoints(E edge)

Specified by:

getEndpoints in interface Graph<V,E>