Type Members

1.  case class DiEdge[T <: Node[_]](left: T, right: T) extends Edge[T] with ProtoEdge[T] with Product with Serializable

   Represents a directed edge.

   Represents a directed edge.

   T

   The type of the vertices.

   left

   Left vertex of the edge.

   right

   Right vertex of the edge.

2.  case class DiGraph[T](vertices: Set[Node[T]], edges: Set[DiEdge[Node[T]]]) extends UnweightedGraph[T, DiEdge[Node[T]]] with Product with Serializable

   Represents an unweighted directed graph.

   Represents an unweighted directed graph.

   T

   The type of nodes in the graph.

   vertices

   The set of vertices of the graph.

   edges

   The set of edges of the graph.

3.  abstract class Graph[T, E <: Edge[Node[T]]] extends AnyRef

   This abstract class represent the base of all graphs (excluding hyper graphs).

   This abstract class represent the base of all graphs (excluding hyper graphs).

   For any graph, each vertex in every edge must be in the the set of vertices, otherwise an exception will be thrown.

   T

   The type of nodes in the graph.

   E

   The type of edges of the graph, must be a subtype of properties.Edge.

4.  case class Node[T](label: T) extends Product with Serializable

   Case class to represent a vertex or node in graphs.

   Case class to represent a vertex or node in graphs. Contains a label of type T.

   T

   The type of the label.

   label

   The label to identify the vertex or node with.

5.  case class NodeWeightPair[T](node: Node[T], weight: Double) extends Product with Serializable

   A data structure to represent pairs of nodes and weights (of the path leading to this node).

   A data structure to represent pairs of nodes and weights (of the path leading to this node).

   T

   Type of the node.

   node

   The node of type T.

   weight

   The weight.

6.  case class UnDiEdge[T <: Node[_]](left: T, right: T) extends Edge[T] with ProtoEdge[T] with Product with Serializable

   Represents an undirected edge.

   Represents an undirected edge.

   T

   The type of the vertices.

   left

   Left vertex of the edge.

   right

   Right vertex of the edge.

7.  case class UnDiGraph[T](vertices: Set[Node[T]], edges: Set[UnDiEdge[Node[T]]]) extends UnweightedGraph[T, UnDiEdge[Node[T]]] with Product with Serializable

   Represents an unweighted undirected graph.

   Represents an unweighted undirected graph.

   T

   The type of nodes in the graph.

   vertices

   The set of vertices of the graph.

   edges

   The set of edges of the graph.

8.  abstract class UnweightedGraph[T, E <: Edge[Node[T]]] extends Graph[T, E]

   Abstract class representing unweighted graphs.

   Abstract class representing unweighted graphs.

   T

   The type of nodes in the graph.

   E

   The type of edges of the graph, must be a subtype of properties.Edge.

9.  case class WDiEdge[T <: Node[_]](left: T, right: T, weight: Double) extends Edge[T] with WeightedEdge with ProtoEdge[T] with Product with Serializable

   Represents a weighted directed edge.

   Represents a weighted directed edge.

   T

   The type of the vertices.

   left

   Left vertex of the edge.

   right

   Right vertex of the edge.

   weight

   The weight of the edge.

10.  case class WDiGraph[T](vertices: Set[Node[T]], edges: Set[WDiEdge[Node[T]]]) extends WeightedGraph[T, WDiEdge[Node[T]]] with Product with Serializable

    Represents a weighted directed graph.

    Represents a weighted directed graph.

    T

    The type of nodes in the graph.

    vertices

    The set of vertices of the graph.

    edges

    The set of weighted edges of the graph.

11.  case class WUnDiEdge[T <: Node[_]](left: T, right: T, weight: Double) extends Edge[T] with WeightedEdge with ProtoEdge[T] with Product with Serializable

    Represents a weighted undirected edge.

    Represents a weighted undirected edge.

    T

    The type of the vertices.

    left

    Left vertex of the edge.

    right

    Right vertex of the edge.

    weight

    The weight of the edge.

12.  case class WUnDiGraph[T](vertices: Set[Node[T]], edges: Set[WUnDiEdge[Node[T]]]) extends WeightedGraph[T, WUnDiEdge[Node[T]]] with Product with Serializable
13.  abstract class WeightedGraph[T, E <: Edge[Node[T]] with WeightedEdge] extends Graph[T, E]

    Abstract class representing weighted graphs.

    Abstract class representing weighted graphs.

    T

    The type of nodes in the graph.

    E

    The type of edges of the graph, must be a subtype of properties.WeightedEdge.