Class

com.seancheatham.graph.adapters.memory

MutableGraph

Related Doc: package memory

Permalink

class MutableGraph extends Graph

Linear Supertypes
Graph, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MutableGraph
  2. Graph
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new MutableGraph()(implicit nodeFactory: Factory = Node.defaultFactory, edgeFactory: Factory = Edge.defaultFactory)

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. def ++(other: Graph): Graph

    Permalink
    Definition Classes
    Graph

  4. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  5. def addEdge[E <: Edge](label: String, _1: Node, _2: Node, data: Map[String, JsValue]): E

    Permalink
    Definition Classes
    MutableGraph → Graph

  6. def addEdge[E <: Edge](e: ((Node, String), Node), data: Map[String, JsValue]): E

    Permalink
    Definition Classes
    Graph

  7. def addNode[N <: Node](label: String, data: Map[String, JsValue]): N

    Permalink
    Definition Classes
    MutableGraph → Graph

  8. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  9. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  10. implicit val edgeFactory: Factory

    Permalink
    Definition Classes
    MutableGraph → Graph

  11. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  12. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  13. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  14. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  15. def getEdge[E <: Edge](id: String): Option[E]

    Permalink
    Definition Classes
    MutableGraph → Graph

  16. def getEdges[E <: Edge](label: Option[String], data: Map[String, JsValue]): Iterator[E]

    Permalink
    Definition Classes
    MutableGraph → Graph

  17. def getEgressEdges[E <: Edge](node: Node, edgeLabel: Option[String], edgeData: Map[String, JsValue]): Iterator[E]

    Permalink
    Definition Classes
    MutableGraph → Graph

  18. def getIngressEdges[E <: Edge](node: Node, edgeLabel: Option[String], edgeData: Map[String, JsValue]): Iterator[E]

    Permalink
    Definition Classes
    MutableGraph → Graph

  19. def getNode[N <: Node](id: String): Option[N]

    Permalink
    Definition Classes
    MutableGraph → Graph

  20. def getNodes[N <: Node](label: Option[String], data: Map[String, JsValue]): Iterator[N]

    Permalink
    Definition Classes
    MutableGraph → Graph

  21. implicit def graph: Graph

    Permalink
    Definition Classes
    Graph

  22. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  23. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  24. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  25. implicit val nodeFactory: Factory

    Permalink
    Definition Classes
    MutableGraph → Graph

  26. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  27. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  28. def pathsTo(start: Node, end: Node, nodeLabels: Seq[String], edgeLabels: Seq[String]): Vector[Path]

    Permalink

    Performs Breadth-First Search, returning a collection with the single item being a path from start to end.

    Performs Breadth-First Search, returning a collection with the single item being a path from start to end.

    Definition Classes
    MutableGraph → Graph

  29. def removeEdge(edge: Edge): MutableGraph

    Permalink
    Definition Classes
    MutableGraph → Graph

  30. def removeNode(node: Node): MutableGraph

    Permalink
    Definition Classes
    MutableGraph → Graph

  31. def removeNodes(label: Option[String], data: Map[String, JsValue]): MutableGraph

    Permalink
    Definition Classes
    MutableGraph → Graph

  32. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  33. def toImmutableGraph: ImmutableGraph

    Permalink

  34. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  35. def updateEdge[E <: Edge](edge: E)(changes: (String, JsValue)*): E

    Permalink
    Definition Classes
    MutableGraph → Graph

  36. def updateNode[N <: Node](node: N)(changes: (String, JsValue)*): N

    Permalink
    Definition Classes
    MutableGraph → Graph

  37. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  38. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  39. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Graph

Inherited from AnyRef

Inherited from Any

Ungrouped