org.graphstream.graph.implementations
Class SingleGraph
java.lang.Object
org.graphstream.graph.implementations.AbstractElement
org.graphstream.graph.implementations.AbstractGraph
org.graphstream.graph.implementations.AdjacencyListGraph
org.graphstream.graph.implementations.SingleGraph
- All Implemented Interfaces:
- Iterable<Node>, Element, Graph, Structure, AttributeSink, ElementSink, Pipe, Replayable, Sink, Source
- Direct Known Subclasses:
- DefaultGraph
public class SingleGraph
- extends AdjacencyListGraph
An implementation of graph that supports only one edge between two nodes.
Constructor Summary |
SingleGraph(String id)
Creates an empty graph with strict checking and without auto-creation. |
SingleGraph(String id,
boolean strictChecking,
boolean autoCreate)
Creates an empty graph with default edge and node capacity. |
SingleGraph(String id,
boolean strictChecking,
boolean autoCreate,
int initialNodeCapacity,
int initialEdgeCapacity)
Creates an empty graph. |
Methods inherited from class org.graphstream.graph.implementations.AbstractGraph |
addAttributeSink, addEdge, addEdge, addEdge, addEdge, addEdge, addEdge, addElementSink, addNode, addSink, 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, removeElementSink, removeNode, removeNode, removeNode, removeSink, setAutoCreate, setEdgeFactory, setNodeFactory, setNullAttributesAreErrors, setStrict, stepBegins, stepBegins, write, write |
Methods inherited from class org.graphstream.graph.implementations.AbstractElement |
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, toString |
Methods inherited from interface org.graphstream.graph.Element |
addAttribute, addAttributes, changeAttribute, clearAttributes, getArray, getAttribute, getAttribute, getAttributeCount, getAttributeKeyIterator, getAttributeKeySet, getFirstAttributeOf, getFirstAttributeOf, getHash, getId, getIndex, getLabel, getNumber, getVector, hasArray, hasAttribute, hasAttribute, hasHash, hasLabel, hasNumber, hasVector, removeAttribute, setAttribute |
SingleGraph
public SingleGraph(String id,
boolean strictChecking,
boolean autoCreate,
int initialNodeCapacity,
int initialEdgeCapacity)
- Creates an empty graph.
- Parameters:
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.
SingleGraph
public SingleGraph(String id,
boolean strictChecking,
boolean autoCreate)
- Creates an empty graph with default edge and node capacity.
- Parameters:
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.
SingleGraph
public SingleGraph(String id)
- Creates an empty graph with strict checking and without auto-creation.
- Parameters:
id
- Unique identifier of the graph.
Copyright © 2013. All Rights Reserved.