Packages

c

net.sansa_stack.inference.rules

RuleDependencyGraph

class RuleDependencyGraph extends DefaultGraphImpl[Rule, LDiEdge]

Given a set of rules R, a rule dependency graph (RDG) is a directed graph G = (V, E) such that

  • each vertex in V represents a rule r_i from R and
  • each edge (r_i, r_j) in E denotes the dependency between them

The dependency between two rules r_i and r_j, denoted as r_i -> r_j, resp. "r_i depends on r_j" indicates that the result of r_j is used as input of r_i. In particular, that means we use the same direction in the graph although one would expect to have an edge from the rule r_j producing the data to the rule r_i consuming the data.

Some notes about the types used: The Rule class stems from org.apache.jena.reasoner.rulesys and comprises a list of antecedents (body) and a list of consequents (head), i.e.

consequent [, consequent] <- antecedent [, antecedent]

where each consequent or antecedent can be a TriplePattern (i.e. a triple of Nodes, themselves being either variables, wildcards, embedded functors, uri or literal graph nodes), a Functor or a Rule.

The Graph and LDiEdge ('labeled directed edge') classes stem from scalax.collection which provides the main graph functionality. Considering a scalax.collection.Graph two kinds of Nodes are distinguished:

- Outer Nodes Outer nodes exist outside of the context of any particular graph and must be provided by the library user. When added to a graph, they will be transparently wrapped by a corresponding inner node. Outer nodes must satisfy the upper bound of the node type parameter of the graph - Inner Nodes Inner nodes are objects bound to a particular graph. They are transparently created on graph instantiation or on adding nodes to a graph. Inner nodes are instances of the inner class NodeT, hence the term, and are implementing the InnerNodeLike interface. An inner node acts as a container of the corresponding outer node also providing a wealth of graph functionality such as diSuccessors or pathTo. Inner nodes always equal to the contained, user-provided outer node thus facilitating interchangeability of inner and outer nodes in many situations. Note that NodeT is a path dependent type such as g.NodeT with g denoting a single graph instance.

(Descriptions taken from http://www.scala-graph.org/guides/core-inner-outer.html)

Linear Supertypes
DefaultGraphImpl[Rule, LDiEdge], GraphTraversalImpl[Rule, LDiEdge], State[Rule, LDiEdge], TraverserImpl[Rule, LDiEdge], AdjacencyListGraph[Rule, LDiEdge, DefaultGraphImpl], AdjacencyListBase[Rule, LDiEdge, DefaultGraphImpl], Graph[Rule, LDiEdge], GraphLike[Rule, LDiEdge, DefaultGraphImpl], Mutable, EdgeOps[Rule, LDiEdge, DefaultGraphImpl], Cloneable[Graph[Rule, LDiEdge]], Cloneable, Cloneable, Shrinkable[Param[Rule, LDiEdge]], Growable[Param[Rule, LDiEdge]], Clearable, Graph[Rule, LDiEdge], GraphLike[Rule, LDiEdge, DefaultGraphImpl], GraphDegree[Rule, LDiEdge], GraphTraversal[Rule, LDiEdge], GraphBase[Rule, LDiEdge], Serializable, Serializable, Set[Param[Rule, LDiEdge]], SetLike[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]], Subtractable[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]], GenSet[Param[Rule, LDiEdge]], GenericSetTemplate[Param[Rule, LDiEdge], Set], GenSetLike[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]], Iterable[Param[Rule, LDiEdge]], IterableLike[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]], Equals, GenIterable[Param[Rule, LDiEdge]], GenIterableLike[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]], Traversable[Param[Rule, LDiEdge]], GenTraversable[Param[Rule, LDiEdge]], GenericTraversableTemplate[Param[Rule, LDiEdge], Set], TraversableLike[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]], GenTraversableLike[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]], Parallelizable[Param[Rule, LDiEdge], ParSet[Param[Rule, LDiEdge]]], TraversableOnce[Param[Rule, LDiEdge]], GenTraversableOnce[Param[Rule, LDiEdge]], FilterMonadic[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]], HasNewBuilder[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]], (Param[Rule, LDiEdge]) ⇒ Boolean, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RuleDependencyGraph
  2. DefaultGraphImpl
  3. GraphTraversalImpl
  4. State
  5. TraverserImpl
  6. AdjacencyListGraph
  7. AdjacencyListBase
  8. Graph
  9. GraphLike
  10. Mutable
  11. EdgeOps
  12. Cloneable
  13. Cloneable
  14. Cloneable
  15. Shrinkable
  16. Growable
  17. Clearable
  18. Graph
  19. GraphLike
  20. GraphDegree
  21. GraphTraversal
  22. GraphBase
  23. Serializable
  24. Serializable
  25. Set
  26. SetLike
  27. Subtractable
  28. GenSet
  29. GenericSetTemplate
  30. GenSetLike
  31. Iterable
  32. IterableLike
  33. Equals
  34. GenIterable
  35. GenIterableLike
  36. Traversable
  37. GenTraversable
  38. GenericTraversableTemplate
  39. TraversableLike
  40. GenTraversableLike
  41. Parallelizable
  42. TraversableOnce
  43. GenTraversableOnce
  44. FilterMonadic
  45. HasNewBuilder
  46. Function1
  47. AnyRef
  48. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RuleDependencyGraph(graph: Graph[Rule, LDiEdge])
  2. new RuleDependencyGraph(iniNodes: Iterable[Rule] = Set[Rule](), iniEdges: Iterable[LDiEdge[Rule]] = Set[LDiEdge[Rule]]())

Type Members

  1. sealed abstract class AbstractTopologicalOrder[+A, +T] extends AbstractTraversable[T]
    Definition Classes
    GraphTraversal
  2. class AnyEdgeLazyCycle extends (GraphTraversalImpl.this)#AnyEdgeLazyPath with (GraphTraversalImpl.this)#Cycle
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  3. class AnyEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  4. abstract class Component extends Properties
    Definition Classes
    GraphTraversal
  5. case class ComponentTraverser extends (GraphTraversalImpl.this)#ComponentTraverser with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  6. type Config = CoreConfig
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase → GraphLike
  7. trait Cycle extends Path
    Definition Classes
    GraphTraversal
  8. type CycleNodeOrTopologicalOrder = Either[NodeT, TopologicalOrder[NodeT]]
    Definition Classes
    GraphTraversal
  9. trait DegreeFunction extends ((GraphDegree.this)#NodeT) ⇒ Int
    Definition Classes
    GraphDegree
  10. type DegreeNodeSeqEntry = (Int, NodeT)
    Definition Classes
    GraphDegree
  11. final class DegreeOrdering extends Ordering[(GraphDegree.this)#NodeT]
    Definition Classes
    GraphDegree
  12. trait DownUpTraverser[A, +This <: (GraphTraversalImpl.this)#DownUpTraverser[A, This]] extends (GraphTraversalImpl.this)#TraverserMethods[A, This] with (GraphTraversalImpl.this)#Impl[A, This]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  13. trait Edge extends Serializable
    Definition Classes
    GraphBase
  14. class EdgeBase extends InnerEdgeParam[N, E, (GraphLike.this)#NodeT, E] with (GraphLike.this)#InnerEdge
    Definition Classes
    GraphLike
  15. type EdgeFilter = (EdgeT) ⇒ Boolean
    Definition Classes
    GraphBase
  16. class EdgeImpl extends scalax.collection.mutable.AdjacencyListGraph.This.EdgeBase
    Definition Classes
    AdjacencyListGraph
    Annotations
    @SerialVersionUID()
  17. sealed trait EdgeOrdering extends Ordering[scalax.collection.GraphBase.EdgeT] with ElemOrdering
    Definition Classes
    GraphBase
  18. class EdgeSet extends scalax.collection.mutable.AdjacencyListGraph.This.EdgeSet with scalax.collection.mutable.AdjacencyListGraph.This.EdgeSet
    Definition Classes
    AdjacencyListGraph
  19. type EdgeSetT = EdgeSet
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphBase
  20. type EdgeT = EdgeImpl
    Definition Classes
    AdjacencyListGraph → GraphLike → GraphBase
  21. sealed trait ElemOrdering extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphBase
  22. trait ExtendedNodeVisitor[U] extends (scalax.collection.GraphTraversal.NodeT) ⇒ U with (scalax.collection.GraphTraversal.NodeT, Int, Int, ⇒ NodeInformer) ⇒ U
    Definition Classes
    GraphTraversal
  23. trait Filter[T] extends (T) ⇒ Boolean
    Definition Classes
    GraphDegree
  24. abstract class FluentProperties[+This <: FluentProperties[This]] extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphTraversal
  25. trait Impl[A, +This <: scalax.collection.GraphTraversalImpl.Traverser[A, This] with scalax.collection.GraphTraversalImpl.Impl[A, This]] extends scalax.collection.GraphTraversalImpl.TraverserMethods[A, This] with scalax.collection.GraphTraversalImpl.Traverser[A, This]
    Attributes
    protected[collection]
    Definition Classes
    TraverserImpl
  26. trait InnerEdge extends (GraphLike.this)#InnerEdge
    Definition Classes
    GraphLike
  27. case class InnerEdgeTraverser extends (GraphTraversalImpl.this)#InnerEdgeTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#EdgeT, (GraphTraversalImpl.this)#InnerEdgeTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  28. sealed trait InnerElem extends AnyRef
    Definition Classes
    GraphBase
  29. case class InnerElemTraverser extends (GraphTraversalImpl.this)#InnerElemTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#InnerElem, (GraphTraversalImpl.this)#InnerElemTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  30. trait InnerNode extends (AdjacencyListBase.this)#InnerNode
    Definition Classes
    AdjacencyListBase
  31. case class InnerNodeDownUpTraverser extends (GraphTraversalImpl.this)#InnerNodeDownUpTraverser with (GraphTraversalImpl.this)#DownUpTraverser[(Boolean, (GraphTraversalImpl.this)#NodeT), (GraphTraversalImpl.this)#InnerNodeDownUpTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  32. abstract class InnerNodeImpl extends scalax.collection.mutable.AdjacencyListGraph.This.NodeBase with scalax.collection.mutable.AdjacencyListGraph.This.InnerNode with scalax.collection.mutable.AdjacencyListGraph.This.InnerNode
    Definition Classes
    AdjacencyListGraph
  33. trait InnerNodeOps extends AnyRef
    Definition Classes
    EdgeOps
  34. trait InnerNodeState extends AnyRef
    Definition Classes
    State
  35. trait InnerNodeTraversalImpl extends (GraphTraversalImpl.this)#TraverserInnerNode with (GraphTraversalImpl.this)#InnerNodeState
    Definition Classes
    GraphTraversalImpl
  36. case class InnerNodeTraverser extends (GraphTraversalImpl.this)#InnerNodeTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#NodeT, (GraphTraversalImpl.this)#InnerNodeTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  37. case class Layer extends Product with Serializable
    Definition Classes
    GraphTraversal
  38. final class LayeredTopologicalOrder[+A] extends AbstractTopologicalOrder[A, (Int, Iterable[A])]
    Definition Classes
    GraphTraversal
  39. type Layers = Traversable[Layer]
    Definition Classes
    GraphTraversal
  40. abstract class LazyPath extends (GraphTraversalImpl.this)#Path
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  41. final class MapPathTraversable[T] extends Traversable[T]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  42. class MinWeightEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  43. class MultiEdgeLazyCycle extends (GraphTraversalImpl.this)#MultiEdgeLazyPath with (GraphTraversalImpl.this)#Cycle
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  44. class MultiEdgeLazyPath extends (GraphTraversalImpl.this)#LazyPath
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  45. trait Node extends Serializable
    Definition Classes
    GraphBase
  46. final class NodeBase extends scalax.collection.mutable.DefaultGraphImpl.InnerNodeImpl with scalax.collection.mutable.DefaultGraphImpl.InnerNodeTraversalImpl
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl
    Annotations
    @SerialVersionUID()
  47. type NodeFilter = (NodeT) ⇒ Boolean
    Definition Classes
    GraphBase
  48. sealed trait NodeOrdering extends Ordering[scalax.collection.GraphBase.NodeT] with ElemOrdering
    Definition Classes
    GraphBase
  49. class NodeSet extends scalax.collection.mutable.AdjacencyListGraph.This.NodeSet with scalax.collection.mutable.AdjacencyListGraph.This.NodeSet
    Definition Classes
    AdjacencyListGraph
  50. type NodeSetT = NodeSet
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphBase
  51. type NodeT = NodeBase
    Definition Classes
    DefaultGraphImpl → GraphTraversalImpl → AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphTraversal → GraphBase
  52. case class OuterEdgeTraverser extends (GraphTraversalImpl.this)#OuterEdgeTraverser with (GraphTraversalImpl.this)#Impl[E[N], (GraphTraversalImpl.this)#OuterEdgeTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  53. case class OuterElemTraverser extends (GraphTraversalImpl.this)#TraverserMethods[OuterElem[N, E], (GraphTraversalImpl.this)#OuterElemTraverser] with (GraphTraversalImpl.this)#OuterElemTraverser with (GraphTraversalImpl.this)#Impl[OuterElem[N, E], (GraphTraversalImpl.this)#OuterElemTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  54. case class OuterNodeDownUpTraverser extends (GraphTraversalImpl.this)#OuterNodeDownUpTraverser with (GraphTraversalImpl.this)#DownUpTraverser[(Boolean, N), (GraphTraversalImpl.this)#OuterNodeDownUpTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  55. case class OuterNodeTraverser extends (GraphTraversalImpl.this)#OuterNodeTraverser with (GraphTraversalImpl.this)#Impl[N, (GraphTraversalImpl.this)#OuterNodeTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  56. trait Path extends Walk
    Definition Classes
    GraphTraversal
  57. class PathBuilder extends (GraphTraversalImpl.this)#WalkBuilder with (GraphTraversalImpl.this)#PathBuilder
    Definition Classes
    GraphTraversalImpl
  58. trait Properties extends SubgraphProperties
    Attributes
    protected
    Definition Classes
    GraphTraversal
  59. final class ReverseStackTraversable[S <: NodeElement] extends Traversable[(GraphTraversalImpl.this)#NodeT]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  60. type Self = DefaultGraphImpl[Rule, LDiEdge]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  61. abstract class SimpleLazyPath extends (GraphTraversalImpl.this)#LazyPath
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  62. class StrongComponentImpl extends (GraphTraversalImpl.this)#Component
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  63. case class StrongComponentTraverser extends (GraphTraversalImpl.this)#StrongComponentTraverser with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  64. trait SubgraphProperties extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphTraversal
  65. type ThisGraph = RuleDependencyGraph.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
  66. type TopoSortSetup = (Buffer[NodeT], Map[NodeT, Int], Option[NodeT])
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  67. final class TopologicalOrder[+A] extends AbstractTopologicalOrder[A, A]
    Definition Classes
    GraphTraversal
  68. trait Traverser[A, +This <: Traverser[A, This]] extends TraverserMethods[A, This] with Properties with Traversable[A]
    Definition Classes
    GraphTraversal
  69. trait TraverserInnerNode extends scalax.collection.GraphTraversal.InnerNode
    Definition Classes
    GraphTraversal
  70. abstract class TraverserMethods[A, +This <: TraverserMethods[A, This]] extends FluentProperties[This]
    Attributes
    protected
    Definition Classes
    GraphTraversal
  71. trait Walk extends Traversable[scalax.collection.GraphTraversal.InnerElem]
    Definition Classes
    GraphTraversal
  72. class WalkBuilder extends (GraphTraversalImpl.this)#WalkBuilder
    Definition Classes
    GraphTraversalImpl
  73. class WeakComponentImpl extends (GraphTraversalImpl.this)#Component
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  74. class Weight extends AnyRef
    Definition Classes
    GraphTraversal
  75. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def &(that: GenSet[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    GenSetLike
  4. def &=(coll: Iterable[Param[Rule, LDiEdge]]): RuleDependencyGraph.this.type
    Definition Classes
    GraphLike
  5. def &~(that: GenSet[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    GenSetLike
  6. def +(node: Rule): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    GraphLike → GraphLike
  7. def +(elem: Param[Rule, LDiEdge]): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    GraphLike → SetLike → GenSetLike
  8. def +(elem1: Param[Rule, LDiEdge], elem2: Param[Rule, LDiEdge], elems: Param[Rule, LDiEdge]*): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    SetLike
  9. final def +#(edge: LDiEdge[Rule]): DefaultGraphImpl[Rule, LDiEdge]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  10. def ++(elems: GenTraversableOnce[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    GraphLike → SetLike
  11. def ++[B >: Param[Rule, LDiEdge], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  12. def ++:[B >: Param[Rule, LDiEdge], That](that: Traversable[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That
    Definition Classes
    TraversableLike
  13. def ++:[B >: Param[Rule, LDiEdge], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That
    Definition Classes
    TraversableLike
  14. def ++=(xs: TraversableOnce[Param[Rule, LDiEdge]]): RuleDependencyGraph.this.type
    Definition Classes
    GraphLike → Growable
  15. def +=(elem: Param[Rule, LDiEdge]): RuleDependencyGraph.this.type
    Definition Classes
    GraphLike → Growable
  16. final def +=(node: Rule): RuleDependencyGraph.this.type
    Definition Classes
    GraphLike
    Annotations
    @inline()
  17. def +=(elem1: Param[Rule, LDiEdge], elem2: Param[Rule, LDiEdge], elems: Param[Rule, LDiEdge]*): RuleDependencyGraph.this.type
    Definition Classes
    Growable
  18. final def +=#(edge: LDiEdge[Rule]): RuleDependencyGraph.this.type
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  19. final def +~%+=[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: Rule, node_2: Rule, nodes: Rule*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): RuleDependencyGraph.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  20. final def +~%+=[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: Rule, node_2: Rule)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): RuleDependencyGraph.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  21. final def +~%=[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: Rule, node_2: Rule, nodes: Rule*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): RuleDependencyGraph.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  22. final def +~%=[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: Rule, node_2: Rule)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): RuleDependencyGraph.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  23. final def +~+=[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: Rule, node_2: Rule, nodes: Rule*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): RuleDependencyGraph.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  24. final def +~+=[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: Rule, node_2: Rule)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): RuleDependencyGraph.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  25. final def +~=(node_1: Rule, node_2: Rule, nodes: Rule*)(implicit edgeFactory: HyperEdgeCompanion[LDiEdge], endpointsKind: CollectionKind): RuleDependencyGraph.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  26. final def +~=(node_1: Rule, node_2: Rule)(implicit edgeFactory: EdgeCompanion[LDiEdge]): RuleDependencyGraph.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  27. final def -(edge: LDiEdge[Rule]): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  28. final def -(node: Rule): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  29. def -(elem: Param[Rule, LDiEdge]): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    GraphLike → SetLike → Subtractable → GenSetLike
  30. def -(elem1: Param[Rule, LDiEdge], elem2: Param[Rule, LDiEdge], elems: Param[Rule, LDiEdge]*): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    Subtractable
  31. final def -!(edge: LDiEdge[Rule]): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  32. def -!(elem: Param[Rule, LDiEdge]): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    GraphLike
  33. final def -!#(edge: LDiEdge[Rule]): DefaultGraphImpl[Rule, LDiEdge]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  34. def -!=(elem: Param[Rule, LDiEdge]): RuleDependencyGraph.this.type
    Definition Classes
    GraphLike
  35. final def -!=#(edge: LDiEdge[Rule]): RuleDependencyGraph.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
    Annotations
    @inline()
  36. final def -#(edge: LDiEdge[Rule]): DefaultGraphImpl[Rule, LDiEdge]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  37. def --(elems: GenTraversableOnce[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    GraphLike → Subtractable
  38. def --!(elems: GenTraversableOnce[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    GraphLike
  39. final def --!=(coll: Iterable[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  40. def --=(xs: TraversableOnce[Param[Rule, LDiEdge]]): RuleDependencyGraph.this.type
    Definition Classes
    Shrinkable
  41. def -=(elem: Param[Rule, LDiEdge]): RuleDependencyGraph.this.type
    Definition Classes
    GraphLike → Shrinkable
  42. final def -=(node: Rule): RuleDependencyGraph.this.type
    Definition Classes
    GraphLike
    Annotations
    @inline()
  43. def -=(elem1: Param[Rule, LDiEdge], elem2: Param[Rule, LDiEdge], elems: Param[Rule, LDiEdge]*): RuleDependencyGraph.this.type
    Definition Classes
    Shrinkable
  44. final def -=#(edge: LDiEdge[Rule]): RuleDependencyGraph.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
    Annotations
    @inline()
  45. final def -?(node: Rule): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  46. final def -?=(node: Rule): RuleDependencyGraph.this.type
    Definition Classes
    GraphLike
    Annotations
    @inline()
  47. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  48. final def add(edge: LDiEdge[Rule]): Boolean
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  49. final def add(node: Rule): Boolean
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  50. final def addAndGet(edge: LDiEdge[Rule]): EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  51. final def addAndGet(node: Rule): NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  52. def addAndGetEdge(node_1: Rule, node_2: Rule, nodes: Rule*)(implicit edgeFactory: HyperEdgeCompanion[LDiEdge], endpointsKind: CollectionKind): EdgeT
    Definition Classes
    EdgeOps
  53. final def addAndGetEdge(node_1: Rule, node_2: Rule)(implicit edgeFactory: EdgeCompanion[LDiEdge]): EdgeT
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  54. def addAndGetLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: Rule, node_2: Rule, nodes: Rule*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): EdgeT
    Definition Classes
    EdgeOps
  55. final def addAndGetLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: Rule, node_2: Rule)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): EdgeT
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  56. def addAndGetWEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: Rule, node_2: Rule, nodes: Rule*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): EdgeT
    Definition Classes
    EdgeOps
  57. final def addAndGetWEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: Rule, node_2: Rule)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): EdgeT
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  58. def addAndGetWLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: Rule, node_2: Rule, nodes: Rule*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): EdgeT
    Definition Classes
    EdgeOps
  59. final def addAndGetWLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: Rule, node_2: Rule)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): EdgeT
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  60. final def addEdge(node_1: Rule, node_2: Rule, nodes: Rule*)(implicit edgeFactory: HyperEdgeCompanion[LDiEdge], endpointsKind: CollectionKind): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  61. final def addEdge(node_1: Rule, node_2: Rule)(implicit edgeFactory: EdgeCompanion[LDiEdge]): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  62. final def addLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: Rule, node_2: Rule, nodes: Rule*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  63. final def addLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: Rule, node_2: Rule)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  64. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  65. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  66. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  67. final def addWEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: Rule, node_2: Rule, nodes: Rule*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  68. final def addWEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: Rule, node_2: Rule)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  69. final def addWLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: Rule, node_2: Rule, nodes: Rule*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  70. final def addWLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: Rule, node_2: Rule)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  71. def aggregate[B](z: ⇒ B)(seqop: (B, Param[Rule, LDiEdge]) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  72. def andThen[A](g: (Boolean) ⇒ A): (Param[Rule, LDiEdge]) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  73. final val anyEdge: EdgeFilter
    Definition Classes
    GraphBase
  74. final def anyEdgeSelector(from: NodeT, to: NodeT): Option[EdgeT]
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  75. final val anyNode: NodeFilter
    Definition Classes
    GraphBase
  76. final lazy val anyOrdering: AnyOrdering[Rule]
    Attributes
    protected
    Definition Classes
    GraphBase
  77. def apply(elem: Param[Rule, LDiEdge]): Boolean
    Definition Classes
    GenSetLike → Function1
  78. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  79. def asSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String
    Definition Classes
    GraphLike
  80. final def bulkOp(elems: GenTraversableOnce[Param[Rule, LDiEdge]], isPlusPlus: Boolean): DefaultGraphImpl[Rule, LDiEdge]
    Attributes
    protected
    Definition Classes
    GraphLike
  81. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  82. final def clear(): Unit
    Definition Classes
    AdjacencyListGraph → Growable → Clearable
    Annotations
    @inline()
  83. def clearNodeStates(flags: FlagWord, flagsExt: ExtBitSet): Unit
    Attributes
    protected
    Definition Classes
    State
  84. final def clone(): RuleDependencyGraph.this.type
    Definition Classes
    DefaultGraphImpl → GraphLike → Cloneable → AnyRef
  85. def collect[B, That](pf: PartialFunction[Param[Rule, LDiEdge], B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  86. def collectFirst[B](pf: PartialFunction[Param[Rule, LDiEdge], B]): Option[B]
    Definition Classes
    TraversableOnce
  87. def companion: GenericCompanion[Set]
    Definition Classes
    Set → GenSet → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  88. def componentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): ComponentTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  89. def compose[A](g: (A) ⇒ Param[Rule, LDiEdge]): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  90. implicit val config: scalax.collection.mutable.DefaultGraphImpl.Config with AdjacencyListArrayConfig
    Definition Classes
    DefaultGraphImpl → GraphLike
  91. def contains(elem: Param[Rule, LDiEdge]): Boolean
    Definition Classes
    GraphLike → SetLike → GenSetLike
  92. def copyToArray[B >: Param[Rule, LDiEdge]](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  93. def copyToArray[B >: Param[Rule, LDiEdge]](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def copyToArray[B >: Param[Rule, LDiEdge]](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def copyToBuffer[B >: Param[Rule, LDiEdge]](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  96. def count(p: (Param[Rule, LDiEdge]) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. final def cycle(results: Option[(NodeT, ArrayStack[CycleStackElem])], edgeFilter: EdgeFilter): Option[Cycle]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  98. final def cycle(maybeStart: Option[NodeT], stack: ArrayStack[Element], edgeFilter: EdgeFilter): Option[Cycle]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  99. final lazy val defaultEdgeOrdering: EdgeOrdering
    Definition Classes
    GraphBase
  100. final lazy val defaultNodeOrdering: NodeOrdering
    Definition Classes
    GraphBase
  101. final def defaultPathSize: Int
    Attributes
    protected
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  102. def degreeCount(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, Int]
    Definition Classes
    GraphDegree
  103. def degreeNodeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[DegreeNodeSeqEntry]
    Definition Classes
    GraphDegree
  104. def degreeNodesMap(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, AnySet[NodeT]]
    Definition Classes
    GraphDegree
  105. def degreeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[Int]
    Definition Classes
    GraphDegree
  106. def degreeSet(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedSet[Int]
    Definition Classes
    GraphDegree
  107. def diff(that: GenSet[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    SetLike → GenSetLike
  108. def drop(n: Int): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  109. def dropRight(n: Int): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    IterableLike
  110. def dropWhile(p: (Param[Rule, LDiEdge]) ⇒ Boolean): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    TraversableLike → GenTraversableLike
  111. def dump(store: FlagStore): ExtBitSet
    Attributes
    protected
    Definition Classes
    State
  112. def dumpDirty: ExtBitSet
    Definition Classes
    State
  113. def dumpInUse: ExtBitSet
    Definition Classes
    State
  114. def edgeIterator: GroupIterator[EdgeT] { ... /* 2 definitions in type refinement */ }
    Definition Classes
    AdjacencyListBase
  115. implicit val edgeT: ClassTag[LDiEdge[Rule]]
    Definition Classes
    DefaultGraphImpl → GraphLike
  116. implicit final def edgeToEdgeCont(e: LDiEdge[Rule]): LDiEdge[NodeT]
    Attributes
    protected
    Definition Classes
    GraphBase
  117. final def edges: EdgeSetT
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  118. final def empty: DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    DefaultGraphImpl → Graph → Graph → SetLike → GenericSetTemplate
  119. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  120. def equals(that: Any): Boolean
    Definition Classes
    GraphLike → GenSetLike → Equals → AnyRef → Any
  121. def exists(p: (Param[Rule, LDiEdge]) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  122. final def expectedMaxNodes(divisor: Int, min: Int): Int
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  123. def filter(p: (Param[Rule, LDiEdge]) ⇒ Boolean): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    TraversableLike → GenTraversableLike
  124. def filterNot(p: (Param[Rule, LDiEdge]) ⇒ Boolean): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    TraversableLike → GenTraversableLike
  125. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  126. final def find(outerEdge: LDiEdge[Rule]): Option[EdgeT]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  127. final def find(outerNode: Rule): Option[NodeT]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  128. def find(p: (Param[Rule, LDiEdge]) ⇒ Boolean): Option[Param[Rule, LDiEdge]]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  129. final def findCycle[U](implicit visitor: (InnerElem) ⇒ U): Option[Cycle]
    Definition Classes
    GraphTraversal
  130. final def findCycleContaining[U](node: NodeT)(implicit visitor: (InnerElem) ⇒ U): Option[Cycle]
    Definition Classes
    GraphTraversal
  131. def flatMap[B, That](f: (Param[Rule, LDiEdge]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  132. def flatten[B](implicit asTraversable: (Param[Rule, LDiEdge]) ⇒ GenTraversableOnce[B]): Set[B]
    Definition Classes
    GenericTraversableTemplate
  133. def fold[A1 >: Param[Rule, LDiEdge]](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  134. def foldLeft[B](z: B)(op: (B, Param[Rule, LDiEdge]) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def foldRight[B](z: B)(op: (Param[Rule, LDiEdge], B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  136. final def forInDegrees(traversable: Traversable[NodeT] with SubgraphProperties, maybeHandle: Option[Handle], includeAnyway: Option[NodeT], includeInDegree: NodeFilter, fillInDegrees: Boolean): TopoSortSetup
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  137. def forall(p: (Param[Rule, LDiEdge]) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  138. def foreach[U](f: (Param[Rule, LDiEdge]) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  139. def genericBuilder[B]: Builder[B, Set[B]]
    Definition Classes
    GenericTraversableTemplate
  140. final def get(outerEdge: LDiEdge[Rule]): EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  141. final def get(outerNode: Rule): NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  142. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  143. final def getOrElse(outerEdge: LDiEdge[Rule], default: EdgeT): EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  144. final def getOrElse(outerNode: Rule, default: NodeT): NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  145. final val graphCompanion: DefaultGraphImpl.type
    Definition Classes
    DefaultGraphImpl → GraphLike
  146. def graphSize: Int
    Definition Classes
    GraphBase
  147. def groupBy[K](f: (Param[Rule, LDiEdge]) ⇒ K): Map[K, DefaultGraphImpl[Rule, LDiEdge]]
    Definition Classes
    TraversableLike → GenTraversableLike
  148. def grouped(size: Int): Iterator[DefaultGraphImpl[Rule, LDiEdge]]
    Definition Classes
    IterableLike
  149. def hasCycle(): Boolean

    Returns true if there is a cycle in the graph, i.e.

    Returns true if there is a cycle in the graph, i.e. either

    - there is a path n1 -> n2 -> ... -> n1 or - a loop, i.e. an edge that connects a vertex to itself.

  150. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  151. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  152. def having(node: NodeFilter, edge: EdgeFilter): PartialFunction[Param[Rule, LDiEdge], Boolean]
    Definition Classes
    GraphLike
  153. def head: Param[Rule, LDiEdge]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  154. def headOption: Option[Param[Rule, LDiEdge]]
    Definition Classes
    TraversableLike → GenTraversableLike
  155. def init: DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    TraversableLike → GenTraversableLike
  156. def initialize(nodes: Traversable[Rule], edges: Traversable[LDiEdge[Rule]]): Unit
    Attributes
    protected
    Definition Classes
    GraphBase
  157. def initializeFrom(in: ObjectInputStream, nodes: NodeSetT, edges: EdgeSetT): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  158. def inits: Iterator[DefaultGraphImpl[Rule, LDiEdge]]
    Definition Classes
    TraversableLike
  159. def innerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerEdgeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  160. def innerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerElemTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  161. def innerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerNodeDownUpTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  162. def innerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerNodeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  163. def intersect(that: GenSet[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    GenSetLike
  164. final def isAcyclic: Boolean
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  165. def isComplete: Boolean
    Definition Classes
    GraphTraversal
  166. def isConnected: Boolean
    Definition Classes
    GraphTraversal
  167. final def isCustomEdgeFilter(f: EdgeFilter): Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  168. final def isCustomNodeFilter(f: NodeFilter): Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  169. final def isCyclic: Boolean
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  170. def isDirected: Boolean
    Definition Classes
    GraphLike → GraphBase
  171. final val isDirectedT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  172. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  173. def isHyper: Boolean
    Definition Classes
    GraphLike → GraphBase
  174. final val isHyperT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  175. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  176. def isMixed: Boolean
    Definition Classes
    GraphLike → GraphBase
  177. def isMulti: Boolean
    Definition Classes
    GraphLike → GraphBase
  178. final val isMultiT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  179. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  180. final def isTrivial: Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  181. def iterator: Iterator[Param[Rule, LDiEdge]]
    Definition Classes
    GraphLike → GenSetLike → IterableLike → GenIterableLike
  182. def last: Param[Rule, LDiEdge]
    Definition Classes
    TraversableLike → GenTraversableLike
  183. def lastOption: Option[Param[Rule, LDiEdge]]
    Definition Classes
    TraversableLike → GenTraversableLike
  184. def layers(): Traversable[(Int, Iterable[Rule])]

    Applies topological sort and returns the resulting layers.

    Applies topological sort and returns the resulting layers. Each layer contains its level and a set of rules.

    returns

    the layers

  185. def loopNodes(): Set[NodeBase]

    Returns all nodes that are connected by an edge to itself.

  186. def map[B, That](f: (Param[Rule, LDiEdge]) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That
    Definition Classes
    SetLike → TraversableLike → GenTraversableLike → FilterMonadic
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.

  187. def max[B >: Param[Rule, LDiEdge]](implicit cmp: Ordering[B]): Param[Rule, LDiEdge]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  188. def maxBy[B](f: (Param[Rule, LDiEdge]) ⇒ B)(implicit cmp: Ordering[B]): Param[Rule, LDiEdge]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  189. def maxDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  190. def min[B >: Param[Rule, LDiEdge]](implicit cmp: Ordering[B]): Param[Rule, LDiEdge]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  191. def minBy[B](f: (Param[Rule, LDiEdge]) ⇒ B)(implicit cmp: Ordering[B]): Param[Rule, LDiEdge]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  192. def minDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  193. def minusMinus(delNodes: Traversable[Rule], delEdges: Traversable[LDiEdge[Rule]]): DefaultGraphImpl[Rule, LDiEdge]
    Attributes
    protected
    Definition Classes
    GraphLike
  194. def minusMinusNodesEdges(delNodes: Traversable[Rule], delEdges: Traversable[LDiEdge[Rule]]): (Set[Rule], Set[LDiEdge[Rule]])
    Attributes
    protected
    Definition Classes
    GraphLike
  195. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  196. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  197. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  198. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  199. def newBuilder: GraphBuilder[Rule, LDiEdge, DefaultGraphImpl]
    Attributes
    protected[this]
    Definition Classes
    DefaultGraphImpl → SetLike → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  200. final def newEdge(innerEdge: LDiEdge[NodeT]): EdgeT
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  201. final def newEdgeTArray(size: Int): Array[EdgeT]
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase
    Annotations
    @inline()
  202. final def newNode(n: Rule): NodeT
    Attributes
    protected
    Definition Classes
    AdjacencyListBase → GraphBase
    Annotations
    @inline()
  203. final def newNodeSet: NodeSetT
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase
    Annotations
    @inline()
  204. final def newNodeWithHints(n: Rule, h: Hints): NodeBase
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase
    Annotations
    @inline()
  205. def newPathBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): PathBuilder
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  206. def newWalkBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): WalkBuilder
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  207. def nextHandle: Handle
    Attributes
    protected
    Definition Classes
    State
  208. final val noNode: NodeFilter
    Definition Classes
    GraphBase
  209. final def nodes: NodeSetT
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  210. def nodesToCEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with CHyperEdgeBound[_, EE]](factory: CHyperEdgeCompanion[EE], attrib: Product, node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): LDiEdge[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  211. def nodesToCEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with CEdgeBound[_, EE]](factory: CEdgeCompanion[EE], attrib: Product, node_1: Rule, node_2: Rule): LDiEdge[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  212. final def nodesToEdge(edgeFactory: HyperEdgeCompanion[LDiEdge], node_1: Rule, node_2: Rule, nodes: Rule*)(implicit endpointsKind: CollectionKind): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  213. final def nodesToEdge(edgeFactory: EdgeCompanion[LDiEdge], node_1: Rule, node_2: Rule): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  214. def nodesToEdgeCont(factory: EdgeCompanion[LDiEdge], node_1: Rule, node_2: Rule): LDiEdge[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  215. def nodesToEdgeCont(factory: HyperEdgeCompanion[LDiEdge], node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): LDiEdge[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  216. final def nodesToLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](edgeFactory: LHyperEdgeCompanion[EE], label: L, node_1: Rule, node_2: Rule, nodes: Rule*): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  217. final def nodesToLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](edgeFactory: LEdgeCompanion[EE], label: L, node_1: Rule, node_2: Rule): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  218. def nodesToLEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](factory: LEdgeCompanion[EE], label: L, node_1: Rule, node_2: Rule): LDiEdge[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  219. def nodesToLEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](factory: LHyperEdgeCompanion[EE], label: L, node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): LDiEdge[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  220. final def nodesToWEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](edgeFactory: WHyperEdgeCompanion[EE], weight: Double, node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  221. final def nodesToWEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](edgeFactory: WEdgeCompanion[EE], weight: Double, node_1: Rule, node_2: Rule): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  222. def nodesToWEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](factory: WEdgeCompanion[EE], weight: Double, node_1: Rule, node_2: Rule): LDiEdge[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  223. def nodesToWEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](factory: WHyperEdgeCompanion[EE], weight: Double, node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): LDiEdge[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  224. final def nodesToWLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](edgeFactory: WLHyperEdgeCompanion[EE], weight: Double, label: L, node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  225. final def nodesToWLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](edgeFactory: WLEdgeCompanion[EE], weight: Double, label: L, node_1: Rule, node_2: Rule): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  226. def nodesToWLEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](factory: WLEdgeCompanion[EE], weight: Double, label: L, node_1: Rule, node_2: Rule): LDiEdge[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  227. def nodesToWLEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](factory: WLHyperEdgeCompanion[EE], weight: Double, label: L, node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): LDiEdge[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  228. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  229. final def nonTrivial: Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  230. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  231. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  232. def order: Int
    Definition Classes
    GraphBase
  233. def outerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterEdgeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  234. def outerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterElemTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  235. def outerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterNodeDownUpTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  236. def outerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterNodeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  237. def par: ParSet[Param[Rule, LDiEdge]]
    Definition Classes
    Parallelizable
  238. def parCombiner: Combiner[Param[Rule, LDiEdge], ParSet[Param[Rule, LDiEdge]]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → Parallelizable
  239. final def partition(elems: GenTraversableOnce[Param[Rule, LDiEdge]]): Partitions[Rule, LDiEdge]
    Attributes
    protected
    Definition Classes
    GraphLike
  240. def partition(p: (Param[Rule, LDiEdge]) ⇒ Boolean): (DefaultGraphImpl[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge])
    Definition Classes
    TraversableLike → GenTraversableLike
  241. def plusPlus(newNodes: Traversable[Rule], newEdges: Traversable[LDiEdge[Rule]]): DefaultGraphImpl[Rule, LDiEdge]
    Attributes
    protected
    Definition Classes
    GraphLike
  242. def printNodes(): String

    returns

    a simple string representation of this graph

  243. def product[B >: Param[Rule, LDiEdge]](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  244. def reduce[A1 >: Param[Rule, LDiEdge]](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  245. def reduceLeft[B >: Param[Rule, LDiEdge]](op: (B, Param[Rule, LDiEdge]) ⇒ B): B
    Definition Classes
    TraversableOnce
  246. def reduceLeftOption[B >: Param[Rule, LDiEdge]](op: (B, Param[Rule, LDiEdge]) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  247. def reduceOption[A1 >: Param[Rule, LDiEdge]](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  248. def reduceRight[B >: Param[Rule, LDiEdge]](op: (Param[Rule, LDiEdge], B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  249. def reduceRightOption[B >: Param[Rule, LDiEdge]](op: (Param[Rule, LDiEdge], B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  250. def releaseHandle(handle: Handle): Unit
    Attributes
    protected
    Definition Classes
    State
  251. final def remove(edge: LDiEdge[Rule]): Boolean
    Definition Classes
    GraphLike
    Annotations
    @inline()
  252. final def remove(node: Rule): Boolean
    Definition Classes
    GraphLike
    Annotations
    @inline()
  253. final def removeGently(node: Rule): Boolean
    Definition Classes
    GraphLike
  254. final def removeWithNodes(edge: LDiEdge[Rule]): Boolean
    Definition Classes
    GraphLike
    Annotations
    @inline()
  255. def repr: DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    TraversableLike → GenTraversableLike
  256. def reversed: List[Param[Rule, LDiEdge]]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  257. def rules(): Set[Rule]

    This converts the graph-specific inner nodes to its corresponding outer nodes which may exist outside a graph context.

    This converts the graph-specific inner nodes to its corresponding outer nodes which may exist outside a graph context.

    returns

    the set of rules contained in this graph

  258. def sameElements[B >: Param[Rule, LDiEdge]](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  259. def scan[B >: Param[Rule, LDiEdge], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  260. def scanLeft[B, That](z: B)(op: (B, Param[Rule, LDiEdge]) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  261. def scanRight[B, That](z: B)(op: (Param[Rule, LDiEdge], B) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  262. def seq: Set[Param[Rule, LDiEdge]]
    Definition Classes
    Set → GenSet → GenSetLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  263. final def serializeTo(out: ObjectOutputStream): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  264. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  265. def sizeHintIfCheap: Int
    Attributes
    protected[collection]
    Definition Classes
    GenTraversableOnce
  266. def slice(from: Int, until: Int): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  267. def sliding(size: Int, step: Int): Iterator[DefaultGraphImpl[Rule, LDiEdge]]
    Definition Classes
    IterableLike
  268. def sliding(size: Int): Iterator[DefaultGraphImpl[Rule, LDiEdge]]
    Definition Classes
    IterableLike
  269. def span(p: (Param[Rule, LDiEdge]) ⇒ Boolean): (DefaultGraphImpl[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge])
    Definition Classes
    TraversableLike → GenTraversableLike
  270. def splitAt(n: Int): (DefaultGraphImpl[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge])
    Definition Classes
    TraversableLike → GenTraversableLike
  271. def stringPrefix: String
    Definition Classes
    GraphLike → SetLike → TraversableLike → GenTraversableLike
  272. def strongComponentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): StrongComponentTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  273. def subsetOf(that: GenSet[Param[Rule, LDiEdge]]): Boolean
    Definition Classes
    GenSetLike
  274. def subsets(): Iterator[DefaultGraphImpl[Rule, LDiEdge]]
    Definition Classes
    SetLike
  275. def subsets(len: Int): Iterator[DefaultGraphImpl[Rule, LDiEdge]]
    Definition Classes
    SetLike
  276. def sum[B >: Param[Rule, LDiEdge]](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  277. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  278. def tail: DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    TraversableLike → GenTraversableLike
  279. def tails: Iterator[DefaultGraphImpl[Rule, LDiEdge]]
    Definition Classes
    TraversableLike
  280. def take(n: Int): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  281. def takeRight(n: Int): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    IterableLike
  282. def takeWhile(p: (Param[Rule, LDiEdge]) ⇒ Boolean): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  283. def thisCollection: Iterable[Param[Rule, LDiEdge]]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  284. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Param[Rule, LDiEdge], Col[Param[Rule, LDiEdge]]]): Col[Param[Rule, LDiEdge]]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  285. def toArray[B >: Param[Rule, LDiEdge]](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  286. def toBuffer[A1 >: Param[Rule, LDiEdge]]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  287. def toCollection(repr: DefaultGraphImpl[Rule, LDiEdge]): Iterable[Param[Rule, LDiEdge]]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  288. def toIndexedSeq: IndexedSeq[Param[Rule, LDiEdge]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  289. def toIterable: Iterable[Param[Rule, LDiEdge]]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  290. def toIterator: Iterator[Param[Rule, LDiEdge]]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  291. def toList: List[Param[Rule, LDiEdge]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  292. def toMap[T, U](implicit ev: <:<[Param[Rule, LDiEdge], (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  293. def toSeq: Seq[Param[Rule, LDiEdge]]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  294. def toSet[B >: Param[Rule, LDiEdge]]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  295. def toSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String
    Definition Classes
    GraphLike
  296. def toStream: Stream[Param[Rule, LDiEdge]]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  297. def toString(): String
    Definition Classes
    GraphLike → SetLike → Function1 → TraversableLike → AnyRef → Any
  298. def toTraversable: Traversable[Param[Rule, LDiEdge]]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  299. def toVector: Vector[Param[Rule, LDiEdge]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  300. final def topologicalSort[U](implicit visitor: (InnerElem) ⇒ U): CycleNodeOrTopologicalOrder
    Definition Classes
    GraphTraversal
  301. final def topologicalSortByComponent[U](implicit visitor: (InnerElem) ⇒ U): Traversable[CycleNodeOrTopologicalOrder]
    Definition Classes
    GraphTraversal
  302. def totalDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  303. def totalWeight: Double
    Definition Classes
    GraphBase
  304. def transpose[B](implicit asTraversable: (Param[Rule, LDiEdge]) ⇒ GenTraversableOnce[B]): Set[Set[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  305. def union(that: GenSet[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    SetLike → GenSetLike
  306. def unzip[A1, A2](implicit asPair: (Param[Rule, LDiEdge]) ⇒ (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    GenericTraversableTemplate
  307. def unzip3[A1, A2, A3](implicit asTriple: (Param[Rule, LDiEdge]) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    GenericTraversableTemplate
  308. final def upsert(edge: LDiEdge[Rule]): Boolean
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  309. def view(from: Int, until: Int): IterableView[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]]
    Definition Classes
    IterableLike → TraversableLike
  310. def view: IterableView[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]]
    Definition Classes
    IterableLike → TraversableLike
  311. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  312. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  313. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  314. def withFilter(p: (Param[Rule, LDiEdge]) ⇒ Boolean): FilterMonadic[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]]
    Definition Classes
    TraversableLike → FilterMonadic
  315. def withHandle[T](reuse: Option[Handle])(block: (Handle) ⇒ T): T
    Attributes
    protected
    Definition Classes
    State
  316. def withHandles[T](nr: Int, reuse: Array[Handle])(block: (Array[Handle]) ⇒ T): T
    Attributes
    protected
    Definition Classes
    State
  317. def zip[A1 >: Param[Rule, LDiEdge], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  318. def zipAll[B, A1 >: Param[Rule, LDiEdge], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  319. def zipWithIndex[A1 >: Param[Rule, LDiEdge], That](implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  320. def |(that: GenSet[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
    Definition Classes
    GenSetLike
  321. object Edge extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  322. object InnerEdge extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  323. object InnerNode extends Serializable
    Definition Classes
    GraphBase
  324. object Node extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  325. object TraverserInnerNode extends Serializable
    Definition Classes
    GraphTraversal
    Annotations
    @transient()

Deprecated Value Members

  1. def /:[B](z: B)(op: (B, Param[Rule, LDiEdge]) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldLeft instead of /:

  2. def :\[B](z: B)(op: (Param[Rule, LDiEdge], B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldRight instead of :\

Inherited from DefaultGraphImpl[Rule, LDiEdge]

Inherited from GraphTraversalImpl[Rule, LDiEdge]

Inherited from State[Rule, LDiEdge]

Inherited from TraverserImpl[Rule, LDiEdge]

Inherited from AdjacencyListGraph[Rule, LDiEdge, DefaultGraphImpl]

Inherited from AdjacencyListBase[Rule, LDiEdge, DefaultGraphImpl]

Inherited from Graph[Rule, LDiEdge]

Inherited from GraphLike[Rule, LDiEdge, DefaultGraphImpl]

Inherited from Mutable

Inherited from EdgeOps[Rule, LDiEdge, DefaultGraphImpl]

Inherited from Cloneable[Graph[Rule, LDiEdge]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[Param[Rule, LDiEdge]]

Inherited from Growable[Param[Rule, LDiEdge]]

Inherited from Clearable

Inherited from Graph[Rule, LDiEdge]

Inherited from GraphLike[Rule, LDiEdge, DefaultGraphImpl]

Inherited from GraphDegree[Rule, LDiEdge]

Inherited from GraphTraversal[Rule, LDiEdge]

Inherited from GraphBase[Rule, LDiEdge]

Inherited from Serializable

Inherited from Serializable

Inherited from Set[Param[Rule, LDiEdge]]

Inherited from SetLike[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]]

Inherited from Subtractable[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]]

Inherited from GenSet[Param[Rule, LDiEdge]]

Inherited from GenericSetTemplate[Param[Rule, LDiEdge], Set]

Inherited from GenSetLike[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]]

Inherited from Iterable[Param[Rule, LDiEdge]]

Inherited from IterableLike[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]]

Inherited from Equals

Inherited from GenIterable[Param[Rule, LDiEdge]]

Inherited from GenIterableLike[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]]

Inherited from Traversable[Param[Rule, LDiEdge]]

Inherited from GenTraversable[Param[Rule, LDiEdge]]

Inherited from GenericTraversableTemplate[Param[Rule, LDiEdge], Set]

Inherited from TraversableLike[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]]

Inherited from GenTraversableLike[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]]

Inherited from Parallelizable[Param[Rule, LDiEdge], ParSet[Param[Rule, LDiEdge]]]

Inherited from TraversableOnce[Param[Rule, LDiEdge]]

Inherited from GenTraversableOnce[Param[Rule, LDiEdge]]

Inherited from FilterMonadic[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]]

Inherited from HasNewBuilder[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]]

Inherited from (Param[Rule, LDiEdge]) ⇒ Boolean

Inherited from AnyRef

Inherited from Any

Ungrouped