Field Detail

• centrality

  public float centrality

• sigma

  public long sigma

  Number of short paths passing through this vertex.

• neighbors

  public final Set<Vertex<T>> neighbors

• d

  public long d

  Length of the path.

• data

  public T data

  The data associated with this node, if any.

Constructor Detail

• Vertex

  public Vertex(T data)

Method Detail

• reset

  protected void reset()

  All but neighbors.

• getNeighborCount

  public int getNeighborCount()

• clone

  public static <T> ArrayList<Vertex<T>> clone(Collection<Vertex<T>> vs)

  Clone a collection of vertices, preserving the neighbors.

  Returns:

  An ArrayList of Vertex instances in the same order as @param vs delivered them.

• isBranching

  public boolean isBranching()

• isEnding

  public boolean isEnding()

• getBranch

  public List<Vertex<T>> getBranch(Vertex<T> parent)

  From this vertex to the next branch vertex or end vertex, both inclusive. The @param exclude is the neighbor to ignore.

  Throws:

  IllegalArgumentException - if @param exclude is not a neighbor.