root
API
Generated with
root/org.encalmo.data/GenericGraph

GenericGraph

org.encalmo.data.GenericGraph
trait GenericGraph[N] extends Graph[N]

Simple graph defined by abstract nodes collection and adjacent nodes function. Requires implementation of only two methods: nodes and adjacent.

Attributes

Graph
Supertypes
trait Graph[N]
class Object
trait Matchable
class Any
Known subtypes
class GenericGraphImpl[N]
class WeightedGraphImpl[N, V]
class MapGraph[N]
class IntMapGraph
class MutableMapGraph[N]
Show all
Self type

Members list

Value members

Concrete methods

override def contains(node: N): Boolean

Whether the graph contains the node.

Whether the graph contains the node.

Attributes

Definition Classes
override def edges: Traversable[(N, N)]

The edges in the graph.

The edges in the graph.

Attributes

Definition Classes
override def edgesCount: Long

The number of edges in the graph.

The number of edges in the graph.

Attributes

Definition Classes
override def hasAdjacent(node: N): Boolean

Whether the node has any adjacent nodes.

Whether the node has any adjacent nodes.

Attributes

Definition Classes
override def nodesCount: Int

The number of nodes in the graph.

The number of nodes in the graph.

Attributes

Definition Classes
override def reverse: Graph[N]

The reverse of the graph.

The reverse of the graph.

Attributes

Definition Classes

Inherited and Abstract methods

def adjacent: N => Traversable[N]

The adjacent nodes for each node.

The adjacent nodes for each node.

Attributes

Inherited from:
Graph
def nodes: Traversable[N]

The nodes in the graph.

The nodes in the graph.

Attributes

Inherited from:
Graph
Generated with