edu.uci.ics.jung.graph

Class OrderedSparseMultigraph<V,E>

java.lang.Object

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

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

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

All Implemented Interfaces:

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

Direct Known Subclasses:

SortedSparseMultigraph

public class OrderedSparseMultigraph<V,E>
extends SparseMultigraph<V,E>
implements MultiGraph<V,E>

An implementation of Graph that orders its vertex and edge collections according to insertion time, is suitable for sparse graphs, and permits directed, undirected, and parallel edges.

See Also:

Serialized Form

Field Summary

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

directedEdges, edges, vertices

Constructor Summary

Constructors

Constructor and Description
OrderedSparseMultigraph() Creates a new instance.

Method Summary

Modifier and Type	Method and Description
boolean	addVertex(V vertex)
static <V,E> com.google.common.base.Supplier<Graph<V,E>>	getFactory()
Collection<E>	getIncidentEdges(V vertex)
Collection<V>	getNeighbors(V vertex)
Collection<V>	getPredecessors(V vertex)
Collection<V>	getSuccessors(V vertex)

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

addEdge, containsEdge, containsVertex, findEdge, getDefaultEdgeType, getDest, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getEndpoints, getIncoming_internal, getInEdges, getOutEdges, getOutgoing_internal, getSource, getVertexCount, getVertices, isDest, isSource, removeEdge, removeVertex

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

Constructor Detail

OrderedSparseMultigraph

public OrderedSparseMultigraph()

Creates a new instance.

Method Detail

getFactory

public static <V,E> com.google.common.base.Supplier<Graph<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.

addVertex

public boolean addVertex(V vertex)

Specified by:

addVertex in interface Hypergraph<V,E>

Overrides:

addVertex in class SparseMultigraph<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>

Overrides:

getPredecessors in class SparseMultigraph<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>

Overrides:

getSuccessors in class SparseMultigraph<V,E>

getNeighbors

public Collection<V> getNeighbors(V vertex)

Specified by:

getNeighbors in interface Hypergraph<V,E>

Overrides:

getNeighbors in class SparseMultigraph<V,E>

getIncidentEdges

public Collection<E> getIncidentEdges(V vertex)

Specified by:

getIncidentEdges in interface Hypergraph<V,E>

Overrides:

getIncidentEdges in class SparseMultigraph<V,E>