public class IntegerTriplesArcLabelledImmutableGraph extends ArcLabelledImmutableSequentialGraph
ArcLabelledImmutableGraph. The triples are interpreted as labelled arcs: the first element is the source, the second element is the target, and the third element must be a nonnegative integer that will be saved using a
This class is mainly a useful example of how to expose of your data via an
it is also used to build test cases, but it is not efficient or particularly refined.
|Constructor and Description|
Creates a new arc-labelled immutable graph using a specified list of triples.
|Modifier and Type||Method and Description|
Returns a node iterator for scanning the graph sequentially, starting from the first node.
Returns the number of nodes of this graph.
Returns a prototype of the labels used by this graph.
copy, labelBigArray, outdegree, randomAccess, successorBigArray, successors
equals, load, load, loadOffline, loadOffline, loadOnce, loadSequential, loadSequential, toString
basename, hashCode, intNumNodes, load, loadMapped, loadMapped, numArcs, outdegrees, store, store, wrap, wrap
public IntegerTriplesArcLabelledImmutableGraph(int triple)
Note that it is impossible to specify isolated nodes with indices larger than
the largest node with positive indegree or outdegree, as the number of nodes is computed
by maximising over all indices in
triple- a list of triples specifying labelled arcs (see the class documentation); order is not relevant, but multiple arcs are not allowed.
public Label prototype()
public long numNodes()
Albeit this method is not optional, it is allowed that this method throws
UnsupportedOperationException if this graph has never been entirely
traversed using a
node iterator. This apparently bizarre
behaviour is necessary to support implementations as
do not know the actual number of nodes until a traversal has been completed.
public ArcLabelledNodeIterator nodeIterator(long from)
public ArcLabelledNodeIterator nodeIterator()