Class

com.seancheatham.graph.adapters.memory

ImmutableGraph

Related Doc: package memory

Permalink

case class ImmutableGraph(nodeConstructs: Map[String, Construct] = Map.empty, edgeConstructs: Map[String, Construct] = Map.empty)(implicit nodeFactory: Factory = Node.defaultFactory, edgeFactory: Factory = Edge.defaultFactory) extends Graph with Product with Serializable

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

Instance Constructors

  1. new ImmutableGraph(nodeConstructs: Map[String, Construct] = Map.empty, edgeConstructs: Map[String, Construct] = Map.empty)(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
    ImmutableGraph → 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
    ImmutableGraph → 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
    ImmutableGraph → Graph

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

    Permalink
    Definition Classes
    AnyRef

  12. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    ImmutableGraph → Graph

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

    Permalink
    Definition Classes
    ImmutableGraph → Graph

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

    Permalink
    Definition Classes
    ImmutableGraph → Graph

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

    Permalink
    Definition Classes
    ImmutableGraph → Graph

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

    Permalink
    Definition Classes
    ImmutableGraph → Graph

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

    Permalink
    Definition Classes
    ImmutableGraph → Graph

  20. implicit def graph: Graph

    Permalink
    Definition Classes
    Graph

  21. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  23. implicit val nodeFactory: Factory

    Permalink
    Definition Classes
    ImmutableGraph → Graph

  24. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  25. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  26. 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
    ImmutableGraph → Graph

  27. def removeEdge(edge: Edge): ImmutableGraph

    Permalink
    Definition Classes
    ImmutableGraph → Graph

  28. def removeNode(node: Node): ImmutableGraph

    Permalink
    Definition Classes
    ImmutableGraph → Graph

  29. def removeNodes(label: Option[String], data: Map[String, JsValue]): ImmutableGraph

    Permalink
    Definition Classes
    ImmutableGraph → Graph

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

    Permalink
    Definition Classes
    AnyRef

  31. def toMutableGraph: MutableGraph

    Permalink

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

    Permalink
    Definition Classes
    ImmutableGraph → Graph

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

    Permalink
    Definition Classes
    ImmutableGraph → Graph

  34. final def wait(): Unit

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

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

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

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

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

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Graph

Inherited from AnyRef

Inherited from Any

Ungrouped