Packages

object SSShortestPath

The SSShortestPath companion object provides factory methods for the SSShortestPath class.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SSShortestPath
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. def apply(g: MGraph[Double], s: Int, hasV_Weight: Boolean = false, hasE_Weight: Boolean = true): SSShortestPath

    Create an SSShortestPath object from a multi-digraph.

    Create an SSShortestPath object from a multi-digraph. First convert the graph's adjacency set representation to an adjacency matrix with edge weights (which optionally include initial vertex weight).

    g

    the multi-digraph to use

    s

    the source vertex for the multi-digraph

    hasV_Weight

    whether vertices carry weights or not (0.0)

    hasE_Weight

    whether edges carry specific weights or just unit weights (1.0)