Package 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>
,java.io.Serializable
- Direct Known Subclasses:
SortedSparseMultigraph
public class OrderedSparseMultigraph<V,E> extends SparseMultigraph<V,E> implements MultiGraph<V,E>
An implementation ofGraph
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 Description OrderedSparseMultigraph()
Creates a new instance.
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description boolean
addVertex(V vertex)
Addsvertex
to this graph.static <V,E>
com.google.common.base.Supplier<Graph<V,E>>getFactory()
java.util.Collection<E>
getIncidentEdges(V vertex)
Returns the collection of edges in this graph which are connected tovertex
.java.util.Collection<V>
getNeighbors(V vertex)
Returns the collection of vertices which are connected tovertex
via any edges in this graph.java.util.Collection<V>
getPredecessors(V vertex)
Returns aCollection
view of the predecessors ofvertex
in this graph.java.util.Collection<V>
getSuccessors(V vertex)
Returns aCollection
view of the successors ofvertex
in this graph.-
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
-
-
-
-
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 SupplierE
- the edge type for the graph Supplier- Returns:
- a
Supplier
that creates an instance of this graph type.
-
addVertex
public boolean addVertex(V vertex)
Description copied from interface:Hypergraph
Addsvertex
to this graph. Fails ifvertex
is null or already in the graph.- Specified by:
addVertex
in interfaceHypergraph<V,E>
- Overrides:
addVertex
in classSparseMultigraph<V,E>
- Parameters:
vertex
- the vertex to add- Returns:
true
if the add is successful, andfalse
otherwise
-
getPredecessors
public java.util.Collection<V> getPredecessors(V vertex)
Description copied from interface:Graph
Returns aCollection
view of the predecessors ofvertex
in this graph. A predecessor ofvertex
is defined as a vertexv
which is connected tovertex
by an edgee
, wheree
is an outgoing edge ofv
and an incoming edge ofvertex
.- Specified by:
getPredecessors
in interfaceGraph<V,E>
- Specified by:
getPredecessors
in interfaceHypergraph<V,E>
- Overrides:
getPredecessors
in classSparseMultigraph<V,E>
- Parameters:
vertex
- the vertex whose predecessors are to be returned- Returns:
- a
Collection
view of the predecessors ofvertex
in this graph
-
getSuccessors
public java.util.Collection<V> getSuccessors(V vertex)
Description copied from interface:Graph
Returns aCollection
view of the successors ofvertex
in this graph. A successor ofvertex
is defined as a vertexv
which is connected tovertex
by an edgee
, wheree
is an incoming edge ofv
and an outgoing edge ofvertex
.- Specified by:
getSuccessors
in interfaceGraph<V,E>
- Specified by:
getSuccessors
in interfaceHypergraph<V,E>
- Overrides:
getSuccessors
in classSparseMultigraph<V,E>
- Parameters:
vertex
- the vertex whose predecessors are to be returned- Returns:
- a
Collection
view of the successors ofvertex
in this graph
-
getNeighbors
public java.util.Collection<V> getNeighbors(V vertex)
Description copied from interface:Hypergraph
Returns the collection of vertices which are connected tovertex
via any edges in this graph. Ifvertex
is connected to itself with a self-loop, then it will be included in the collection returned.- Specified by:
getNeighbors
in interfaceHypergraph<V,E>
- Overrides:
getNeighbors
in classSparseMultigraph<V,E>
- Parameters:
vertex
- the vertex whose neighbors are to be returned- Returns:
- the collection of vertices which are connected to
vertex
, ornull
ifvertex
is not present
-
getIncidentEdges
public java.util.Collection<E> getIncidentEdges(V vertex)
Description copied from interface:Hypergraph
Returns the collection of edges in this graph which are connected tovertex
.- Specified by:
getIncidentEdges
in interfaceHypergraph<V,E>
- Overrides:
getIncidentEdges
in classSparseMultigraph<V,E>
- Parameters:
vertex
- the vertex whose incident edges are to be returned- Returns:
- the collection of edges which are connected to
vertex
, ornull
ifvertex
is not present
-
-