Class/Object

com.seancheatham.graph.adapters.memory

MutableGraph

Related Docs: object MutableGraph | 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](id: String, label: String, _1: Node, _2: Node, data: Map[String, JsValue]): E

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

    Permalink
    Definition Classes
    Graph
  8. def addNode[N <: Node](label: String, data: Map[String, JsValue]): N

    Permalink
    Definition Classes
    MutableGraph → Graph
  9. def addNode[N <: Node](id: String, label: String, data: Map[String, JsValue]): N

    Permalink

    A convenience for adding a node with a specific ID

  10. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  11. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  12. implicit val edgeFactory: Factory

    Permalink
    Definition Classes
    MutableGraph → Graph
  13. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  14. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  15. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  17. def getEdge[E <: Edge](id: String): Option[E]

    Permalink
    Definition Classes
    MutableGraph → Graph
  18. def getEdges[E <: Edge](label: Option[String], data: Map[String, JsValue]): Iterator[E]

    Permalink
    Definition Classes
    MutableGraph → Graph
  19. def getEgressEdges[E <: Edge](node: Node, edgeLabel: Option[String], edgeData: Map[String, JsValue]): Iterator[E]

    Permalink
    Definition Classes
    MutableGraph → Graph
  20. def getIngressEdges[E <: Edge](node: Node, edgeLabel: Option[String], edgeData: Map[String, JsValue]): Iterator[E]

    Permalink
    Definition Classes
    MutableGraph → Graph
  21. def getNode[N <: Node](id: String): Option[N]

    Permalink
    Definition Classes
    MutableGraph → Graph
  22. def getNodes[N <: Node](label: Option[String], data: Map[String, JsValue]): Iterator[N]

    Permalink
    Definition Classes
    MutableGraph → Graph
  23. implicit def graph: Graph

    Permalink
    Definition Classes
    Graph
  24. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  25. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  26. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  27. implicit val nodeFactory: Factory

    Permalink
    Definition Classes
    MutableGraph → Graph
  28. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  29. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  30. 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
  31. def removeEdge(edge: Edge): MutableGraph

    Permalink
    Definition Classes
    MutableGraph → Graph
  32. def removeNode(node: Node): MutableGraph

    Permalink
    Definition Classes
    MutableGraph → Graph
  33. def removeNodes(label: Option[String], data: Map[String, JsValue]): MutableGraph

    Permalink
    Definition Classes
    MutableGraph → Graph
  34. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  35. def toImmutableGraph: ImmutableGraph

    Permalink
  36. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  37. def updateEdge[E <: Edge](edge: E)(changes: (String, JsValue)*): E

    Permalink
    Definition Classes
    MutableGraph → Graph
  38. def updateNode[N <: Node](node: N)(changes: (String, JsValue)*): N

    Permalink
    Definition Classes
    MutableGraph → Graph
  39. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  40. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  41. final def wait(arg0: Long): Unit

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

Inherited from Graph

Inherited from AnyRef

Inherited from Any

Ungrouped