Packages

class Graph[N] extends AnyRef

Represents an immutable directed graph where nodes are elements of N: (source node) -> (id of source node, set of neighbors)

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(nodeIdNeighbors: Map[N, (Int, Set[N])])(implicit arg0: ClassTag[N])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from Graph[N] to any2stringadd[Graph[N]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (Graph[N], B)
    Implicit
    This member is added by an implicit conversion from Graph[N] to ArrowAssoc[Graph[N]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def addEdges(edges: Map[N, Set[N]]): Graph[N]

    Returns a graph with edges added.

    Returns a graph with edges added. All not existing nodes are also added.

  7. def addEdges(nodeSrc: N, nodesDest: Set[N]): Graph[N]

    Returns a graph with a set of edges added from the same node.

    Returns a graph with a set of edges added from the same node. All not existing nodes are also added.

  8. def addNode(node: N): Graph[N]

    Returns a graph with node added.

  9. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  10. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate() @throws( ... )
  11. def ensuring(cond: (Graph[N]) ⇒ Boolean, msg: ⇒ Any): Graph[N]
    Implicit
    This member is added by an implicit conversion from Graph[N] to Ensuring[Graph[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  12. def ensuring(cond: (Graph[N]) ⇒ Boolean): Graph[N]
    Implicit
    This member is added by an implicit conversion from Graph[N] to Ensuring[Graph[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  13. def ensuring(cond: Boolean, msg: ⇒ Any): Graph[N]
    Implicit
    This member is added by an implicit conversion from Graph[N] to Ensuring[Graph[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  14. def ensuring(cond: Boolean): Graph[N]
    Implicit
    This member is added by an implicit conversion from Graph[N] to Ensuring[Graph[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  15. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  17. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from Graph[N] to StringFormat[Graph[N]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  18. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  19. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  20. def info: GraphInfo

    Calculates and returns information about the graph.

  21. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  22. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  23. def neighbors(node: N): Set[N]

    Returns the set of all neighbors of existing node.

  24. def neighborsId(node: N): Set[Int]

    Returns a set of all neighbors id of existing node.

  25. def nodeById(id: Int): Option[N]

    Returns the node corresponding to id.

  26. def nodeId(node: N): Int

    Returns the id of existing node.

  27. val nodeIdNeighbors: Map[N, (Int, Set[N])]
  28. def nodesArray: Array[N]

    Returns an array of all nodes.

    Returns an array of all nodes. The index of each corresponding to their ids.

  29. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  30. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  31. def size: Int

    Returns the number of nodes.

  32. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  33. def toString(): String
    Definition Classes
    AnyRef → Any
  34. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  35. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  36. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  37. def →[B](y: B): (Graph[N], B)
    Implicit
    This member is added by an implicit conversion from Graph[N] to ArrowAssoc[Graph[N]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from Graph[N] to any2stringadd[Graph[N]]

Inherited by implicit conversion StringFormat from Graph[N] to StringFormat[Graph[N]]

Inherited by implicit conversion Ensuring from Graph[N] to Ensuring[Graph[N]]

Inherited by implicit conversion ArrowAssoc from Graph[N] to ArrowAssoc[Graph[N]]

Ungrouped