edu.uci.ics.jung.graph

Class DirectedOrderedSparseMultigraph<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>

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

All Implemented Interfaces:

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

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

An implementation of DirectedGraph, suitable for sparse graphs, that orders its vertex and edge collections according to insertion time.

See Also:

Serialized Form

Field Summary

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

edges, vertices

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

edge_type

Constructor Summary

Constructors

Constructor and Description
DirectedOrderedSparseMultigraph() Creates a new instance.

Method Summary

Modifier and Type	Method and Description
boolean	addVertex(V vertex)
static <V,E> com.google.common.base.Supplier<DirectedGraph<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.DirectedSparseMultigraph

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

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, getDest, getEndpoints, getInEdges, getOpposite, getOutEdges, getPredecessorCount, getSource, getSuccessorCount, inDegree, isDest, isPredecessor, isSource, isSuccessor, outDegree

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

addEdge, addEdge, containsEdge, containsVertex, degree, findEdge, findEdgeSet, getDefaultEdgeType, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getIncidentCount, getIncidentVertices, getNeighborCount, getVertexCount, getVertices, isIncident, isNeighbor, removeEdge, removeVertex

Constructor Detail

DirectedOrderedSparseMultigraph

public DirectedOrderedSparseMultigraph()

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.

addVertex

public boolean addVertex(V vertex)

Specified by:

addVertex in interface Hypergraph<V,E>

Overrides:

addVertex in class DirectedSparseMultigraph<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 DirectedSparseMultigraph<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 DirectedSparseMultigraph<V,E>

getNeighbors

public Collection<V> getNeighbors(V vertex)

Specified by:

getNeighbors in interface Hypergraph<V,E>

Overrides:

getNeighbors in class DirectedSparseMultigraph<V,E>

getIncidentEdges

public Collection<E> getIncidentEdges(V vertex)

Specified by:

getIncidentEdges in interface Hypergraph<V,E>

Overrides:

getIncidentEdges in class DirectedSparseMultigraph<V,E>