graph

Type Members

1. class AllPathsWalk extends DepthTracker with BoundedIterator[Node]

   Traverses in FIFO (breadth first) order but without any limit on the number of times every node can be visited.

2. class ArrayBasedDirectedGraph extends DirectedGraph

   This class is an implementation of the directed graph trait that is backed by an array The private constructor takes as its input a list of (@see Node) nodes, then stores nodes in an array.

3. trait BoundedIterator[T] extends Iterator[T]

   Bounds an iterator to go no more than a specified maximum number of steps

4. class BreadthFirstTraverser extends DepthTracker with BoundedIterator[Node]

   Traverses in BFS order.

5. class DepthFirstTraverser extends DepthTracker with BoundedIterator[Node]

   Traverses in DFS order (every node can be visited only once).

6. trait DepthTracker extends QueueBasedTraverser

   A traverser that keeps track of first depth of visiting a given node.

7. trait DirectedGraph extends Graph with Iterable[Node]

   The entry point into a model of a directed graph.

8. class DirectedGraphUtils extends GraphUtils

   This class contains some common utilities and convenience functions for directed graphs.

9. case class DirectedPath(nodes: Array[Int]) extends Product with Serializable

   Represents a directed path of nodes in a graph.

10. class DirectedPathCollection extends AnyRef

    Represents a collection of directed paths.

11. trait DiscoveryAndFinishTimeTracker extends DepthFirstTraverser

    Trait to be mixed in to the BFS/DFS traverser to add discovery and finishing times of a node.

12. trait DynamicDirectedGraph extends DirectedGraph

    A class support dynamically adds new nodes and dynamically add/delete edges in existing nodes.

13. abstract class DynamicDirectedGraphHashMap extends DynamicDirectedGraph

    A class supporting dynamic addition of new nodes and addition/deletion of edges in existing nodes.

14. trait Graph extends AnyRef

    The entry point into a model of a directed graph.

15. class GraphUtils extends AnyRef

    This class contains some common graph utilities and convenience functions.

16. trait Node extends AnyRef

    Represents a node in a directed graph.

17. case class NodeIdEdgesMaxId(id: Int, edges: Array[Int], maxId: Int) extends Product with Serializable

    This case class holds a node's id, all its out edges, and the max id of itself and ids of nodes in its out edges

18. class PathCounterComparator extends Comparator[DirectedPath]

19. trait PathLengthTracker extends DepthFirstTraverser

    A trait to be mixed in to the DepthFirstTraverser that keeps track of visiting distance from homeNodeIds.

20. trait QueueBasedTraverser extends Traverser

    General schema for some Traversers (like BFS, DFS).

21. class RandomBoundedTraverser extends RandomTraverser with BoundedIterator[Node]

    Same as RandomTraverser except that the number of steps taken is bounded by maxSteps

22. class RandomTraverser extends Traverser

    Randomly traverse the graph, going from one node to a random neighbor in direction dir.

23. class SharedArrayBasedDirectedGraph extends DirectedGraph

    This class is an implementation of the directed graph trait that is backed by a sharded 2-dimensional edges array.

24. class SynchronizedDynamicGraph extends DynamicDirectedGraphHashMap

    A class support dynamically adds new nodes and dynamically add/delete edges in existing nodes.

25. case class TestGraph(nodes: Node*) extends DirectedGraph with Product with Serializable

    A simple implementation of a DirectedGraph

26. case class TestNode(id: Int, inboundNodes: List[Int], outboundNodes: List[Int]) extends Node with Product with Serializable

27. trait Traverser extends Iterator[Node]

    A Traverser traverses the graph in a certain order of nodes.