edu.uci.ics.jung.graph

Class DirectedSparseMultigraph<V,E>

java.lang.Object

edu.uci.ics.jung.graph.AbstractGraph<V,E>

edu.uci.ics.jung.graph.AbstractTypedGraph<V,E>

edu.uci.ics.jung.graph.DirectedSparseMultigraph<V,E>

All Implemented Interfaces:

DirectedGraph<V,E>, Graph<V,E>, Hypergraph<V,E>, MultiGraph<V,E>, Serializable

Direct Known Subclasses:

DirectedOrderedSparseMultigraph

public class DirectedSparseMultigraph<V,E>
extends AbstractTypedGraph<V,E>
implements DirectedGraph<V,E>, MultiGraph<V,E>

An implementation of DirectedGraph, suitable for sparse graphs, that permits parallel edges.

See Also:

Serialized Form

Field Summary

Fields

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

Fields inherited from class edu.uci.ics.jung.graph.AbstractTypedGraph

edge_type

Constructor Summary

Constructors

Constructor and Description
DirectedSparseMultigraph() Creates a new instance.

Method Summary

Modifier and Type	Method and Description
boolean	addEdge(E edge, Pair<? extends V> endpoints, EdgeType edgeType) Adds edge to this graph with the specified endpoints and EdgeType.
boolean	addVertex(V vertex)
boolean	containsEdge(E edge)
boolean	containsVertex(V vertex)
E	findEdge(V v1, V v2)
V	getDest(E edge)
int	getEdgeCount()
Collection<E>	getEdges()
Pair<V>	getEndpoints(E edge)
static <V,E> com.google.common.base.Supplier<DirectedGraph<V,E>>	getFactory()
Collection<E>	getIncidentEdges(V vertex)
protected Collection<E>	getIncoming_internal(V vertex)
Collection<E>	getInEdges(V vertex)
Collection<V>	getNeighbors(V vertex)
Collection<E>	getOutEdges(V vertex)
protected Collection<E>	getOutgoing_internal(V vertex)
Collection<V>	getPredecessors(V vertex)
V	getSource(E edge)
Collection<V>	getSuccessors(V vertex)
int	getVertexCount()
Collection<V>	getVertices()
boolean	isDest(V vertex, E edge)
boolean	isSource(V vertex, E edge)
boolean	removeEdge(E edge)
boolean	removeVertex(V vertex)

Methods inherited from class edu.uci.ics.jung.graph.AbstractTypedGraph

getDefaultEdgeType, getEdgeCount, getEdges, getEdgeType, hasEqualEdgeType, validateEdgeType

Methods inherited from class edu.uci.ics.jung.graph.AbstractGraph

addEdge, addEdge, addEdge, addEdge, addEdge, degree, findEdgeSet, getIncidentCount, getIncidentVertices, getNeighborCount, getOpposite, getPredecessorCount, getSuccessorCount, getValidatedEndpoints, inDegree, isIncident, isNeighbor, isPredecessor, isSuccessor, outDegree, toString

Methods inherited from class java.lang.Object

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

Methods inherited from interface edu.uci.ics.jung.graph.Graph

addEdge, addEdge, getOpposite, getPredecessorCount, getSuccessorCount, inDegree, isPredecessor, isSuccessor, outDegree

Methods inherited from interface edu.uci.ics.jung.graph.Hypergraph

addEdge, addEdge, degree, findEdgeSet, getDefaultEdgeType, getEdgeCount, getEdges, getEdgeType, getIncidentCount, getIncidentVertices, getNeighborCount, isIncident, isNeighbor

Field Detail

vertices

protected Map<V,Pair<Set<E>>> vertices

edges

protected Map<E,Pair<V>> edges

Constructor Detail

DirectedSparseMultigraph

public DirectedSparseMultigraph()

Creates a new instance.

Method Detail

getFactory

public static <V,E> com.google.common.base.Supplier<DirectedGraph<V,E>> getFactory()

Type Parameters:

V - the vertex type for the graph Supplier

E - the edge type for the graph Supplier

Returns:

a Supplier that creates an instance of this graph type.

getEdges

public Collection<E> getEdges()

Specified by:

getEdges in interface Hypergraph<V,E>

getVertices

public Collection<V> getVertices()

Specified by:

getVertices in interface Hypergraph<V,E>

containsVertex

public boolean containsVertex(V vertex)

Specified by:

containsVertex in interface Hypergraph<V,E>

containsEdge

public boolean containsEdge(E edge)

Specified by:

containsEdge in interface Hypergraph<V,E>

getIncoming_internal

protected Collection<E> getIncoming_internal(V vertex)

getOutgoing_internal

protected Collection<E> getOutgoing_internal(V vertex)

addVertex

public boolean addVertex(V vertex)

Specified by:

addVertex in interface Hypergraph<V,E>

removeVertex

public boolean removeVertex(V vertex)

Specified by:

removeVertex in interface Hypergraph<V,E>

removeEdge

public boolean removeEdge(E edge)

Specified by:

removeEdge in interface Hypergraph<V,E>

getInEdges

public Collection<E> getInEdges(V vertex)

Specified by:

getInEdges in interface Graph<V,E>

Specified by:

getInEdges in interface Hypergraph<V,E>

getOutEdges

public Collection<E> getOutEdges(V vertex)

Specified by:

getOutEdges in interface Graph<V,E>

Specified by:

getOutEdges in interface Hypergraph<V,E>

getPredecessors

public Collection<V> getPredecessors(V vertex)

Specified by:

getPredecessors in interface Graph<V,E>

Specified by:

getPredecessors in interface Hypergraph<V,E>

getSuccessors

public Collection<V> getSuccessors(V vertex)

Specified by:

getSuccessors in interface Graph<V,E>

Specified by:

getSuccessors in interface Hypergraph<V,E>

getNeighbors

public Collection<V> getNeighbors(V vertex)

Specified by:

getNeighbors in interface Hypergraph<V,E>

getIncidentEdges

public Collection<E> getIncidentEdges(V vertex)

Specified by:

getIncidentEdges in interface Hypergraph<V,E>

findEdge

public E findEdge(V v1,
                  V v2)

Specified by:

findEdge in interface Hypergraph<V,E>

Overrides:

findEdge in class AbstractGraph<V,E>

addEdge

public boolean addEdge(E edge,
                       Pair<? extends V> endpoints,
                       EdgeType edgeType)

Description copied from class: AbstractGraph

Adds edge to this graph with the specified endpoints and EdgeType.

Specified by:

addEdge in class AbstractGraph<V,E>

Parameters:

edge - the edge to be added

endpoints - the endpoints to be connected to this edge

edgeType - the type of edge to add

Returns:

true iff the graph was modified as a result of this call

getSource

public V getSource(E edge)

Specified by:

getSource in interface Graph<V,E>

Specified by:

getSource in interface Hypergraph<V,E>

getDest

public V getDest(E edge)

Specified by:

getDest in interface Graph<V,E>

Specified by:

getDest in interface Hypergraph<V,E>

isSource

public boolean isSource(V vertex,
                        E edge)

Specified by:

isSource in interface Graph<V,E>

isDest

public boolean isDest(V vertex,
                      E edge)

Specified by:

isDest in interface Graph<V,E>

getEndpoints

public Pair<V> getEndpoints(E edge)

Specified by:

getEndpoints in interface Graph<V,E>

getEdgeCount

public int getEdgeCount()

Specified by:

getEdgeCount in interface Hypergraph<V,E>

getVertexCount

public int getVertexCount()

Specified by:

getVertexCount in interface Hypergraph<V,E>