DirectedPathCollection

Value Members

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

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

6. def appendToCurrentPath(node: Int): Unit

   Appends node to the current path and record this path against the node.

   Appends node to the current path and record this path against the node.

   node

   the node being visited

7. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

8. def clear(): Unit

   Resets the path collection

9. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

10. val comparator: PathCounterComparator

    Priority queue and comparator for sorting top paths.

    Priority queue and comparator for sorting top paths. Reused across nodes.

11. def containsNode(node: Int): Boolean

    returns

    true if entry for node exists, false otherwise

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

    Definition Classes

    AnyRef

13. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

14. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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 numUniquePathsTill(node: Int): Int

    returns

    the total number of unique paths that end at node

22. val priQ: ObjectHeapPriorityQueue[DirectedPath]

23. def resetCurrentPath(): Unit

    Reset the current path

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

    Definition Classes

    AnyRef

25. def toString(): String

    Definition Classes

    AnyRef → Any

26. def topPathsPerNodeId(num: Int): Int2ObjectOpenHashMap[Object2IntMap[DirectedPath]]

    num

    the number of top paths to return for a node

    returns

    an array of tuples, each containing a node and array of top paths ending at node, with scores

27. def topPathsTill(node: Int, num: Int): Object2IntMap[DirectedPath]

    returns

    a map of {path -> count} for paths ending at node, sorted in decreasing order of count. Paths with the same count are sorted shortest path first.

    Returns at most num pairs in the map.

28. def totalNumPaths: Int

    returns

    the total number of unique paths in this collection

29. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )