package graph
Ordering
- Alphabetic
Visibility
- Public
- All
Type Members
-
case class
Direct[Edge, Node](edge: Edge, node: Node) extends Neigh[Edge, Node] with Product with Serializable
A neighbor of a node through a direct edge
- case class DirectEdge[Edge](edge: Edge) extends DirectedEdge[Edge] with Product with Serializable
-
trait
DirectedEdge[Edge] extends AnyRef
Represents directed edges
-
trait
Graph[Edge, Node] extends AnyRef
Generic representation of graphs
-
case class
GraphMap[Edge, Node](m: Map[Node, Seq[(Edge, Node)]]) extends Graph[Edge, Node] with Product with Serializable
Implementation of graph as a map
-
case class
Inverse[Edge, Node](edge: Edge, node: Node) extends Neigh[Edge, Node] with Product with Serializable
A neighbor of a node through an inverse edge
- case class InverseEdge[Edge](edge: Edge) extends DirectedEdge[Edge] with Product with Serializable
-
sealed
trait
Neigh[Edge, Node] extends AnyRef
Represents a neighbor of a node in a graph.
Represents a neighbor of a node in a graph. It can be a direct arc or an inverse arc