FloydWarshall

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 allPairsLeastPaths[Node, EdgeLabel, Label, Key](edges: GenTraversable[(Node, Node, EdgeLabel)] = Seq.empty, extraNodes: GenSeq[Node] = Seq.empty, support: SemiringSupport[Label, Key], labelForEdge: (Node, Node, EdgeLabel) ⇒ Label): IndexedLabelDigraph[Node, Label]

   

   O(n^3)

5. def allPairsLeastPaths[Node, Label, Key](labelDigraph: MatrixLabelDigraph[Node, Label], support: SemiringSupport[Label, Key]): IndexedLabelDigraph[Node, Label]

   

   O(n^3)

6. def allPairsShortestPaths[Node, EdgeLabel](edges: GenTraversable[(Node, Node, EdgeLabel)], nodeOrder: GenSeq[Node] = Seq.empty): IndexedLabelDigraph[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)] = Seq.empty, extraNodes: GenSeq[Node] = Seq.empty, support: SemiringSupport[Label, Key], labelForEdge: (Node, Node, EdgeLabel) ⇒ Label): MatrixLabelDigraph[Node, Label]

   

   Create a digraph of Labels from an arbitrary Digraph.

   Create a digraph of Labels from an arbitrary Digraph.

   O(n ln(n) + an)

   returns

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

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

    

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

    

    Definition Classes

    AnyRef

12. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

13. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

14. def floydWarshall[Node, Label, Key](labelDigraph: MatrixLabelDigraph[Node, Label], support: SemiringSupport[Label, Key]): IndexedLabelDigraph[Node, Label]

    

    O(n^3)

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

    

    Definition Classes

    AnyRef → Any

16. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

17. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    AnyRef

19. final def notify(): Unit

    

    Definition Classes

    AnyRef

20. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

21. def relax[Node, Label, Key](labelDigraph: MutableLabelDigraph[Node, Label], semiring: Semiring)(from: mutable.MutableLabelDigraph.InnerNodeType, through: mutable.MutableLabelDigraph.InnerNodeType, to: mutable.MutableLabelDigraph.InnerNodeType): Label

    

    O(1)

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

    

    Definition Classes

    AnyRef

23. def toString(): String

    

    Definition Classes

    AnyRef → Any

24. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )