Class

net.sansa_stack.inference.rules

RuleDependencyGraph

Related Doc: package rules

Permalink

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

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])

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

    Permalink

Type Members

  1. sealed abstract class AbstractTopologicalOrder[+A, +T] extends AbstractTraversable[T]

    Permalink
    Definition Classes
    GraphTraversal
  2. class AnyEdgeLazyCycle extends (GraphTraversalImpl.this)#AnyEdgeLazyPath with (GraphTraversalImpl.this)#Cycle

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  3. class AnyEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  4. abstract class Component extends Properties

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  5. class ComponentImpl extends (GraphTraversalImpl.this)#Component

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  6. case class ComponentTraverser extends (GraphTraversalImpl.this)#ComponentTraverser with Product with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  7. type Config = CoreConfig

    Permalink
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase → GraphLike
  8. trait Cycle extends Path

    Permalink
    Definition Classes
    GraphTraversal
  9. type CycleNodeOrTopologicalOrder = Either[NodeT, TopologicalOrder[NodeT]]

    Permalink
    Definition Classes
    GraphTraversal
  10. type CycleStackElem = (NodeT, Iterable[EdgeT])

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  11. trait DegreeFunction extends ((GraphDegree.this)#NodeT) ⇒ Int

    Permalink
    Definition Classes
    GraphDegree
  12. type DegreeNodeSeqEntry = (Int, NodeT)

    Permalink
    Definition Classes
    GraphDegree
  13. final class DegreeOrdering extends Ordering[(GraphDegree.this)#NodeT]

    Permalink
    Definition Classes
    GraphDegree
  14. trait DownUpTraverser[A, +This <: (GraphTraversalImpl.this)#DownUpTraverser[A, This]] extends (GraphTraversalImpl.this)#TraverserMethods[A, This] with (GraphTraversalImpl.this)#Impl[A, This]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  15. trait Edge extends Serializable

    Permalink
    Definition Classes
    GraphBase
  16. class EdgeBase extends InnerEdgeParam[N, E, scalax.collection.GraphBase.NodeT, E] with InnerEdge

    Permalink
    Definition Classes
    GraphBase
  17. type EdgeFilter = (EdgeT) ⇒ Boolean

    Permalink
    Definition Classes
    GraphBase
  18. class EdgeImpl extends scalax.collection.mutable.AdjacencyListGraph.This.EdgeBase

    Permalink
    Definition Classes
    AdjacencyListGraph
    Annotations
    @SerialVersionUID()
  19. sealed trait EdgeOrdering extends Ordering[scalax.collection.GraphBase.EdgeT] with ElemOrdering

    Permalink
    Definition Classes
    GraphBase
  20. class EdgeSet extends scalax.collection.mutable.AdjacencyListGraph.This.EdgeSet with scalax.collection.mutable.AdjacencyListGraph.This.EdgeSet

    Permalink
    Definition Classes
    AdjacencyListGraph
    Annotations
    @SerialVersionUID()
  21. type EdgeSetT = EdgeSet

    Permalink
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphBase
  22. type EdgeT = EdgeImpl

    Permalink
    Definition Classes
    AdjacencyListGraph → GraphBase
  23. sealed trait ElemOrdering extends AnyRef

    Permalink
    Attributes
    protected
    Definition Classes
    GraphBase
  24. trait ExtendedNodeVisitor[U] extends (scalax.collection.GraphTraversal.NodeT) ⇒ U with (scalax.collection.GraphTraversal.NodeT, Int, Int, ⇒ NodeInformer) ⇒ U

    Permalink
    Definition Classes
    GraphTraversal
  25. trait Filter[T] extends (T) ⇒ Boolean

    Permalink
    Definition Classes
    GraphDegree
  26. abstract class FluentProperties[+This <: FluentProperties[This]] extends AnyRef

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  27. 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]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    TraverserImpl
  28. trait InnerEdge extends Iterable[scalax.collection.GraphBase.NodeT] with InnerEdgeParam[N, E, scalax.collection.GraphBase.NodeT, E] with Edge with InnerElem

    Permalink
    Definition Classes
    GraphBase
  29. case class InnerEdgeTraverser extends (GraphTraversalImpl.this)#InnerEdgeTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#EdgeT, (GraphTraversalImpl.this)#InnerEdgeTraverser] with Product with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  30. sealed trait InnerElem extends AnyRef

    Permalink
    Definition Classes
    GraphBase
  31. case class InnerElemTraverser extends (GraphTraversalImpl.this)#InnerElemTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#InnerElem, (GraphTraversalImpl.this)#InnerElemTraverser] with Product with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  32. trait InnerNode extends (AdjacencyListBase.this)#InnerNode

    Permalink
    Definition Classes
    AdjacencyListBase
  33. case class InnerNodeDownUpTraverser extends (GraphTraversalImpl.this)#InnerNodeDownUpTraverser with (GraphTraversalImpl.this)#DownUpTraverser[(Boolean, (GraphTraversalImpl.this)#NodeT), (GraphTraversalImpl.this)#InnerNodeDownUpTraverser] with Product with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  34. abstract class InnerNodeImpl extends scalax.collection.mutable.AdjacencyListGraph.This.NodeBase with scalax.collection.mutable.AdjacencyListGraph.This.InnerNode with scalax.collection.mutable.AdjacencyListGraph.This.InnerNode

    Permalink
    Definition Classes
    AdjacencyListGraph
  35. trait InnerNodeOps extends AnyRef

    Permalink
    Definition Classes
    EdgeOps
  36. trait InnerNodeState extends AnyRef

    Permalink
    Definition Classes
    State
  37. trait InnerNodeTraversalImpl extends (GraphTraversalImpl.this)#TraverserInnerNode with (GraphTraversalImpl.this)#InnerNodeState

    Permalink
    Definition Classes
    GraphTraversalImpl
  38. case class InnerNodeTraverser extends (GraphTraversalImpl.this)#InnerNodeTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#NodeT, (GraphTraversalImpl.this)#InnerNodeTraverser] with Product with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  39. case class Layer extends Product with Serializable

    Permalink
    Definition Classes
    GraphTraversal
  40. final class LayeredTopologicalOrder[+A] extends AbstractTopologicalOrder[A, (Int, Iterable[A])]

    Permalink
    Definition Classes
    GraphTraversal
  41. type Layers = Traversable[Layer]

    Permalink
    Definition Classes
    GraphTraversal
  42. abstract class LazyPath extends (GraphTraversalImpl.this)#Path

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  43. final class MapPathTraversable[T] extends Traversable[T]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  44. class MinWeightEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  45. class MultiEdgeLazyCycle extends (GraphTraversalImpl.this)#MultiEdgeLazyPath with (GraphTraversalImpl.this)#Cycle

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  46. class MultiEdgeLazyPath extends (GraphTraversalImpl.this)#LazyPath

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  47. trait Node extends Serializable

    Permalink
    Definition Classes
    GraphBase
  48. final class NodeBase extends scalax.collection.mutable.DefaultGraphImpl.InnerNodeImpl with scalax.collection.mutable.DefaultGraphImpl.InnerNodeTraversalImpl

    Permalink
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl
    Annotations
    @SerialVersionUID()
  49. type NodeFilter = (NodeT) ⇒ Boolean

    Permalink
    Definition Classes
    GraphBase
  50. sealed trait NodeOrdering extends Ordering[scalax.collection.GraphBase.NodeT] with ElemOrdering

    Permalink
    Definition Classes
    GraphBase
  51. class NodeSet extends scalax.collection.mutable.AdjacencyListGraph.This.NodeSet with scalax.collection.mutable.AdjacencyListGraph.This.NodeSet

    Permalink
    Definition Classes
    AdjacencyListGraph
    Annotations
    @SerialVersionUID()
  52. type NodeSetT = NodeSet

    Permalink
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphBase
  53. type NodeT = NodeBase

    Permalink
    Definition Classes
    DefaultGraphImpl → GraphTraversalImpl → AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphTraversal → GraphBase
  54. case class OuterEdgeTraverser extends (GraphTraversalImpl.this)#OuterEdgeTraverser with (GraphTraversalImpl.this)#Impl[E[N], (GraphTraversalImpl.this)#OuterEdgeTraverser] with Product with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  55. 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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  56. case class OuterNodeDownUpTraverser extends (GraphTraversalImpl.this)#OuterNodeDownUpTraverser with (GraphTraversalImpl.this)#DownUpTraverser[(Boolean, N), (GraphTraversalImpl.this)#OuterNodeDownUpTraverser] with Product with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  57. case class OuterNodeTraverser extends (GraphTraversalImpl.this)#OuterNodeTraverser with (GraphTraversalImpl.this)#Impl[N, (GraphTraversalImpl.this)#OuterNodeTraverser] with Product with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  58. trait Path extends Walk

    Permalink
    Definition Classes
    GraphTraversal
  59. class PathBuilder extends (GraphTraversalImpl.this)#WalkBuilder with (GraphTraversalImpl.this)#PathBuilder

    Permalink
    Definition Classes
    GraphTraversalImpl
  60. trait Properties extends SubgraphProperties

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  61. final class ReverseStackTraversable[S, T] extends Traversable[T]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  62. type Self = DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  63. abstract class SimpleLazyPath extends (GraphTraversalImpl.this)#LazyPath

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  64. trait SubgraphProperties extends AnyRef

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  65. type ThisGraph = RuleDependencyGraph.this.type

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  66. final class TopologicalOrder[+A] extends AbstractTopologicalOrder[A, A]

    Permalink
    Definition Classes
    GraphTraversal
  67. trait Traverser[A, +This <: Traverser[A, This]] extends TraverserMethods[A, This] with Properties with Traversable[A]

    Permalink
    Definition Classes
    GraphTraversal
  68. trait TraverserInnerNode extends scalax.collection.GraphTraversal.InnerNode

    Permalink
    Definition Classes
    GraphTraversal
  69. abstract class TraverserMethods[A, +This <: TraverserMethods[A, This]] extends FluentProperties[This]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  70. trait Walk extends Traversable[scalax.collection.GraphTraversal.InnerElem]

    Permalink
    Definition Classes
    GraphTraversal
  71. class WalkBuilder extends (GraphTraversalImpl.this)#WalkBuilder

    Permalink
    Definition Classes
    GraphTraversalImpl
  72. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def &(that: GenSet[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    GenSetLike
  4. def &=(coll: Iterable[Param[Rule, LDiEdge]]): RuleDependencyGraph.this.type

    Permalink
    Definition Classes
    GraphLike
  5. def &~(that: GenSet[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    GenSetLike
  6. def +(node: Rule): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    GraphLike → GraphLike
  7. def +(elem: Param[Rule, LDiEdge]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    GraphLike → SetLike → GenSetLike
  8. def +(elem1: Param[Rule, LDiEdge], elem2: Param[Rule, LDiEdge], elems: Param[Rule, LDiEdge]*): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    SetLike
  9. final def +#(edge: LDiEdge[Rule]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  10. def ++(elems: GenTraversableOnce[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    GraphLike → SetLike
  11. def ++[B >: Param[Rule, LDiEdge], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  12. def ++:[B >: Param[Rule, LDiEdge], That](that: Traversable[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  13. def ++:[B >: Param[Rule, LDiEdge], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  14. def ++=(xs: TraversableOnce[Param[Rule, LDiEdge]]): RuleDependencyGraph.this.type

    Permalink
    Definition Classes
    GraphLike → Growable
  15. def +=(elem: Param[Rule, LDiEdge]): RuleDependencyGraph.this.type

    Permalink
    Definition Classes
    GraphLike → Growable
  16. final def +=(node: Rule): RuleDependencyGraph.this.type

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  17. def +=(elem1: Param[Rule, LDiEdge], elem2: Param[Rule, LDiEdge], elems: Param[Rule, LDiEdge]*): RuleDependencyGraph.this.type

    Permalink
    Definition Classes
    Growable
  18. final def +=#(edge: LDiEdge[Rule]): RuleDependencyGraph.this.type

    Permalink
    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: Long, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): RuleDependencyGraph.this.type

    Permalink
    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: Long, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): RuleDependencyGraph.this.type

    Permalink
    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: Long)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): RuleDependencyGraph.this.type

    Permalink
    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: Long)(implicit edgeFactory: WEdgeCompanion[EE]): RuleDependencyGraph.this.type

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  26. final def +~=(node_1: Rule, node_2: Rule)(implicit edgeFactory: EdgeCompanion[LDiEdge]): RuleDependencyGraph.this.type

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  27. final def -(edge: LDiEdge[Rule]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  28. final def -(node: Rule): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  29. def -(elem: Param[Rule, LDiEdge]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    GraphLike → SetLike → Subtractable → GenSetLike
  30. def -(elem1: Param[Rule, LDiEdge], elem2: Param[Rule, LDiEdge], elems: Param[Rule, LDiEdge]*): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    Subtractable
  31. final def -!(edge: LDiEdge[Rule]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  32. def -!(elem: Param[Rule, LDiEdge]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    GraphLike
  33. final def -!#(edge: LDiEdge[Rule]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  34. def -!=(elem: Param[Rule, LDiEdge]): RuleDependencyGraph.this.type

    Permalink
    Definition Classes
    GraphLike
  35. final def -!=#(edge: LDiEdge[Rule]): RuleDependencyGraph.this.type

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
    Annotations
    @inline()
  36. final def -#(edge: LDiEdge[Rule]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  37. def --(elems: GenTraversableOnce[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    GraphLike → Subtractable
  38. def --!(elems: GenTraversableOnce[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    GraphLike
  39. final def --!=(coll: Iterable[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  40. def --=(xs: TraversableOnce[Param[Rule, LDiEdge]]): RuleDependencyGraph.this.type

    Permalink
    Definition Classes
    Shrinkable
  41. def -=(elem: Param[Rule, LDiEdge]): RuleDependencyGraph.this.type

    Permalink
    Definition Classes
    GraphLike → Shrinkable
  42. final def -=(node: Rule): RuleDependencyGraph.this.type

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  43. def -=(elem1: Param[Rule, LDiEdge], elem2: Param[Rule, LDiEdge], elems: Param[Rule, LDiEdge]*): RuleDependencyGraph.this.type

    Permalink
    Definition Classes
    Shrinkable
  44. final def -=#(edge: LDiEdge[Rule]): RuleDependencyGraph.this.type

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
    Annotations
    @inline()
  45. final def -?(node: Rule): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  46. final def -?=(node: Rule): RuleDependencyGraph.this.type

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  47. def /:[B](z: B)(op: (B, Param[Rule, LDiEdge]) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  48. def :\[B](z: B)(op: (Param[Rule, LDiEdge], B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  49. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  50. object Edge extends Serializable

    Permalink
    Definition Classes
    GraphBase
  51. object InnerEdge extends Serializable

    Permalink
    Definition Classes
    GraphBase
  52. object InnerNode extends Serializable

    Permalink
    Definition Classes
    GraphBase
  53. object Node extends Serializable

    Permalink
    Definition Classes
    GraphBase
  54. object TraverserInnerNode extends Serializable

    Permalink
    Definition Classes
    GraphTraversal
  55. final def add(edge: LDiEdge[Rule]): Boolean

    Permalink
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  56. final def add(node: Rule): Boolean

    Permalink
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  57. final def addAndGet(edge: LDiEdge[Rule]): EdgeT

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  58. final def addAndGet(node: Rule): NodeT

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  59. def addAndGetEdge(node_1: Rule, node_2: Rule, nodes: Rule*)(implicit edgeFactory: HyperEdgeCompanion[LDiEdge], endpointsKind: CollectionKind): EdgeT

    Permalink
    Definition Classes
    EdgeOps
  60. final def addAndGetEdge(node_1: Rule, node_2: Rule)(implicit edgeFactory: EdgeCompanion[LDiEdge]): EdgeT

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  61. 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

    Permalink
    Definition Classes
    EdgeOps
  62. 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

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  63. def addAndGetWEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: Rule, node_2: Rule, nodes: Rule*)(weight: Long)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): EdgeT

    Permalink
    Definition Classes
    EdgeOps
  64. final def addAndGetWEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: Rule, node_2: Rule)(weight: Long)(implicit edgeFactory: WEdgeCompanion[EE]): EdgeT

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  65. def addAndGetWLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: Rule, node_2: Rule, nodes: Rule*)(weight: Long, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): EdgeT

    Permalink
    Definition Classes
    EdgeOps
  66. final def addAndGetWLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: Rule, node_2: Rule)(weight: Long, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): EdgeT

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  67. final def addEdge(node_1: Rule, node_2: Rule, nodes: Rule*)(implicit edgeFactory: HyperEdgeCompanion[LDiEdge], endpointsKind: CollectionKind): Boolean

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  68. final def addEdge(node_1: Rule, node_2: Rule)(implicit edgeFactory: EdgeCompanion[LDiEdge]): Boolean

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  69. 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

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  70. 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

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  71. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  72. def addString(b: StringBuilder, sep: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  73. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  74. final def addWEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: Rule, node_2: Rule, nodes: Rule*)(weight: Long)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): Boolean

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  75. final def addWEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: Rule, node_2: Rule)(weight: Long)(implicit edgeFactory: WEdgeCompanion[EE]): Boolean

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  76. final def addWLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: Rule, node_2: Rule, nodes: Rule*)(weight: Long, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): Boolean

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  77. final def addWLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: Rule, node_2: Rule)(weight: Long, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): Boolean

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  78. def aggregate[B](z: ⇒ B)(seqop: (B, Param[Rule, LDiEdge]) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  79. final def alteredClone(delNodes: Iterable[NodeT], delEdges: Iterable[EdgeT], ripple: Boolean, addNodes: Iterable[Rule], addEdges: Iterable[LDiEdge[Rule]]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl
  80. def andThen[A](g: (Boolean) ⇒ A): (Param[Rule, LDiEdge]) ⇒ A

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  81. final val anyEdge: EdgeFilter

    Permalink
    Definition Classes
    GraphBase
  82. final def anyEdgeSelector(from: NodeT, to: NodeT): Option[EdgeT]

    Permalink
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  83. final val anyNode: NodeFilter

    Permalink
    Definition Classes
    GraphBase
  84. final lazy val anyOrdering: AnyOrdering[Rule]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphBase
  85. def apply(elem: Param[Rule, LDiEdge]): Boolean

    Permalink
    Definition Classes
    GenSetLike → Function1
  86. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  87. def asSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String

    Permalink
    Definition Classes
    GraphLike
  88. final def bulkOp(elems: GenTraversableOnce[Param[Rule, LDiEdge]], isPlusPlus: Boolean): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  89. def canEqual(that: Any): Boolean

    Permalink
    Definition Classes
    IterableLike → Equals
  90. final def clear(): Unit

    Permalink
    Definition Classes
    AdjacencyListGraph → Growable → Clearable
    Annotations
    @inline()
  91. def clearNodeStates(flags: FlagWord, flagsExt: ExtBitSet): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    State
  92. final def clone(): RuleDependencyGraph.this.type

    Permalink
    Definition Classes
    DefaultGraphImpl → GraphLike → Cloneable → AnyRef
    Annotations
    @inline()
  93. def collect[B, That](pf: PartialFunction[Param[Rule, LDiEdge], B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  94. def collectFirst[B](pf: PartialFunction[Param[Rule, LDiEdge], B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce
  95. def companion: GenericCompanion[Set]

    Permalink
    Definition Classes
    Set → GenSet → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  96. def componentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering): ComponentTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  97. def compose[A](g: (A) ⇒ Param[Rule, LDiEdge]): (A) ⇒ Boolean

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  98. implicit val config: scalax.collection.mutable.DefaultGraphImpl.Config with AdjacencyListArrayConfig

    Permalink
    Definition Classes
    DefaultGraphImpl → GraphLike
  99. def contains(elem: Param[Rule, LDiEdge]): Boolean

    Permalink
    Definition Classes
    GraphLike → SetLike → GenSetLike
  100. def copyToArray[B >: Param[Rule, LDiEdge]](xs: Array[B], start: Int, len: Int): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  101. def copyToArray[B >: Param[Rule, LDiEdge]](xs: Array[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def copyToArray[B >: Param[Rule, LDiEdge]](xs: Array[B], start: Int): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def copyToBuffer[B >: Param[Rule, LDiEdge]](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce
  104. def count(p: (Param[Rule, LDiEdge]) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. final def cycle(results: (Option[NodeT], ArrayStack[CycleStackElem]), edgeFilter: EdgeFilter): Option[Cycle]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  106. final lazy val defaultEdgeOrdering: EdgeOrdering

    Permalink
    Definition Classes
    GraphBase
  107. final lazy val defaultNodeOrdering: NodeOrdering

    Permalink
    Definition Classes
    GraphBase
  108. final def defaultPathSize: Int

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  109. def degreeCount(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, Int]

    Permalink
    Definition Classes
    GraphDegree
  110. def degreeNodeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[DegreeNodeSeqEntry]

    Permalink
    Definition Classes
    GraphDegree
  111. def degreeNodesMap(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, AnySet[NodeT]]

    Permalink
    Definition Classes
    GraphDegree
  112. def degreeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[Int]

    Permalink
    Definition Classes
    GraphDegree
  113. def degreeSet(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedSet[Int]

    Permalink
    Definition Classes
    GraphDegree
  114. def diff(that: GenSet[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    SetLike → GenSetLike
  115. def drop(n: Int): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  116. def dropRight(n: Int): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    IterableLike
  117. def dropWhile(p: (Param[Rule, LDiEdge]) ⇒ Boolean): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  118. def dump(store: FlagStore): ExtBitSet

    Permalink
    Attributes
    protected
    Definition Classes
    State
  119. def dumpDirty: ExtBitSet

    Permalink
    Definition Classes
    State
  120. def dumpInUse: ExtBitSet

    Permalink
    Definition Classes
    State
  121. def edgeIterator: GroupIterator[EdgeT] { ... /* 2 definitions in type refinement */ }

    Permalink
    Definition Classes
    AdjacencyListBase
  122. implicit val edgeT: ClassTag[LDiEdge[Rule]]

    Permalink
    Definition Classes
    DefaultGraphImpl → GraphLike
  123. implicit final def edgeToEdgeCont(e: LDiEdge[Rule]): LDiEdge[NodeT]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphBase
    Annotations
    @inline()
  124. final val edges: EdgeSet

    Permalink
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → GraphBase
  125. final def empty: DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    DefaultGraphImpl → Graph → Graph → SetLike → GenericSetTemplate
    Annotations
    @inline()
  126. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  127. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    GraphLike → GenSetLike → Equals → AnyRef → Any
  128. def exists(p: (Param[Rule, LDiEdge]) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  129. final def expectedMaxNodes(divisor: Int, min: Int): Int

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  130. def filter(p: (Param[Rule, LDiEdge]) ⇒ Boolean): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  131. def filterNot(p: (Param[Rule, LDiEdge]) ⇒ Boolean): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  132. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  133. final def find(outerEdge: LDiEdge[Rule]): Option[EdgeT]

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  134. final def find(outerNode: Rule): Option[NodeT]

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  135. def find(p: (Param[Rule, LDiEdge]) ⇒ Boolean): Option[Param[Rule, LDiEdge]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  136. final def findCycle[U](implicit visitor: (InnerElem) ⇒ U): Option[Cycle]

    Permalink
    Definition Classes
    GraphTraversal
  137. def flatMap[B, That](f: (Param[Rule, LDiEdge]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  138. def flatten[B](implicit asTraversable: (Param[Rule, LDiEdge]) ⇒ GenTraversableOnce[B]): Set[B]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  139. def fold[A1 >: Param[Rule, LDiEdge]](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  140. def foldLeft[B](z: B)(op: (B, Param[Rule, LDiEdge]) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  141. def foldRight[B](z: B)(op: (Param[Rule, LDiEdge], B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  142. final def forInDegrees(traversable: Traversable[NodeT] with SubgraphProperties, maybeHandle: Option[Handle], includeAnyway: Option[NodeT], includeInDegree: NodeFilter, fillInDegrees: Boolean): (Buffer[NodeT], Map[NodeT, Int])

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  143. def forall(p: (Param[Rule, LDiEdge]) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  144. def foreach[U](f: (Param[Rule, LDiEdge]) ⇒ U): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  145. final def from(that: AdjacencyListBase[Rule, LDiEdge, DefaultGraphImpl])(delNodes: Iterable[scalax.collection.immutable.AdjacencyListBase.NodeT], delEdges: Iterable[scalax.collection.immutable.AdjacencyListBase.EdgeT], ripple: Boolean, addNodes: Iterable[Rule], addEdges: Iterable[LDiEdge[Rule]]): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
    Annotations
    @inline()
  146. def genericBuilder[B]: Builder[B, Set[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  147. final def get(outerEdge: LDiEdge[Rule]): EdgeT

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  148. final def get(outerNode: Rule): NodeT

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  149. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  150. final def getOrElse(outerEdge: LDiEdge[Rule], default: EdgeT): EdgeT

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  151. final def getOrElse(outerNode: Rule, default: NodeT): NodeT

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  152. final val graphCompanion: DefaultGraphImpl.type

    Permalink
    Definition Classes
    DefaultGraphImpl → GraphLike
  153. def graphSize: Int

    Permalink
    Definition Classes
    GraphBase
  154. def groupBy[K](f: (Param[Rule, LDiEdge]) ⇒ K): Map[K, DefaultGraphImpl[Rule, LDiEdge]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  155. def grouped(size: Int): Iterator[DefaultGraphImpl[Rule, LDiEdge]]

    Permalink
    Definition Classes
    IterableLike
  156. def hasCycle(): Boolean

    Permalink

    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.

  157. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  158. def hashCode(): Int

    Permalink
    Definition Classes
    GenSetLike → AnyRef → Any
  159. def having(node: NodeFilter, edge: EdgeFilter): PartialFunction[Param[Rule, LDiEdge], Boolean]

    Permalink
    Definition Classes
    GraphLike
  160. def head: Param[Rule, LDiEdge]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  161. def headOption: Option[Param[Rule, LDiEdge]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  162. def init: DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  163. def initialize(nodes: Iterable[Rule], edges: Iterable[LDiEdge[Rule]]): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    GraphBase
  164. def inits: Iterator[DefaultGraphImpl[Rule, LDiEdge]]

    Permalink
    Definition Classes
    TraversableLike
  165. def innerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering): InnerEdgeTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  166. def innerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering): InnerElemTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  167. def innerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering): InnerNodeDownUpTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  168. def innerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering): InnerNodeTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  169. def intersect(that: GenSet[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    GenSetLike
  170. final def isAcyclic: Boolean

    Permalink
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  171. def isComplete: Boolean

    Permalink
    Definition Classes
    GraphTraversal
  172. def isConnected: Boolean

    Permalink
    Definition Classes
    GraphTraversal
  173. final def isCustomEdgeFilter(f: EdgeFilter): Boolean

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @inline()
  174. final def isCustomNodeFilter(f: NodeFilter): Boolean

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @inline()
  175. final def isCyclic: Boolean

    Permalink
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  176. lazy val isDirected: Boolean

    Permalink
    Definition Classes
    GraphLike → GraphBase
  177. def isEmpty: Boolean

    Permalink
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  178. lazy val isHyper: Boolean

    Permalink
    Definition Classes
    GraphLike → GraphBase
  179. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  180. lazy val isMulti: Boolean

    Permalink
    Definition Classes
    GraphLike → GraphBase
  181. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  182. final def isTrivial: Boolean

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @inline()
  183. def iterator: Iterator[OutParam[Rule, LDiEdge] with Serializable with InnerElem]

    Permalink
    Definition Classes
    GraphLike → GenSetLike → IterableLike → GenIterableLike
  184. def last: Param[Rule, LDiEdge]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  185. def lastOption: Option[Param[Rule, LDiEdge]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  186. def layers(): Traversable[(Int, Iterable[Rule])]

    Permalink

    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

  187. def loopNodes(): Set[NodeBase]

    Permalink

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

  188. def map[B, That](f: (Param[Rule, LDiEdge]) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That

    Permalink
    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.

  189. def max[B >: Param[Rule, LDiEdge]](implicit cmp: Ordering[B]): Param[Rule, LDiEdge]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  190. def maxBy[B](f: (Param[Rule, LDiEdge]) ⇒ B)(implicit cmp: Ordering[B]): Param[Rule, LDiEdge]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  191. def maxDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GraphDegree
  192. def min[B >: Param[Rule, LDiEdge]](implicit cmp: Ordering[B]): Param[Rule, LDiEdge]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  193. def minBy[B](f: (Param[Rule, LDiEdge]) ⇒ B)(implicit cmp: Ordering[B]): Param[Rule, LDiEdge]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  194. def minDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GraphDegree
  195. def minusMinus(delNodes: Iterable[Rule], delEdges: Iterable[LDiEdge[Rule]]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  196. def minusMinusNodesEdges(delNodes: Iterable[Rule], delEdges: Iterable[LDiEdge[Rule]]): (Set[Rule], Set[LDiEdge[Rule]])

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  197. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  198. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  199. def mkString(start: String, sep: String, end: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  200. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  201. def newBuilder: GraphBuilder[Rule, LDiEdge, DefaultGraphImpl]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    DefaultGraphImpl → SetLike → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  202. final def newEdge(innerEdge: LDiEdge[NodeT]): EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  203. final def newEdgeTArray(size: Int): Array[EdgeT]

    Permalink
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase
    Annotations
    @inline()
  204. final def newNode(n: Rule): NodeT

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListBase → GraphBase
    Annotations
    @inline()
  205. final def newNodeSet: NodeSetT

    Permalink
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase
    Annotations
    @inline()
  206. final def newNodeWithHints(n: Rule, h: Hints): NodeBase

    Permalink
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase
    Annotations
    @inline()
  207. def newPathBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): PathBuilder

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  208. def newWalkBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): WalkBuilder

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  209. def nextHandle: Handle

    Permalink
    Attributes
    protected
    Definition Classes
    State
  210. final val noNode: NodeFilter

    Permalink
    Definition Classes
    GraphBase
  211. final val nodes: NodeSetT

    Permalink
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → GraphBase
  212. 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]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  213. 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]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  214. final def nodesToEdge(edgeFactory: HyperEdgeCompanion[LDiEdge], node_1: Rule, node_2: Rule, nodes: Rule*)(implicit endpointsKind: CollectionKind): EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  215. final def nodesToEdge(edgeFactory: EdgeCompanion[LDiEdge], node_1: Rule, node_2: Rule): EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  216. def nodesToEdgeCont(factory: EdgeCompanion[LDiEdge], node_1: Rule, node_2: Rule): LDiEdge[NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  217. def nodesToEdgeCont(factory: HyperEdgeCompanion[LDiEdge], node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): LDiEdge[NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  218. 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

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  219. 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

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  220. 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]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  221. 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]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  222. final def nodesToWEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](edgeFactory: WHyperEdgeCompanion[EE], weight: Long, node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  223. final def nodesToWEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](edgeFactory: WEdgeCompanion[EE], weight: Long, node_1: Rule, node_2: Rule): EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  224. def nodesToWEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](factory: WEdgeCompanion[EE], weight: Long, node_1: Rule, node_2: Rule): LDiEdge[NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  225. def nodesToWEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](factory: WHyperEdgeCompanion[EE], weight: Long, node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): LDiEdge[NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  226. final def nodesToWLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](edgeFactory: WLHyperEdgeCompanion[EE], weight: Long, label: L, node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  227. final def nodesToWLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](edgeFactory: WLEdgeCompanion[EE], weight: Long, label: L, node_1: Rule, node_2: Rule): EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  228. def nodesToWLEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](factory: WLEdgeCompanion[EE], weight: Long, label: L, node_1: Rule, node_2: Rule): LDiEdge[NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  229. def nodesToWLEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](factory: WLHyperEdgeCompanion[EE], weight: Long, label: L, node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): LDiEdge[NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  230. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  231. final def nonTrivial: Boolean

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @inline()
  232. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  234. def order: Int

    Permalink
    Definition Classes
    GraphBase
  235. def outerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering): OuterEdgeTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  236. def outerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering): OuterElemTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  237. def outerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering): OuterNodeDownUpTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  238. def outerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering): OuterNodeTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  239. def par: ParSet[Param[Rule, LDiEdge]]

    Permalink
    Definition Classes
    Parallelizable
  240. def parCombiner: Combiner[Param[Rule, LDiEdge], ParSet[Param[Rule, LDiEdge]]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → Parallelizable
  241. final def partition(elems: GenTraversableOnce[Param[Rule, LDiEdge]]): Partitions[Rule, LDiEdge]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  242. def partition(p: (Param[Rule, LDiEdge]) ⇒ Boolean): (DefaultGraphImpl[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  243. def plusPlus(newNodes: Iterable[Rule], newEdges: Iterable[LDiEdge[Rule]]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  244. def printNodes(): String

    Permalink

    returns

    a simple string representation of this graph

  245. def product[B >: Param[Rule, LDiEdge]](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  246. def reduce[A1 >: Param[Rule, LDiEdge]](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  247. def reduceLeft[B >: Param[Rule, LDiEdge]](op: (B, Param[Rule, LDiEdge]) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce
  248. def reduceLeftOption[B >: Param[Rule, LDiEdge]](op: (B, Param[Rule, LDiEdge]) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  249. def reduceOption[A1 >: Param[Rule, LDiEdge]](op: (A1, A1) ⇒ A1): Option[A1]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  250. def reduceRight[B >: Param[Rule, LDiEdge]](op: (Param[Rule, LDiEdge], B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  251. def reduceRightOption[B >: Param[Rule, LDiEdge]](op: (Param[Rule, LDiEdge], B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  252. def releaseHandle(handle: Handle): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    State
  253. final def remove(edge: LDiEdge[Rule]): Boolean

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  254. final def remove(node: Rule): Boolean

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  255. final def removeGently(node: Rule): Boolean

    Permalink
    Definition Classes
    GraphLike
  256. final def removeWithNodes(edge: LDiEdge[Rule]): Boolean

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  257. def repr: DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  258. def reversed: List[Param[Rule, LDiEdge]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  259. def rules(): Set[Rule]

    Permalink

    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

  260. def sameElements[B >: Param[Rule, LDiEdge]](that: GenIterable[B]): Boolean

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  261. def scan[B >: Param[Rule, LDiEdge], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  262. def scanLeft[B, That](z: B)(op: (B, Param[Rule, LDiEdge]) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  263. def scanRight[B, That](z: B)(op: (Param[Rule, LDiEdge], B) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That

    Permalink
    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.

  264. def seq: Set[Param[Rule, LDiEdge]]

    Permalink
    Definition Classes
    Set → GenSet → GenSetLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  265. def size: Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  266. def slice(from: Int, until: Int): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  267. def sliding(size: Int, step: Int): Iterator[DefaultGraphImpl[Rule, LDiEdge]]

    Permalink
    Definition Classes
    IterableLike
  268. def sliding(size: Int): Iterator[DefaultGraphImpl[Rule, LDiEdge]]

    Permalink
    Definition Classes
    IterableLike
  269. def span(p: (Param[Rule, LDiEdge]) ⇒ Boolean): (DefaultGraphImpl[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  270. def splitAt(n: Int): (DefaultGraphImpl[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  271. def stringPrefix: String

    Permalink
    Definition Classes
    GraphLike → SetLike → TraversableLike → GenTraversableLike
  272. def subsetOf(that: GenSet[Param[Rule, LDiEdge]]): Boolean

    Permalink
    Definition Classes
    GenSetLike
  273. def subsets(): Iterator[DefaultGraphImpl[Rule, LDiEdge]]

    Permalink
    Definition Classes
    SetLike
  274. def subsets(len: Int): Iterator[DefaultGraphImpl[Rule, LDiEdge]]

    Permalink
    Definition Classes
    SetLike
  275. def sum[B >: Param[Rule, LDiEdge]](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  276. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  277. def tail: DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  278. def tails: Iterator[DefaultGraphImpl[Rule, LDiEdge]]

    Permalink
    Definition Classes
    TraversableLike
  279. def take(n: Int): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  280. def takeRight(n: Int): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    IterableLike
  281. def takeWhile(p: (Param[Rule, LDiEdge]) ⇒ Boolean): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  282. def thisCollection: Iterable[Param[Rule, LDiEdge]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  283. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Param[Rule, LDiEdge], Col[Param[Rule, LDiEdge]]]): Col[Param[Rule, LDiEdge]]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  284. def toArray[B >: Param[Rule, LDiEdge]](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  285. def toBuffer[A1 >: Param[Rule, LDiEdge]]: Buffer[A1]

    Permalink
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  286. def toCollection(repr: DefaultGraphImpl[Rule, LDiEdge]): Iterable[Param[Rule, LDiEdge]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  287. def toIndexedSeq: IndexedSeq[Param[Rule, LDiEdge]]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  288. def toIterable: Iterable[Param[Rule, LDiEdge]]

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  289. def toIterator: Iterator[Param[Rule, LDiEdge]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  290. def toList: List[Param[Rule, LDiEdge]]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  291. def toMap[T, U](implicit ev: <:<[Param[Rule, LDiEdge], (T, U)]): Map[T, U]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  292. def toSeq: Seq[Param[Rule, LDiEdge]]

    Permalink
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  293. def toSet[B >: Param[Rule, LDiEdge]]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  294. def toSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String

    Permalink
    Definition Classes
    GraphLike
  295. def toStream: Stream[Param[Rule, LDiEdge]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  296. def toString(): String

    Permalink
    Definition Classes
    GraphLike → SetLike → Function1 → TraversableLike → AnyRef → Any
  297. def toTraversable: Traversable[Param[Rule, LDiEdge]]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  298. def toVector: Vector[Param[Rule, LDiEdge]]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  299. final def topologicalSort[U](implicit visitor: (InnerElem) ⇒ U): CycleNodeOrTopologicalOrder

    Permalink
    Definition Classes
    GraphTraversal
  300. final def topologicalSortByComponent[U](implicit visitor: (InnerElem) ⇒ U): Traversable[CycleNodeOrTopologicalOrder]

    Permalink
    Definition Classes
    GraphTraversal
  301. def totalDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GraphDegree
  302. def totalWeight: Long

    Permalink
    Definition Classes
    GraphBase
  303. def transpose[B](implicit asTraversable: (Param[Rule, LDiEdge]) ⇒ GenTraversableOnce[B]): Set[Set[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  304. def union(that: GenSet[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    SetLike → GenSetLike
  305. def unzip[A1, A2](implicit asPair: (Param[Rule, LDiEdge]) ⇒ (A1, A2)): (Set[A1], Set[A2])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  306. def unzip3[A1, A2, A3](implicit asTriple: (Param[Rule, LDiEdge]) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  307. final def upsert(edge: LDiEdge[Rule]): Boolean

    Permalink
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  308. def view(from: Int, until: Int): IterableView[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike
  309. def view: IterableView[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike
  310. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  313. def withFilter(p: (Param[Rule, LDiEdge]) ⇒ Boolean): FilterMonadic[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]]

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic
  314. def withHandle[T](reuse: Option[Handle])(block: (Handle) ⇒ T): T

    Permalink
    Attributes
    protected
    Definition Classes
    State
  315. def withHandles[T](nr: Int, reuse: Array[Handle])(block: (Array[Handle]) ⇒ T): T

    Permalink
    Attributes
    protected
    Definition Classes
    State
  316. def zip[A1 >: Param[Rule, LDiEdge], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  317. 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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  318. def zipWithIndex[A1 >: Param[Rule, LDiEdge], That](implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], (A1, Int), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  319. def |(that: GenSet[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]

    Permalink
    Definition Classes
    GenSetLike

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