public class MultiGraph extends AdjacencyListGraph
AdjacencyListGraph.EdgeIterator<T extends Edge>, AdjacencyListGraph.NodeIterator<T extends Node>
AbstractGraph.GraphReplayController
AbstractElement.AttributeChangeEvent
Replayable.Controller
DEFAULT_EDGE_CAPACITY, DEFAULT_NODE_CAPACITY, edgeArray, edgeCount, edgeMap, GROW_FACTOR, nodeArray, nodeCount, nodeMap
listeners
attributes, attributesBeingRemoved, id
Constructor and Description |
---|
MultiGraph(String id)
Creates an empty graph with strict checking and without auto-creation.
|
MultiGraph(String id,
boolean strictChecking,
boolean autoCreate)
Creates an empty graph with default edge and node capacity.
|
MultiGraph(String id,
boolean strictChecking,
boolean autoCreate,
int initialNodeCapacity,
int initialEdgeCapacity)
Creates an empty graph.
|
addEdgeCallback, addNodeCallback, clearCallback, getEdge, getEdge, getEdgeCount, getEdgeIterator, getNode, getNode, getNodeCount, getNodeIterator, removeEdgeCallback, removeNodeCallback
addAttributeSink, addEdge, addEdge, addEdge, addEdge, addEdge, addEdge, addEdge, addElementSink, addNode, addSink, attributeChanged, attributeSinks, clear, clearAttributeSinks, clearElementSinks, clearSinks, display, display, edgeAdded, edgeAttributeAdded, edgeAttributeChanged, edgeAttributeRemoved, edgeFactory, edgeRemoved, elementSinks, getEachEdge, getEachNode, getEdgeSet, getNodeSet, getReplayController, getStep, graphAttributeAdded, graphAttributeChanged, graphAttributeRemoved, graphCleared, isAutoCreationEnabled, isStrict, iterator, nodeAdded, nodeAttributeAdded, nodeAttributeChanged, nodeAttributeRemoved, nodeFactory, nodeRemoved, nullAttributesAreErrors, read, read, removeAttributeSink, removeEdge, removeEdge, removeEdge, removeEdge, removeEdge, removeEdge, removeEdge, removeElementSink, removeNode, removeNode, removeNode, removeNode, removeSink, setAutoCreate, setEdgeFactory, setNodeFactory, setNullAttributesAreErrors, setStrict, stepBegins, stepBegins, write, write
addAttribute, addAttributes, changeAttribute, clearAttributes, clearAttributesWithNoEvent, getArray, getAttribute, getAttribute, getAttributeCount, getAttributeKeyIterator, getAttributeKeySet, getEachAttributeKey, getFirstAttributeOf, getFirstAttributeOf, getHash, getId, getIndex, getLabel, getNumber, getVector, hasArray, hasAttribute, hasAttribute, hasHash, hasLabel, hasNumber, hasVector, removeAttribute, setAttribute, setIndex, toString
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
addAttribute, addAttributes, changeAttribute, clearAttributes, getArray, getAttribute, getAttribute, getAttributeCount, getAttributeKeyIterator, getAttributeKeySet, getEachAttributeKey, getFirstAttributeOf, getFirstAttributeOf, getHash, getId, getIndex, getLabel, getNumber, getVector, hasArray, hasAttribute, hasAttribute, hasHash, hasLabel, hasNumber, hasVector, removeAttribute, setAttribute
forEach, spliterator
public MultiGraph(String id, boolean strictChecking, boolean autoCreate, int initialNodeCapacity, int initialEdgeCapacity)
id
- Unique identifier of the graph.strictChecking
- If true any non-fatal error throws an exception.autoCreate
- If true (and strict checking is false), nodes are
automatically created when referenced when creating a edge,
even if not yet inserted in the graph.initialNodeCapacity
- Initial capacity of the node storage data structures. Use this
if you know the approximate maximum number of nodes of the
graph. The graph can grow beyond this limit, but storage
reallocation is expensive operation.initialEdgeCapacity
- Initial capacity of the edge storage data structures. Use this
if you know the approximate maximum number of edges of the
graph. The graph can grow beyond this limit, but storage
reallocation is expensive operation.public MultiGraph(String id, boolean strictChecking, boolean autoCreate)
id
- Unique identifier of the graph.strictChecking
- If true any non-fatal error throws an exception.autoCreate
- If true (and strict checking is false), nodes are
automatically created when referenced when creating a edge,
even if not yet inserted in the graph.public MultiGraph(String id)
id
- Unique identifier of the graph.WebARTS Library Licensed Under the GNU - General Public License. Other Libraries licensed under their respective Open Source Licenses