Class SlowSparseNumberedGraph<T>

All Implemented Interfaces:
EdgeManager<T>, Graph<T>, NodeManager<T>, NumberedEdgeManager<T>, NumberedGraph<T>, NumberedNodeManager<T>, Serializable, Iterable<T>

public class SlowSparseNumberedGraph<T> extends AbstractNumberedGraph<T> implements Serializable
A graph of numbered nodes, expected to have a fairly sparse edge structure.
See Also:
  • Constructor Details

    • SlowSparseNumberedGraph

      protected SlowSparseNumberedGraph()
    • SlowSparseNumberedGraph

      public SlowSparseNumberedGraph(int normalOutCount)
      If normalOutCount == n, this edge manager will eagerly allocated n words to hold out edges for each node. (performance optimization for time)
      Parameters:
      normalOutCount - what is the "normal" number of out edges for a node?
  • Method Details