Graph

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. def &(ctx: Context[N, A, B]): Graph[N, A, B]

   

   Alias for embed

4. def +(other: String): String

   

   Implicit information

   This member is added by an implicit conversion from Graph[N, A, B] to any2stringadd[Graph[N, A, B]] performed by method any2stringadd in scala.Predef.

   Definition Classes

   any2stringadd

5. def ->[B](y: B): (Graph[N, A, B], B)

   

   Implicit information

   This member is added by an implicit conversion from Graph[N, A, B] to ArrowAssoc[Graph[N, A, B]] performed by method ArrowAssoc in scala.Predef.

   Definition Classes

   ArrowAssoc

   Annotations

   @inline()

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

   

   Definition Classes

   AnyRef → Any

7. def addEdge(e: LEdge[N, B]): Graph[N, A, B]

   

   Add an edge to this graph.

   Add an edge to this graph. Throws an error if the source and target nodes don't exist in the graph.

8. def addEdges(es: Seq[LEdge[N, B]]): Graph[N, A, B]

   

   Add multiple edges to this graph

9. def addNode(n: LNode[N, A]): Graph[N, A, B]

   

   Add a node to this graph.

   Add a node to this graph. If this node already exists with a different label, its label will be replaced with this new one.

10. def addNodes(vs: Seq[LNode[N, A]]): Graph[N, A, B]

    

    Add multiple nodes to this graph

11. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

12. def bf(q: Queue[Path[N]]): RTree[N]

    

    Utility function for breadth-first search trees.

13. def bfe(v: N): Seq[Edge[N]]

    

    Breadth-first search remembering predecessor information.

    Breadth-first search remembering predecessor information. Gives transient edges in breadth-first order, starting from the given node.

14. def bfen(es: Seq[Edge[N]]): Seq[Edge[N]]

    

    Breadth-first search remembering predecessor information.

    Breadth-first search remembering predecessor information. Gives transient edges starting from the targets of the given edges, in breadth-first order.

15. def bfenInternal(q: Queue[Edge[N]]): Vector[Edge[N]]

    

    Breadth-first edges using the given queue of starting edges.

    Breadth-first edges using the given queue of starting edges. This operation can be useful in writing your own custom breadth-first edge queries.

16. def bfs(v: N): Seq[N]

    

    Breadth-first search from the given node.

    Breadth-first search from the given node. The result is ordered by distance from the node v.

17. def bfsWith[C](f: (Context[N, A, B]) ⇒ C, v: N): Seq[C]

    

    Breadth-first search from the given node.

    Breadth-first search from the given node. The result is a vector of results of passing the context of each visited to the function f.

18. def bfsn(vs: Seq[N]): Seq[N]

    

    Breadth-first search from the given nodes.

    Breadth-first search from the given nodes. The result is the successors of vs, with immediate successors first.

19. def bfsnInternal[C](f: (Context[N, A, B]) ⇒ C, q: Queue[N]): Vector[C]

    

    Breadth-first search (nodes ordered by distance)

20. def bfsnWith[C](f: (Context[N, A, B]) ⇒ C, vs: Seq[N]): Seq[C]

    

    Breadth-first search from the given nodes.

    Breadth-first search from the given nodes. The result is a vector of results of passing the context of each visited node to the function f.

21. def bft(v: N): RTree[N]

    

    Breadth-first search tree.

    Breadth-first search tree. The result is a list of paths through the graph from the given vertex, in breadth-first order.

22. def bidecomp(first: N, last: N): Option[BiDecomp[N, A, B]]

    

    Returns a context focused on two nodes designated "first" and "last", if present, and the graph with those nodes removed.

23. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

24. def contains(v: N): Boolean

    

    Returns true if the given node is in the graph, otherwise false

25. def context(v: N): Context[N, A, B]

    

    Find the context for the given node.

    Find the context for the given node. Causes an error if the node is not present in the graph.

26. def contexts: Vector[Context[N, A, B]]

    

    Get all the contexts in the graph, as a vector

27. def countNodes: Int

    

    The number of nodes in this graph

28. def decomp(n: N): Decomp[N, A, B]

    

    Returns a context focused on the given node, if present, and the graph with that node removed.

29. def decompAny: Decomp[N, A, B]

    

    Decompose this graph into the context for an arbitrarily chosen node and the rest of the graph.

30. def degree(v: N): Int

    

    The number of connections to and from the given node

31. def dff(vs: Seq[N]): Vector[Tree[N]]

    

    Depth-first forest.

    Depth-first forest. Follows successors of the given nodes. The result is a vector of trees of nodes where each path in each tree is a path through the graph.

32. def dffWith[C](vs: Seq[N], f: (Context[N, A, B]) ⇒ C): Vector[Tree[C]]

    

    Depth-first forest.

    Depth-first forest. Follows successors of the given nodes. The result is a vector of trees of results of passing the context of each node to the function f.

33. def dfs(vs: Seq[N]): Seq[N]

    

    Forward depth-first search.

34. def dfsWith[C](vs: Seq[N], f: (Context[N, A, B]) ⇒ C): Seq[C]

    

    Forward depth-first search.

35. def edges: Vector[Edge[N]]

    

    A list of all the edges in the graph

36. def emap[C](f: (B) ⇒ C): Graph[N, A, C]

    

    Map a function over the edge labels in the graph

37. def embed(ctx: Context[N, A, B]): Graph[N, A, B]

    

    Embed the given context in the graph.

    Embed the given context in the graph. If the context's vertex is already in the graph, removes the old context from the graph first. This operation is the deterministic inverse of decomp and obeys the following laws:

    (g & c) decomp c.vertex == Decomp(Some(c), g) (g decomp c.vertex).rest & c == (g & c)

38. def endBy(f: (Graph[N, A, B], N) ⇒ Seq[N]): Seq[N]

    

    Find all nodes that match the given ending criteria.

39. def endNode(f: (Graph[N, A, B], N) ⇒ Seq[N], n: N): Boolean

    

    Find starting and ending nodes.

    Find starting and ending nodes. An ending node n in graph g has f(g,n) containing no nodes other than n.

40. def ensuring(cond: (Graph[N, A, B]) ⇒ Boolean, msg: ⇒ Any): Graph[N, A, B]

    

    Implicit information

    This member is added by an implicit conversion from Graph[N, A, B] to Ensuring[Graph[N, A, B]] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

41. def ensuring(cond: (Graph[N, A, B]) ⇒ Boolean): Graph[N, A, B]

    

    Implicit information

    This member is added by an implicit conversion from Graph[N, A, B] to Ensuring[Graph[N, A, B]] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

42. def ensuring(cond: Boolean, msg: ⇒ Any): Graph[N, A, B]

    

    Implicit information

    This member is added by an implicit conversion from Graph[N, A, B] to Ensuring[Graph[N, A, B]] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

43. def ensuring(cond: Boolean): Graph[N, A, B]

    

    Implicit information

    This member is added by an implicit conversion from Graph[N, A, B] to Ensuring[Graph[N, A, B]] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

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

    

    Definition Classes

    AnyRef

45. def esp(s: N, t: N): Option[Path[N]]

    

    The shortest path from vertex s to vertex t

46. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

47. def findEdge(e: Edge[N]): Option[LEdge[N, B]]

    

    Find an edge between two nodes

48. def fold[C](u: C)(f: (Context[N, A, B], C) ⇒ C): C

    

    Fold a function over the graph

49. def formatted(fmtstr: String): String

    

    Implicit information

    This member is added by an implicit conversion from Graph[N, A, B] to StringFormat[Graph[N, A, B]] performed by method StringFormat in scala.Predef.

    Definition Classes

    StringFormat

    Annotations

    @inline()

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

    

    Definition Classes

    AnyRef → Any

51. def gmap[C, D](f: (Context[N, A, B]) ⇒ Context[N, C, D]): Graph[N, C, D]

    

    Map a function over the graph

52. def inDegree(v: N): Int

    

    The number of inbound edges from the given node

53. def inEdges(v: N): Vector[LEdge[N, B]]

    

    Find all inbound edges for the given node

54. def ins(v: N): Adj[N, B]

    

    All the inbound links of the given node, including self-edges

55. def isEmpty: Boolean

    

    Check if the graph is empty

56. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

57. def labEdges: Vector[LEdge[N, B]]

    

    A list of all the edges in the graph and their labels

58. def labNodes: Vector[LNode[N, A]]

    

    A list of all the nodes in the graph and their labels

59. def label(v: N): Option[A]

    

    Find the label for a node

60. def lbf(q: Queue[LPath[N, B]]): LRTree[N, B]

    

    Utility function for labeled breadth-first search tree

61. def lbft(v: N): LRTree[N, B]

    

    Breadth-first search tree with labeled paths

62. def leaves: Set[N]

    

    Find the leaves of the graph.

    Find the leaves of the graph. A leaf is a node which as no outgoing edges.

63. def lesp(s: N, t: N): Option[LPath[N, B]]

    

    Shortest path from vertex s to vertex t, with labels

64. def level(v: N): Seq[(N, Int)]

    

    Breadth-first search giving the distance of each node from the node v.

65. def leveln(vs: Seq[(N, Int)]): Seq[(N, Int)]

    

    Breadth-first search giving the distance of each node from the search nodes.

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

    

    Definition Classes

    AnyRef

67. def neighbors(v: N): Vector[N]

    

    Find the neighbors of a node

68. def nmap[C](f: (A) ⇒ C): Graph[N, C, B]

    

    Map a function over the node labels in the graph

69. def nodes: Vector[N]

    

    A list of all the nodes in the graph

70. final def notify(): Unit

    

    Definition Classes

    AnyRef

71. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

72. def outDegree(v: N): Int

    

    The number of outbound edges from the given node

73. def outEdges(v: N): Vector[LEdge[N, B]]

    

    Find all outbound edges for the given node

74. def outs(v: N): Adj[N, B]

    

    All the outbound links of the given node, including self-edges

75. def predecessors(v: N): Vector[N]

    

    Find all nodes that have a link to the given node

76. def rdfs(vs: Seq[N]): Seq[N]

    

    Reverse depth-first search.

    Reverse depth-first search. Follows predecessors.

77. def reachable(v: N): Vector[N]

    

    Finds all the reachable nodes from a given node, using DFS

78. def removeEdge(e: Edge[N]): Graph[N, A, B]

    

    Remove an edge from this graph

79. def removeEdges(es: Seq[Edge[N]]): Graph[N, A, B]

    

    Remove multiple edges from this graph

80. def removeLEdge(e: LEdge[N, B]): Graph[N, A, B]

    

    Remove an edge from this graph only if the label matches

81. def removeNode(v: N): Graph[N, A, B]

    

    Remove a node from this graph

82. def removeNodes(vs: Seq[N]): Graph[N, A, B]

    

    Remove multiple nodes from this graph

83. val rep: GraphRep[N, A, B]

    

84. def reverse: Graph[N, A, B]

    

    Reverse the direction of all edges

85. def roots: Set[N]

    

    Find the roots of the graph.

    Find the roots of the graph. A root is a node which has no incoming edges.

86. def safeAddEdge(e: LEdge[N, B], failover: ⇒ Graph[N, A, B] = this): Graph[N, A, B]

    

    Add an edge to this graph.

    Add an edge to this graph. If the source and target nodes don't exist in this graph, return the given failover graph.

87. def safeAddEdges(es: Seq[LEdge[N, B]]): Graph[N, A, B]

    

    Add multiple edges to this graph, ignoring edges whose source and target nodes don't already exist in the graph.

88. def successors(v: N): Vector[N]

    

    Find all nodes that have a link from the given node

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

    

    Definition Classes

    AnyRef

90. def tclose: Graph[N, A, Unit]

    

    Finds the transitive closure of this graph.

91. def toString(): String

    

    Definition Classes

    Graph → AnyRef → Any

92. def udfs(vs: Seq[N]): Seq[N]

    

    Undirected depth-first search

93. def undir: Graph[N, A, B]

    

    Make the graph undirected, ensuring that every edge has an inverse.

    Make the graph undirected, ensuring that every edge has an inverse. This takes edge labels into account when considering whether two edges are equal.

94. def union(g: Graph[N, A, B]): Graph[N, A, B]

    

    Adds all the nodes and edges from one graph to another.

95. def unlabel: Graph[N, Unit, Unit]

    

    Erase all labels in the graph

96. def updateEdge(e: LEdge[N, B]): Graph[N, A, B]

    

    Replace an edge with a new one

97. def updateEdges(es: Seq[LEdge[N, B]]): Graph[N, A, B]

    

    Update multiple edges

98. def updateNode(n: LNode[N, A]): Graph[N, A, B]

    

    Replace a node with a new one

99. def updateNodes(ns: Seq[LNode[N, A]]): Graph[N, A, B]

    

    Update multiple nodes

100. def vmap[M](f: (N) ⇒ M): Graph[M, A, B]

     

     Map over the unique node identifiers in the graph

101. final def wait(): Unit

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

104. def xdfWith[C](vs: Seq[N], d: (Context[N, A, B]) ⇒ Seq[N], f: (Context[N, A, B]) ⇒ C): (Vector[Tree[C]], Graph[N, A, B])

     

     Generalized depth-first forest.

     Generalized depth-first forest. Uses the function d to decide which nodes to visit next

105. def xdffWith[C](vs: Seq[N], d: (Context[N, A, B]) ⇒ Seq[N], f: (Context[N, A, B]) ⇒ C): Vector[Tree[C]]

     

     Generalized depth-first forest.

     Generalized depth-first forest. Uses the function d to decide which nodes to visit next.

106. final def xdfsWith[C](vs: Seq[N], d: (Context[N, A, B]) ⇒ Seq[N], f: (Context[N, A, B]) ⇒ C): Vector[C]

     

     Generalized depth-first search.

107. def →[B](y: B): (Graph[N, A, B], B)

     

     Implicit information

     This member is added by an implicit conversion from Graph[N, A, B] to ArrowAssoc[Graph[N, A, B]] performed by method ArrowAssoc in scala.Predef.

     Definition Classes

     ArrowAssoc