IntMapGraph

org.encalmo.data.IntMapGraph
final class IntMapGraph(nodeMap: Map[Int, Traversable[Int]] = ...) extends MapGraph[Int]

Graph implemented as a map of nodes to adjacent nodes, where the nodes are integers.

Attributes

Graph
Supertypes
class MapGraph[Int]
trait GenericGraph[Int]
trait Graph[Int]
class Object
trait Matchable
class Any
Show all

Members list

Value members

Concrete methods

inline override def contains(node: Int): Boolean

Whether the graph contains the node.

Whether the graph contains the node.

Attributes

Definition Classes
inline override def hasAdjacent(node: Int): 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
MapGraph -> Any

Inherited methods

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

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: Int => Traversable[Int]

The adjacent nodes for each node.

The adjacent nodes for each node.

Attributes

override val nodes: Traversable[Int]

The nodes in the graph.

The nodes in the graph.

Attributes

lazy override val reverse: Graph[Int]

The reverse of the graph.

The reverse of the graph.

Attributes