graph

Type Members

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.
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.
class ArrayBasedDynamicDirectedGraph extends DynamicDirectedGraph

A dynamic directed graph, implemented using an ArrayBuffer of IntArrayList (from the fastutil library).
trait BoundedIterator[T] extends Iterator[T]

Bounds an iterator to go no more than a specified maximum number of steps
class BreadthFirstTraverser extends DepthTracker with BoundedIterator[Node]

Traverses in BFS order.
class DepthFirstTraverser extends DepthTracker with BoundedIterator[Node]

Traverses in DFS order (every node can be visited only once).
trait DepthTracker extends QueueBasedTraverser

A traverser that keeps track of first depth of visiting a given node.
trait DirectedGraph extends Graph with Iterable[Node]

The entry point into a model of a directed graph.
class DirectedGraphUtils extends GraphUtils

This class contains some common utilities and convenience functions for directed graphs.
case class DirectedPath(nodes: Array[Int]) extends Product with Serializable

Represents a directed path of nodes in a graph.
class DirectedPathCollection extends AnyRef

Represents a collection of directed paths.
trait DiscoveryAndFinishTimeTracker extends DepthFirstTraverser

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

A class support dynamically adds new nodes and dynamically add/delete edges in existing nodes.
abstract class DynamicDirectedGraphHashMap extends DynamicDirectedGraph

A class supporting dynamic addition of new nodes and addition/deletion of edges in existing nodes.
trait Graph extends AnyRef

The entry point into a model of a directed graph.
class GraphUtils extends AnyRef

This class contains some common graph utilities and convenience functions.
trait Node extends AnyRef

Represents a node in a directed graph.
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
class PathCounterComparator extends Comparator[DirectedPath]
trait PathLengthTracker extends DepthFirstTraverser

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

General schema for some Traversers (like BFS, DFS).
class RandomBoundedTraverser extends RandomTraverser with BoundedIterator[Node]

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

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

Constructor for a default node with neighbors stored as Seqs.
class SharedArrayBasedDirectedGraph extends DirectedGraph

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

This trait designed to be mixed in to Node when neighbors of node are sorted Arrays.
class SynchronizedDynamicGraph extends DynamicDirectedGraphHashMap

A class support dynamically adds new nodes and dynamically add/delete edges in existing nodes.
case class TestGraph(nodes: Node*) extends DirectedGraph with Product with Serializable

A simple implementation of a DirectedGraph
case class TestNode(id: Int, inboundNodes: List[Int], outboundNodes: List[Int]) extends Node with Product with Serializable
trait Traverser extends Iterator[Node]

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

Value Members

object ArrayBasedDirectedGraph
object DirectedPath extends Serializable
object GraphDir extends Enumeration

A representation of the two directions edges point in a directed graph.
object GraphUtils
object NeighborsSortingStrategy extends Enumeration

ArrayBasedDirectedGraph can be stored with neighbors sorted or not.
object Node
object NodeIdEdgesMaxId extends Serializable
object NodeUtils

This class contains common graph node based utilities and convenience functions.
object SharedArrayBasedDirectedGraph

provides methods for constructing a shared array based graph
object StoredGraphDir extends Enumeration
object TestGraphs

Some sample graphs for quick testing in tests.
object Walk
package bipartite
package node
package tourist

package graph

Type Members

class AllPathsWalk extends DepthTracker with BoundedIterator[Node]

class ArrayBasedDirectedGraph extends DirectedGraph

class ArrayBasedDynamicDirectedGraph extends DynamicDirectedGraph

trait BoundedIterator[T] extends Iterator[T]

class BreadthFirstTraverser extends DepthTracker with BoundedIterator[Node]

class DepthFirstTraverser extends DepthTracker with BoundedIterator[Node]

trait DepthTracker extends QueueBasedTraverser

trait DirectedGraph extends Graph with Iterable[Node]

class DirectedGraphUtils extends GraphUtils

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

class DirectedPathCollection extends AnyRef

trait DiscoveryAndFinishTimeTracker extends DepthFirstTraverser

trait DynamicDirectedGraph extends DirectedGraph

abstract class DynamicDirectedGraphHashMap extends DynamicDirectedGraph

trait Graph extends AnyRef

class GraphUtils extends AnyRef

trait Node extends AnyRef

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

class PathCounterComparator extends Comparator[DirectedPath]

trait PathLengthTracker extends DepthFirstTraverser

trait QueueBasedTraverser extends Traverser

class RandomBoundedTraverser extends RandomTraverser with BoundedIterator[Node]

class RandomTraverser extends Traverser

class SeqBasedNode extends Node

class SharedArrayBasedDirectedGraph extends DirectedGraph

trait SortedNeighborsNodeOps extends AnyRef

class SynchronizedDynamicGraph extends DynamicDirectedGraphHashMap

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

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

trait Traverser extends Iterator[Node]

Value Members

object ArrayBasedDirectedGraph

object DirectedPath extends Serializable

object GraphDir extends Enumeration

object GraphUtils

object NeighborsSortingStrategy extends Enumeration

object Node

object NodeIdEdgesMaxId extends Serializable

object NodeUtils

object SharedArrayBasedDirectedGraph

object StoredGraphDir extends Enumeration

object TestGraphs

object Walk

package bipartite

package node

package tourist

Ungrouped