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

MapGraph

org.encalmo.data.MapGraph
class MapGraph[N](nodeMap: Map[N, Traversable[N]] = ...) extends GenericGraph[N]

Graph implemented as a map of nodes to adjacent nodes.

Attributes

Graph
Supertypes
trait GenericGraph[N]
trait Graph[N]
class Object
trait Matchable
class Any
Known subtypes
class IntMapGraph

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 hasAdjacent(node: N): Boolean

Whether the node has any adjacent nodes.

Whether the node has any adjacent nodes.

Attributes

Definition Classes
override def toString(): String

Returns a string representation of the object.

Returns a string representation of the object.

The default representation is platform dependent.

Attributes

Returns

a string representation of the object.

Definition Classes
Any

Inherited methods

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

The edges in the graph.

The edges in the graph.

Attributes

Definition Classes
Inherited from:
GenericGraph
override def edgesCount: Long

The number of edges in the graph.

The number of edges in the graph.

Attributes

Definition Classes
Inherited from:
GenericGraph
override def nodesCount: Int

The number of nodes in the graph.

The number of nodes in the graph.

Attributes

Definition Classes
Inherited from:
GenericGraph

Concrete fields

override val adjacent: N => Traversable[N]

The adjacent nodes for each node.

The adjacent nodes for each node.

Attributes

override val nodes: Traversable[N]

The nodes in the graph.

The nodes in the graph.

Attributes

lazy override val reverse: Graph[N]

The reverse of the graph.

The reverse of the graph.

Attributes

Generated with