Packages

final case class Graph[N, A, B](repr: Map[N, Context[N, A, B]]) extends Product with Serializable

Linear Supertypes
Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Graph
  2. Serializable
  3. Product
  4. Equals
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new Graph(repr: Map[N, Context[N, A, B]])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def &(c: Context[N, A, B]): Graph[N, A, B]
  4. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  5. def addEdge(e: Edge[N, B]): Graph[N, A, B]
  6. def addEdges(e1: Edge[N, B], e2: Edge[N, B], es: Edge[N, B]*): Graph[N, A, B]
  7. def addEdges(es: Iterable[Edge[N, B]]): Graph[N, A, B]
  8. def addNode(v: Node[N, A]): Graph[N, A, B]
  9. def addNodes(v1: Node[N, A], v2: Node[N, A], vs: Node[N, A]*): Graph[N, A, B]
  10. def addNodes(vs: Iterable[Node[N, A]]): Graph[N, A, B]
  11. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  12. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  13. def contains(v: N): Boolean
  14. def context(v: N): Context[N, A, B]
  15. def contexts: Set[Context[N, A, B]]
  16. def decompose: GraphDecomposition[N, A, B]
    Annotations
    @silent()
  17. def decompose(v: N): Decomposition[N, A, B]
  18. def degree(v: N): Int
  19. def edge(e: (N, N)): Option[Edge[N, B]]
  20. def edges: Set[Edge[N, B]]
  21. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  22. def extend[C](f: (GraphDecomposition[N, A, B]) => C): Graph[N, C, B]
    Annotations
    @silent()
  23. def filterEdges(p: (Edge[N, B]) => Boolean): Graph[N, A, B]
  24. def filterNodes(p: (Node[N, A]) => Boolean): Graph[N, A, B]
  25. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  26. def fold[C](z: C)(op: (Context[N, A, B], C) => C): C
    Annotations
    @silent()
  27. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  28. def inDegree(v: N): Int
  29. def inEdges(v: N): Set[Edge[N, B]]
  30. def isEmpty: Boolean
  31. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  32. def map[C, D](f: (Context[N, A, B]) => Context[N, C, D]): Graph[N, C, D]
  33. def mapEdges[C](f: (B) => C): Graph[N, A, C]
  34. def mapNodes[C](f: (A) => C): Graph[N, C, B]
  35. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  36. def neighbors(v: N): Set[N]
  37. def node(v: N): Option[Node[N, A]]
  38. def nodes: Set[Node[N, A]]
  39. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  40. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  41. def order: Int
  42. def outDegree(v: N): Int
  43. def outEdges(v: N): Set[Edge[N, B]]
  44. def predecessors(v: N): Set[N]
  45. def productElementNames: Iterator[String]
    Definition Classes
    Product
  46. def removeEdge(e: (N, N)): Graph[N, A, B]
  47. def removeEdges(e1: (N, N), e2: (N, N), es: (N, N)*): Graph[N, A, B]
  48. def removeEdges(es: Iterable[(N, N)]): Graph[N, A, B]
  49. def removeNode(v: N): Graph[N, A, B]
  50. def removeNodes(v1: N, v2: N, vs: N*): Graph[N, A, B]
  51. def removeNodes(vs: Iterable[N]): Graph[N, A, B]
  52. val repr: Map[N, Context[N, A, B]]
  53. def reverse: Graph[N, A, B]
  54. def size: Int
  55. def successors(v: N): Set[N]
  56. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  57. def toString(): String
    Definition Classes
    Graph → AnyRef → Any
  58. def undirected: Graph[N, A, B]
  59. def union(that: Graph[N, A, B]): Graph[N, A, B]
  60. def unlabel: Graph[N, Unit, Unit]
  61. def updateEdge(e: Edge[N, B]): Graph[N, A, B]
  62. def updateEdges(es: Iterable[Edge[N, B]]): Graph[N, A, B]
  63. def updateNode(v: Node[N, A]): Graph[N, A, B]
  64. def updateNodes(vs: Iterable[Node[N, A]]): Graph[N, A, B]
  65. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  66. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  67. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped