Dijkstra

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. def allNodesSingleSource[Node, Label, Key](labelDigraph: IndexedLabelDigraph[Node, Label], support: SemiringSupport[Label, Key]): Seq[(Node, Node, Label)]

   

   O(n^2 ln(n) + na)

5. def allPairsLeastPaths[Node, EdgeLabel, Label, Key](edges: GenTraversable[(Node, Node, EdgeLabel)], support: SemiringSupport[Label, Key], labelForEdge: (Node, Node, EdgeLabel) ⇒ Label, nodeOrder: GenSeq[Node] = Seq.empty): Seq[(Node, Node, Label)]

   

   O(n^2 ln(n) + na)

6. def allPairsShortestPaths[Node, EdgeLabel](edges: GenTraversable[(Node, Node, EdgeLabel)], nodeOrder: GenSeq[Node] = Seq.empty): Seq[(Node, Node, Option[FirstStepsTrait[Node, Int]])]

   

7. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

8. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

9. def createLabelDigraph[Node, EdgeLabel, Label, Key](edges: GenTraversable[(Node, Node, EdgeLabel)], support: SemiringSupport[Label, Key], labelForEdge: (Node, Node, EdgeLabel) ⇒ Label, nodeOrder: GenSeq[Node] = Seq.empty): IndexedLabelDigraph[Node, Label]

   

   Create a digraph of Labels from an edge list.

   Create a digraph of Labels from an edge list.

   O(n ln(n) + a ln(n))

   returns

   an IndexedDigraph with all nodes, a self-edge for each node with the semiring's identifier, and an edge for label edge specified by labelForEdge.

10. def defaultSupport[Node]: AllPathsFirstSteps[Node, Int, Int]

    

11. def dijkstraSingleSink[Node, Label, Key](initialDigraph: IndexedLabelDigraph[Node, Label], support: SemiringSupport[Label, Key])(sink: InnerNodeType): IndexedSeq[(Node, Node, Label)]

    

    Dijkstra's algorithm for a single sink.

    Dijkstra's algorithm for a single sink.

    O(n ln(n) + a)

12. def dijkstraSingleSource[Node, Label, Key](initialGraph: IndexedLabelDigraph[Node, Label], support: SemiringSupport[Label, Key])(source: InnerNodeType): Seq[(Node, Node, Label)]

    

    Dijkstra's algorithm.

    Dijkstra's algorithm.

    O(n ln(n) + e)

13. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

14. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

15. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

16. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

17. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

18. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

19. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

20. final def notify(): Unit

    

    Definition Classes

    AnyRef

21. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

22. def parAllPairsLeastPaths[Node, EdgeLabel, Label, Key](edges: GenTraversable[(Node, Node, EdgeLabel)], support: SemiringSupport[Label, Key], labelForEdge: (Node, Node, EdgeLabel) ⇒ Label, nodeOrder: GenSeq[Node] = ParSeq.empty): ParSeq[(Node, Node, Label)]

    

    O(n^2 ln(n) + na) / cores

23. def parAllPairsShortestPaths[Node, EdgeLabel](edges: GenTraversable[(Node, Node, EdgeLabel)], nodeOrder: GenSeq[Node] = Seq.empty): ParSeq[(Node, Node, Option[FirstStepsTrait[Node, Int]])]

    

24. def relaxSink[Node, Label, Key](digraph: IndexedLabelDigraph[Node, Label], labels: ArrayBuffer[Label], semiring: Semiring)(from: (InnerNodeType, InnerNodeType, Label), through: InnerNodeType, to: InnerNodeType): Label

    

    O(1)

25. def relaxSource[Node, Label, Key](digraph: IndexedLabelDigraph[Node, Label], labels: ArrayBuffer[Label], semiring: Semiring)(from: InnerNodeType, through: InnerNodeType, to: (InnerNodeType, InnerNodeType, Label)): Label

    

    O(1)

26. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

27. def toString(): String

    

    Definition Classes

    AnyRef → Any

28. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

29. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

30. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )