Class

net.sansa_stack.inference.rules

HighLevelRuleDependencyGraph

Related Doc: package rules

Permalink

class HighLevelRuleDependencyGraph extends DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

Given a rule dependency graph (RDG), a high-level rule dependency graph (HLRDG) is a directed acyclic 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 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.

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

Instance Constructors

  1. new HighLevelRuleDependencyGraph(iniNodes: Iterable[Graph[Rule, LDiEdge]] = Set[Graph[Rule, LDiEdge]](), iniEdges: Iterable[DiEdge[Graph[Rule, LDiEdge]]] = Set[DiEdge[Graph[Rule, LDiEdge]]]())

    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. sealed trait EdgeOrdering extends Ordering[scalax.collection.GraphBase.EdgeT] with ElemOrdering

    Permalink
    Definition Classes
    GraphBase

  19. class EdgeSet extends scalax.collection.immutable.AdjacencyListGraph.This.EdgeSet

    Permalink
    Definition Classes
    AdjacencyListGraph
    Annotations
    @SerialVersionUID()

  20. type EdgeSetT = EdgeSet

    Permalink
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphBase

  21. type EdgeT = EdgeBase

    Permalink
    Definition Classes
    AdjacencyListGraph → GraphBase

  22. sealed trait ElemOrdering extends AnyRef

    Permalink
    Attributes
    protected
    Definition Classes
    GraphBase

  23. trait ExtendedNodeVisitor[U] extends (scalax.collection.GraphTraversal.NodeT) ⇒ U with (scalax.collection.GraphTraversal.NodeT, Int, Int, ⇒ NodeInformer) ⇒ U

    Permalink
    Definition Classes
    GraphTraversal

  24. trait Filter[T] extends (T) ⇒ Boolean

    Permalink
    Definition Classes
    GraphDegree

  25. abstract class FluentProperties[+This <: FluentProperties[This]] extends AnyRef

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal

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

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

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

  29. sealed trait InnerElem extends AnyRef

    Permalink
    Definition Classes
    GraphBase

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

  31. trait InnerNode extends (AdjacencyListBase.this)#InnerNode

    Permalink
    Definition Classes
    AdjacencyListBase

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

  33. abstract class InnerNodeImpl extends scalax.collection.immutable.AdjacencyListGraph.This.NodeBase with scalax.collection.immutable.AdjacencyListGraph.This.InnerNode

    Permalink
    Definition Classes
    AdjacencyListGraph

  34. trait InnerNodeState extends AnyRef

    Permalink
    Definition Classes
    State

  35. trait InnerNodeTraversalImpl extends (GraphTraversalImpl.this)#TraverserInnerNode with (GraphTraversalImpl.this)#InnerNodeState

    Permalink
    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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl

  37. case class Layer extends Product with Serializable

    Permalink
    Definition Classes
    GraphTraversal

  38. final class LayeredTopologicalOrder[+A] extends AbstractTopologicalOrder[A, (Int, Iterable[A])]

    Permalink
    Definition Classes
    GraphTraversal

  39. type Layers = Traversable[Layer]

    Permalink
    Definition Classes
    GraphTraversal

  40. abstract class LazyPath extends (GraphTraversalImpl.this)#Path

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl

  41. final class MapPathTraversable[T] extends Traversable[T]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl

  42. class MinWeightEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl

  43. class MultiEdgeLazyCycle extends (GraphTraversalImpl.this)#MultiEdgeLazyPath with (GraphTraversalImpl.this)#Cycle

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl

  44. class MultiEdgeLazyPath extends (GraphTraversalImpl.this)#LazyPath

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl

  45. trait Node extends Serializable

    Permalink
    Definition Classes
    GraphBase

  46. final class NodeBase extends scalax.collection.immutable.DefaultGraphImpl.InnerNodeImpl with scalax.collection.immutable.DefaultGraphImpl.InnerNodeTraversalImpl

    Permalink
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl
    Annotations
    @SerialVersionUID()

  47. type NodeFilter = (NodeT) ⇒ Boolean

    Permalink
    Definition Classes
    GraphBase

  48. sealed trait NodeOrdering extends Ordering[scalax.collection.GraphBase.NodeT] with ElemOrdering

    Permalink
    Definition Classes
    GraphBase

  49. class NodeSet extends scalax.collection.immutable.AdjacencyListGraph.This.NodeSet

    Permalink
    Definition Classes
    AdjacencyListGraph
    Annotations
    @SerialVersionUID()

  50. type NodeSetT = NodeSet

    Permalink
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphBase

  51. type NodeT = NodeBase

    Permalink
    Definition Classes
    DefaultGraphImpl → GraphTraversalImpl → AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphTraversal → GraphBase

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

  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

    Permalink
    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

    Permalink
    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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl

  56. trait Path extends Walk

    Permalink
    Definition Classes
    GraphTraversal

  57. class PathBuilder extends (GraphTraversalImpl.this)#WalkBuilder with (GraphTraversalImpl.this)#PathBuilder

    Permalink
    Definition Classes
    GraphTraversalImpl

  58. trait Properties extends SubgraphProperties

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal

  59. final class ReverseStackTraversable[S, T] extends Traversable[T]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl

  60. type Self = DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  61. abstract class SimpleLazyPath extends (GraphTraversalImpl.this)#LazyPath

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl

  62. trait SubgraphProperties extends AnyRef

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal

  63. type ThisGraph = HighLevelRuleDependencyGraph.this.type

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike

  64. final class TopologicalOrder[+A] extends AbstractTopologicalOrder[A, A]

    Permalink
    Definition Classes
    GraphTraversal

  65. trait Traverser[A, +This <: Traverser[A, This]] extends TraverserMethods[A, This] with Properties with Traversable[A]

    Permalink
    Definition Classes
    GraphTraversal

  66. trait TraverserInnerNode extends scalax.collection.GraphTraversal.InnerNode

    Permalink
    Definition Classes
    GraphTraversal

  67. abstract class TraverserMethods[A, +This <: TraverserMethods[A, This]] extends FluentProperties[This]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal

  68. trait Walk extends Traversable[scalax.collection.GraphTraversal.InnerElem]

    Permalink
    Definition Classes
    GraphTraversal

  69. class WalkBuilder extends (GraphTraversalImpl.this)#WalkBuilder

    Permalink
    Definition Classes
    GraphTraversalImpl

  70. 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[Graph[Rule, LDiEdge], DiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    GenSetLike

  4. def &~(that: GenSet[Param[Graph[Rule, LDiEdge], DiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    GenSetLike

  5. def +(n: Graph[Rule, LDiEdge]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    AdjacencyListGraph → GraphLike

  6. def +(elem: Param[Graph[Rule, LDiEdge], DiEdge]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    GraphLike → SetLike → GenSetLike

  7. def +(elem1: Param[Graph[Rule, LDiEdge], DiEdge], elem2: Param[Graph[Rule, LDiEdge], DiEdge], elems: Param[Graph[Rule, LDiEdge], DiEdge]*): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    SetLike

  8. def +#(e: DiEdge[Graph[Rule, LDiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphLike

  9. def ++(elems: GenTraversableOnce[Param[Graph[Rule, LDiEdge], DiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    GraphLike → SetLike

  10. def ++[B >: Param[Graph[Rule, LDiEdge], DiEdge], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  11. def ++:[B >: Param[Graph[Rule, LDiEdge], DiEdge], That](that: Traversable[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], B, That]): That

    Permalink
    Definition Classes
    TraversableLike

  12. def ++:[B >: Param[Graph[Rule, LDiEdge], DiEdge], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], B, That]): That

    Permalink
    Definition Classes
    TraversableLike

  13. def -(n: Graph[Rule, LDiEdge]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    AdjacencyListGraph → GraphLike

  14. def -(elem: Param[Graph[Rule, LDiEdge], DiEdge]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    GraphLike → SetLike → Subtractable → GenSetLike

  15. def -(elem1: Param[Graph[Rule, LDiEdge], DiEdge], elem2: Param[Graph[Rule, LDiEdge], DiEdge], elems: Param[Graph[Rule, LDiEdge], DiEdge]*): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    Subtractable

  16. def -!(elem: Param[Graph[Rule, LDiEdge], DiEdge]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    GraphLike

  17. def -!#(e: DiEdge[Graph[Rule, LDiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphLike

  18. def -#(e: DiEdge[Graph[Rule, LDiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphLike

  19. def --(elems: GenTraversableOnce[Param[Graph[Rule, LDiEdge], DiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    GraphLike → Subtractable

  20. def --!(elems: GenTraversableOnce[Param[Graph[Rule, LDiEdge], DiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    GraphLike

  21. def -?(n: Graph[Rule, LDiEdge]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    AdjacencyListGraph → GraphLike

  22. def /:[B](z: B)(op: (B, Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  23. def :\[B](z: B)(op: (Param[Graph[Rule, LDiEdge], DiEdge], B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    AnyRef → Any

  25. object Edge extends Serializable

    Permalink
    Definition Classes
    GraphBase

  26. object InnerEdge extends Serializable

    Permalink
    Definition Classes
    GraphBase

  27. object InnerNode extends Serializable

    Permalink
    Definition Classes
    GraphBase

  28. object Node extends Serializable

    Permalink
    Definition Classes
    GraphBase

  29. object TraverserInnerNode extends Serializable

    Permalink
    Definition Classes
    GraphTraversal

  30. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

  31. def addString(b: StringBuilder, sep: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

  32. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

  33. def aggregate[B](z: ⇒ B)(seqop: (B, Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  34. def andThen[A](g: (Boolean) ⇒ A): (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ A

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()

  35. final val anyEdge: EdgeFilter

    Permalink
    Definition Classes
    GraphBase

  36. final def anyEdgeSelector(from: NodeT, to: NodeT): Option[EdgeT]

    Permalink
    Definition Classes
    GraphTraversal
    Annotations
    @inline()

  37. final val anyNode: NodeFilter

    Permalink
    Definition Classes
    GraphBase

  38. final lazy val anyOrdering: AnyOrdering[Graph[Rule, LDiEdge]]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphBase

  39. def apply(elem: Param[Graph[Rule, LDiEdge], DiEdge]): Boolean

    Permalink
    Definition Classes
    GenSetLike → Function1

  40. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  41. def asSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String

    Permalink
    Definition Classes
    GraphLike

  42. final def bulkOp(elems: GenTraversableOnce[Param[Graph[Rule, LDiEdge], DiEdge]], isPlusPlus: Boolean): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike

  43. def canEqual(that: Any): Boolean

    Permalink
    Definition Classes
    IterableLike → Equals

  44. def clearNodeStates(flags: FlagWord, flagsExt: ExtBitSet): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    State

  45. def clone(): AnyRef

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

  46. def collect[B, That](pf: PartialFunction[Param[Graph[Rule, LDiEdge], DiEdge], B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  47. def collectFirst[B](pf: PartialFunction[Param[Graph[Rule, LDiEdge], DiEdge], B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce

  48. def companion: GenericCompanion[Set]

    Permalink
    Definition Classes
    Set → GenSet → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

  49. def componentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering): ComponentTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal

  50. def components(): Set[Graph[Rule, LDiEdge]]

    Permalink

    returns

    the rule dependency graphs contained in this graphs

  51. def compose[A](g: (A) ⇒ Param[Graph[Rule, LDiEdge], DiEdge]): (A) ⇒ Boolean

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()

  52. implicit val config: scalax.collection.immutable.DefaultGraphImpl.Config with AdjacencyListArrayConfig

    Permalink
    Definition Classes
    DefaultGraphImpl → GraphLike

  53. def contains(elem: Param[Graph[Rule, LDiEdge], DiEdge]): Boolean

    Permalink
    Definition Classes
    GraphLike → SetLike → GenSetLike

  54. final def copy(nodes: Iterable[Graph[Rule, LDiEdge]], edges: Iterable[DiEdge[Graph[Rule, LDiEdge]]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph
    Annotations
    @inline()

  55. def copyToArray[B >: Param[Graph[Rule, LDiEdge], DiEdge]](xs: Array[B], start: Int, len: Int): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  56. def copyToArray[B >: Param[Graph[Rule, LDiEdge], DiEdge]](xs: Array[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  57. def copyToArray[B >: Param[Graph[Rule, LDiEdge], DiEdge]](xs: Array[B], start: Int): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  58. def copyToBuffer[B >: Param[Graph[Rule, LDiEdge], DiEdge]](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce

  59. def count(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  60. final def cycle(results: (Option[NodeT], ArrayStack[CycleStackElem]), edgeFilter: EdgeFilter): Option[Cycle]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl

  61. final lazy val defaultEdgeOrdering: EdgeOrdering

    Permalink
    Definition Classes
    GraphBase

  62. final lazy val defaultNodeOrdering: NodeOrdering

    Permalink
    Definition Classes
    GraphBase

  63. final def defaultPathSize: Int

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
    Annotations
    @inline()

  64. def degreeCount(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, Int]

    Permalink
    Definition Classes
    GraphDegree

  65. def degreeNodeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[DegreeNodeSeqEntry]

    Permalink
    Definition Classes
    GraphDegree

  66. def degreeNodesMap(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, AnySet[NodeT]]

    Permalink
    Definition Classes
    GraphDegree

  67. def degreeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[Int]

    Permalink
    Definition Classes
    GraphDegree

  68. def degreeSet(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedSet[Int]

    Permalink
    Definition Classes
    GraphDegree

  69. def diff(that: GenSet[Param[Graph[Rule, LDiEdge], DiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    SetLike → GenSetLike

  70. def drop(n: Int): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  71. def dropRight(n: Int): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    IterableLike

  72. def dropWhile(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  73. def dump(store: FlagStore): ExtBitSet

    Permalink
    Attributes
    protected
    Definition Classes
    State

  74. def dumpDirty: ExtBitSet

    Permalink
    Definition Classes
    State

  75. def dumpInUse: ExtBitSet

    Permalink
    Definition Classes
    State

  76. def edgeIterator: GroupIterator[EdgeT] { ... /* 2 definitions in type refinement */ }

    Permalink
    Definition Classes
    AdjacencyListBase

  77. implicit val edgeT: ClassTag[DiEdge[Graph[Rule, LDiEdge]]]

    Permalink
    Definition Classes
    DefaultGraphImpl → GraphLike

  78. implicit final def edgeToEdgeCont(e: DiEdge[Graph[Rule, LDiEdge]]): DiEdge[NodeT]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphBase
    Annotations
    @inline()

  79. final val edges: EdgeSet

    Permalink
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → GraphBase

  80. final def empty: DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    DefaultGraphImpl → Graph → Graph → SetLike → GenericSetTemplate
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    AnyRef

  82. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    GraphLike → GenSetLike → Equals → AnyRef → Any

  83. def exists(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  84. final def expectedMaxNodes(divisor: Int, min: Int): Int

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl

  85. def filter(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  86. def filterNot(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  87. def finalize(): Unit

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

  88. final def find(outerEdge: DiEdge[Graph[Rule, LDiEdge]]): Option[EdgeT]

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()

  89. final def find(outerNode: Graph[Rule, LDiEdge]): Option[NodeT]

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()

  90. def find(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): Option[Param[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  91. final def findCycle[U](implicit visitor: (InnerElem) ⇒ U): Option[Cycle]

    Permalink
    Definition Classes
    GraphTraversal

  92. def flatMap[B, That](f: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  93. def flatten[B](implicit asTraversable: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ GenTraversableOnce[B]): Set[B]

    Permalink
    Definition Classes
    GenericTraversableTemplate

  94. def fold[A1 >: Param[Graph[Rule, LDiEdge], DiEdge]](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  95. def foldLeft[B](z: B)(op: (B, Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  96. def foldRight[B](z: B)(op: (Param[Graph[Rule, LDiEdge], DiEdge], B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

  98. def forall(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  99. def foreach[U](f: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ U): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

  100. final def from(that: AdjacencyListBase[Graph[Rule, LDiEdge], DiEdge, DefaultGraphImpl])(delNodes: Iterable[scalax.collection.immutable.AdjacencyListBase.NodeT], delEdges: Iterable[scalax.collection.immutable.AdjacencyListBase.EdgeT], ripple: Boolean, addNodes: Iterable[Graph[Rule, LDiEdge]], addEdges: Iterable[DiEdge[Graph[Rule, LDiEdge]]]): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
    Annotations
    @inline()

  101. def genericBuilder[B]: Builder[B, Set[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate

  102. final def get(outerEdge: DiEdge[Graph[Rule, LDiEdge]]): EdgeT

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()

  103. final def get(outerNode: Graph[Rule, LDiEdge]): NodeT

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    AnyRef → Any

  105. final def getOrElse(outerEdge: DiEdge[Graph[Rule, LDiEdge]], default: EdgeT): EdgeT

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()

  106. final def getOrElse(outerNode: Graph[Rule, LDiEdge], default: NodeT): NodeT

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()

  107. final val graphCompanion: DefaultGraphImpl.type

    Permalink
    Definition Classes
    DefaultGraphImpl → GraphLike

  108. def graphSize: Int

    Permalink
    Definition Classes
    GraphBase

  109. def groupBy[K](f: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ K): Map[K, DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  110. def grouped(size: Int): Iterator[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    IterableLike

  111. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  112. def hashCode(): Int

    Permalink
    Definition Classes
    GenSetLike → AnyRef → Any

  113. def having(node: NodeFilter, edge: EdgeFilter): PartialFunction[Param[Graph[Rule, LDiEdge], DiEdge], Boolean]

    Permalink
    Definition Classes
    GraphLike

  114. def head: Param[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  115. def headOption: Option[Param[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  116. def init: DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  117. def initialize(nodes: Iterable[Graph[Rule, LDiEdge]], edges: Iterable[DiEdge[Graph[Rule, LDiEdge]]]): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    GraphBase

  118. def inits: Iterator[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    TraversableLike

  119. def innerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering): InnerEdgeTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal

  120. def innerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering): InnerElemTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal

  121. def innerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering): InnerNodeDownUpTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal

  122. def innerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering): InnerNodeTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal

  123. def intersect(that: GenSet[Param[Graph[Rule, LDiEdge], DiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    GenSetLike

  124. final def isAcyclic: Boolean

    Permalink
    Definition Classes
    GraphTraversal
    Annotations
    @inline()

  125. def isComplete: Boolean

    Permalink
    Definition Classes
    GraphTraversal

  126. def isConnected: Boolean

    Permalink
    Definition Classes
    GraphTraversal

  127. final def isCustomEdgeFilter(f: EdgeFilter): Boolean

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @inline()

  128. final def isCustomNodeFilter(f: NodeFilter): Boolean

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @inline()

  129. final def isCyclic: Boolean

    Permalink
    Definition Classes
    GraphTraversal
    Annotations
    @inline()

  130. lazy val isDirected: Boolean

    Permalink
    Definition Classes
    GraphLike → GraphBase

  131. def isEmpty: Boolean

    Permalink
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  132. lazy val isHyper: Boolean

    Permalink
    Definition Classes
    GraphLike → GraphBase

  133. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  134. lazy val isMulti: Boolean

    Permalink
    Definition Classes
    GraphLike → GraphBase

  135. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  136. final def isTrivial: Boolean

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @inline()

  137. def iterator: Iterator[OutParam[Graph[Rule, LDiEdge], DiEdge] with Serializable with InnerElem]

    Permalink
    Definition Classes
    GraphLike → GenSetLike → IterableLike → GenIterableLike

  138. def last: Param[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  139. def lastOption: Option[Param[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  140. def layers(): Traversable[(Int, Iterable[RuleDependencyGraph])]

    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 rule dependency graphs (RDGs).

    returns

    the layers, i.e. (layer_number, Set(RDG))

  141. def map[B, That](f: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], 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.

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  143. def maxBy[B](f: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ B)(implicit cmp: Ordering[B]): Param[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  144. def maxDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GraphDegree

  145. def min[B >: Param[Graph[Rule, LDiEdge], DiEdge]](implicit cmp: Ordering[B]): Param[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  146. def minBy[B](f: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ B)(implicit cmp: Ordering[B]): Param[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  147. def minDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GraphDegree

  148. def minusMinus(delNodes: Iterable[Graph[Rule, LDiEdge]], delEdges: Iterable[DiEdge[Graph[Rule, LDiEdge]]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike

  149. def minusMinusNodesEdges(delNodes: Iterable[Graph[Rule, LDiEdge]], delEdges: Iterable[DiEdge[Graph[Rule, LDiEdge]]]): (Set[Graph[Rule, LDiEdge]], Set[DiEdge[Graph[Rule, LDiEdge]]])

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike

  150. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  151. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  152. def mkString(start: String, sep: String, end: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    AnyRef

  154. def newBuilder: GraphBuilder[Graph[Rule, LDiEdge], DiEdge, DefaultGraphImpl]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    DefaultGraphImpl → SetLike → GenericTraversableTemplate → TraversableLike → HasNewBuilder

  155. final def newEdge(innerEdge: DiEdge[NodeT]): EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase

  156. final def newEdgeTArray(size: Int): Array[EdgeT]

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase
    Annotations
    @inline()

  157. final def newNode(n: Graph[Rule, LDiEdge]): NodeT

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListBase → GraphBase
    Annotations
    @inline()

  158. final def newNodeSet: NodeSetT

    Permalink
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase
    Annotations
    @inline()

  159. final def newNodeWithHints(n: Graph[Rule, LDiEdge], h: Hints): NodeBase

    Permalink
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase
    Annotations
    @inline()

  160. def newPathBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): PathBuilder

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal

  161. def newWalkBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): WalkBuilder

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal

  162. def nextHandle: Handle

    Permalink
    Attributes
    protected
    Definition Classes
    State

  163. final val noNode: NodeFilter

    Permalink
    Definition Classes
    GraphBase

  164. final val nodes: NodeSetT

    Permalink
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → GraphBase

  165. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  166. final def nonTrivial: Boolean

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @inline()

  167. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  168. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  169. def order: Int

    Permalink
    Definition Classes
    GraphBase

  170. def outerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering): OuterEdgeTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal

  171. def outerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering): OuterElemTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal

  172. def outerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering): OuterNodeDownUpTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal

  173. def outerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering): OuterNodeTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal

  174. def par: ParSet[Param[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    Parallelizable

  175. def parCombiner: Combiner[Param[Graph[Rule, LDiEdge], DiEdge], ParSet[Param[Graph[Rule, LDiEdge], DiEdge]]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → Parallelizable

  176. final def partition(elems: GenTraversableOnce[Param[Graph[Rule, LDiEdge], DiEdge]]): Partitions[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike

  177. def partition(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): (DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  178. def plusPlus(newNodes: Iterable[Graph[Rule, LDiEdge]], newEdges: Iterable[DiEdge[Graph[Rule, LDiEdge]]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  180. def reduce[A1 >: Param[Graph[Rule, LDiEdge], DiEdge]](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  181. def reduceLeft[B >: Param[Graph[Rule, LDiEdge], DiEdge]](op: (B, Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce

  182. def reduceLeftOption[B >: Param[Graph[Rule, LDiEdge], DiEdge]](op: (B, Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  183. def reduceOption[A1 >: Param[Graph[Rule, LDiEdge], DiEdge]](op: (A1, A1) ⇒ A1): Option[A1]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  184. def reduceRight[B >: Param[Graph[Rule, LDiEdge], DiEdge]](op: (Param[Graph[Rule, LDiEdge], DiEdge], B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  185. def reduceRightOption[B >: Param[Graph[Rule, LDiEdge], DiEdge]](op: (Param[Graph[Rule, LDiEdge], DiEdge], B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  186. def releaseHandle(handle: Handle): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    State

  187. def repr: DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  188. def reversed: List[Param[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

  190. def scan[B >: Param[Graph[Rule, LDiEdge], DiEdge], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  191. def scanLeft[B, That](z: B)(op: (B, Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  192. def scanRight[B, That](z: B)(op: (Param[Graph[Rule, LDiEdge], DiEdge], B) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], 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.

  193. def seq: Set[Param[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    Set → GenSet → GenSetLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

  194. def size: Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  195. def slice(from: Int, until: Int): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  196. def sliding(size: Int, step: Int): Iterator[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    IterableLike

  197. def sliding(size: Int): Iterator[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    IterableLike

  198. def span(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): (DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  199. def splitAt(n: Int): (DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  200. def stringPrefix: String

    Permalink
    Definition Classes
    GraphLike → SetLike → TraversableLike → GenTraversableLike

  201. def subsetOf(that: GenSet[Param[Graph[Rule, LDiEdge], DiEdge]]): Boolean

    Permalink
    Definition Classes
    GenSetLike

  202. def subsets(): Iterator[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    SetLike

  203. def subsets(len: Int): Iterator[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    SetLike

  204. def sum[B >: Param[Graph[Rule, LDiEdge], DiEdge]](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    AnyRef

  206. def tail: DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  207. def tails: Iterator[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    TraversableLike

  208. def take(n: Int): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  209. def takeRight(n: Int): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    IterableLike

  210. def takeWhile(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  211. def thisCollection: Iterable[Param[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  212. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Param[Graph[Rule, LDiEdge], DiEdge], Col[Param[Graph[Rule, LDiEdge], DiEdge]]]): Col[Param[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  213. def toArray[B >: Param[Graph[Rule, LDiEdge], DiEdge]](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  214. def toBuffer[A1 >: Param[Graph[Rule, LDiEdge], DiEdge]]: Buffer[A1]

    Permalink
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce

  215. def toCollection(repr: DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]): Iterable[Param[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  216. def toIndexedSeq: IndexedSeq[Param[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  217. def toIterable: Iterable[Param[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  218. def toIterator: Iterator[Param[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  219. def toList: List[Param[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  220. def toMap[T, U](implicit ev: <:<[Param[Graph[Rule, LDiEdge], DiEdge], (T, U)]): Map[T, U]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  221. def toSeq: Seq[Param[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce

  222. def toSet[B >: Param[Graph[Rule, LDiEdge], DiEdge]]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  223. def toSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String

    Permalink
    Definition Classes
    GraphLike

  224. def toStream: Stream[Param[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  225. def toString(): String

    Permalink
    Definition Classes
    GraphLike → SetLike → Function1 → TraversableLike → AnyRef → Any

  226. def toTraversable: Traversable[Param[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  227. def toVector: Vector[Param[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  228. final def topologicalSort[U](implicit visitor: (InnerElem) ⇒ U): CycleNodeOrTopologicalOrder

    Permalink
    Definition Classes
    GraphTraversal

  229. final def topologicalSortByComponent[U](implicit visitor: (InnerElem) ⇒ U): Traversable[CycleNodeOrTopologicalOrder]

    Permalink
    Definition Classes
    GraphTraversal

  230. def totalDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GraphDegree

  231. def totalWeight: Long

    Permalink
    Definition Classes
    GraphBase

  232. def transpose[B](implicit asTraversable: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ 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.

  233. def union(that: GenSet[Param[Graph[Rule, LDiEdge], DiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    SetLike → GenSetLike

  234. def unzip[A1, A2](implicit asPair: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ (A1, A2)): (Set[A1], Set[A2])

    Permalink
    Definition Classes
    GenericTraversableTemplate

  235. def unzip3[A1, A2, A3](implicit asTriple: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

    Permalink
    Definition Classes
    GenericTraversableTemplate

  236. def view(from: Int, until: Int): IterableView[Param[Graph[Rule, LDiEdge], DiEdge], DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike

  237. def view: IterableView[Param[Graph[Rule, LDiEdge], DiEdge], DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike

  238. final def wait(): Unit

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

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

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

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

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

  241. def withFilter(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): FilterMonadic[Param[Graph[Rule, LDiEdge], DiEdge], DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic

  242. def withHandle[T](reuse: Option[Handle])(block: (Handle) ⇒ T): T

    Permalink
    Attributes
    protected
    Definition Classes
    State

  243. def withHandles[T](nr: Int, reuse: Array[Handle])(block: (Array[Handle]) ⇒ T): T

    Permalink
    Attributes
    protected
    Definition Classes
    State

  244. def zip[A1 >: Param[Graph[Rule, LDiEdge], DiEdge], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

  245. def zipAll[B, A1 >: Param[Graph[Rule, LDiEdge], DiEdge], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

  246. def zipWithIndex[A1 >: Param[Graph[Rule, LDiEdge], DiEdge], That](implicit bf: CanBuildFrom[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], (A1, Int), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

  247. def |(that: GenSet[Param[Graph[Rule, LDiEdge], DiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

    Permalink
    Definition Classes
    GenSetLike

Inherited from DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]

Inherited from GraphTraversalImpl[Graph[Rule, LDiEdge], DiEdge]

Inherited from State[Graph[Rule, LDiEdge], DiEdge]

Inherited from TraverserImpl[Graph[Rule, LDiEdge], DiEdge]

Inherited from AdjacencyListGraph[Graph[Rule, LDiEdge], DiEdge, DefaultGraphImpl]

Inherited from AdjacencyListBase[Graph[Rule, LDiEdge], DiEdge, DefaultGraphImpl]

Inherited from Graph[Graph[Rule, LDiEdge], DiEdge]

Inherited from Graph[Graph[Rule, LDiEdge], DiEdge]

Inherited from GraphLike[Graph[Rule, LDiEdge], DiEdge, DefaultGraphImpl]

Inherited from GraphDegree[Graph[Rule, LDiEdge], DiEdge]

Inherited from GraphTraversal[Graph[Rule, LDiEdge], DiEdge]

Inherited from GraphBase[Graph[Rule, LDiEdge], DiEdge]

Inherited from Serializable

Inherited from Serializable

Inherited from Set[Param[Graph[Rule, LDiEdge], DiEdge]]

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

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

Inherited from GenSet[Param[Graph[Rule, LDiEdge], DiEdge]]

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

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

Inherited from Iterable[Param[Graph[Rule, LDiEdge], DiEdge]]

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

Inherited from Equals

Inherited from GenIterable[Param[Graph[Rule, LDiEdge], DiEdge]]

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

Inherited from Traversable[Param[Graph[Rule, LDiEdge], DiEdge]]

Inherited from GenTraversable[Param[Graph[Rule, LDiEdge], DiEdge]]

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

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

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

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

Inherited from TraversableOnce[Param[Graph[Rule, LDiEdge], DiEdge]]

Inherited from GenTraversableOnce[Param[Graph[Rule, LDiEdge], DiEdge]]

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped