Packages

  • package root
    Definition Classes
    root
  • class Graph[N, A, C] extends AnyRef

    Represents a graph where nodes are elements of N, and edges are annotated with elements of type-class GraphAnnotation

    Represents a graph where nodes are elements of N, and edges are annotated with elements of type-class GraphAnnotation

    Definition Classes
    root

class Graph[N, A, C] extends AnyRef

Represents a graph where nodes are elements of N, and edges are annotated with elements of type-class GraphAnnotation

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Graph
  2. AnyRef
  3. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Graph(ids: Map[N, Int], next: Int, nodes: Set[N], edges: Map[N, Set[(A, N)]])(implicit g: GraphNode[N, C], a: GraphAnnotation[A, C])

Value Members

  1. implicit val a: GraphAnnotation[A, C]
  2. def addEdge(node1: N, annot: A, node2: N): Graph[N, A, C]

    Add an edge frome node1 to node2, with annotation annot

  3. def addEdges(l: Traversable[(N, A, N)]): Graph[N, A, C]

    Add multiple edges

  4. def addNode(node: N): Graph[N, A, C]

    Add a node to the graph

  5. val edges: Map[N, Set[(A, N)]]
  6. implicit val g: GraphNode[N, C]
  7. def getNode(id: Int): Option[N]

    Get the node with the given id, mostly used for debugging purposes

  8. val ids: Map[N, Int]
  9. val next: Int
  10. def nodeId(node: N): Int

    Get the id of the given node, mostly used for debugging purposes

  11. val nodes: Set[N]
  12. def removeNode(node: N): Graph[N, A, C]

    Remove a node from the graph

  13. def size: Int

    Number of nodes in the graph

  14. def transitions: Int

    Number of edges in the graph