Packages

c

net.sansa_stack.inference.rules

HighLevelRuleDependencyGraph

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

  • each vertex in V is a rule dependency graph which is strongly connected and
  • each edge (v_i, v_j) in E denotes the dependency between them

The dependency between two rules r_i and r_j, denoted as r_i -> r_j resp. "r_i depends on r_j" indicates that the result 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]]]())

Type Members

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

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def &(that: GenSet[Param[Graph[Rule, LDiEdge], DiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    GenSetLike
  4. def &~(that: GenSet[Param[Graph[Rule, LDiEdge], DiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    GenSetLike
  5. def +(n: Graph[Rule, LDiEdge]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    AdjacencyListGraph → GraphLike
  6. def +(elem: Param[Graph[Rule, LDiEdge], DiEdge]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    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]
    Definition Classes
    SetLike
  8. def +#(e: DiEdge[Graph[Rule, LDiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphLike
  9. def ++(elems: GenTraversableOnce[Param[Graph[Rule, LDiEdge], DiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    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
    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
    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
    Definition Classes
    TraversableLike
  13. def -(n: Graph[Rule, LDiEdge]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    AdjacencyListGraph → GraphLike
  14. def -(elem: Param[Graph[Rule, LDiEdge], DiEdge]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    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]
    Definition Classes
    Subtractable
  16. def -!(elem: Param[Graph[Rule, LDiEdge], DiEdge]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    GraphLike
  17. def -!#(e: DiEdge[Graph[Rule, LDiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphLike
  18. def -#(e: DiEdge[Graph[Rule, LDiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphLike
  19. def --(elems: GenTraversableOnce[Param[Graph[Rule, LDiEdge], DiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    GraphLike → Subtractable
  20. def --!(elems: GenTraversableOnce[Param[Graph[Rule, LDiEdge], DiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    GraphLike
  21. def -?(n: Graph[Rule, LDiEdge]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    AdjacencyListGraph → GraphLike
  22. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  23. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  24. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  25. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  26. def aggregate[B](z: ⇒ B)(seqop: (B, Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  27. def andThen[A](g: (Boolean) ⇒ A): (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  28. final val anyEdge: EdgeFilter
    Definition Classes
    GraphBase
  29. final def anyEdgeSelector(from: NodeT, to: NodeT): Option[EdgeT]
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  30. final val anyNode: NodeFilter
    Definition Classes
    GraphBase
  31. final lazy val anyOrdering: AnyOrdering[Graph[Rule, LDiEdge]]
    Attributes
    protected
    Definition Classes
    GraphBase
  32. def apply(elem: Param[Graph[Rule, LDiEdge], DiEdge]): Boolean
    Definition Classes
    GenSetLike → Function1
  33. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  34. def asSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String
    Definition Classes
    GraphLike
  35. final def bulkOp(elems: GenTraversableOnce[Param[Graph[Rule, LDiEdge], DiEdge]], isPlusPlus: Boolean): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Attributes
    protected
    Definition Classes
    GraphLike
  36. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  37. def clearNodeStates(flags: FlagWord, flagsExt: ExtBitSet): Unit
    Attributes
    protected
    Definition Classes
    State
  38. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  39. def collect[B, That](pf: PartialFunction[Param[Graph[Rule, LDiEdge], DiEdge], B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  40. def collectFirst[B](pf: PartialFunction[Param[Graph[Rule, LDiEdge], DiEdge], B]): Option[B]
    Definition Classes
    TraversableOnce
  41. def companion: GenericCompanion[Set]
    Definition Classes
    Set → GenSet → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  42. def componentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): ComponentTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  43. def components(): Set[Graph[Rule, LDiEdge]]

    returns

    the rule dependency graphs contained in this graphs

  44. def compose[A](g: (A) ⇒ Param[Graph[Rule, LDiEdge], DiEdge]): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  45. implicit val config: scalax.collection.immutable.DefaultGraphImpl.Config with AdjacencyListArrayConfig
    Definition Classes
    DefaultGraphImpl → GraphLike
  46. def contains(elem: Param[Graph[Rule, LDiEdge], DiEdge]): Boolean
    Definition Classes
    GraphLike → SetLike → GenSetLike
  47. final def copy(nodes: Traversable[Graph[Rule, LDiEdge]], edges: Traversable[DiEdge[Graph[Rule, LDiEdge]]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph
  48. def copyToArray[B >: Param[Graph[Rule, LDiEdge], DiEdge]](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  49. def copyToArray[B >: Param[Graph[Rule, LDiEdge], DiEdge]](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  50. def copyToArray[B >: Param[Graph[Rule, LDiEdge], DiEdge]](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  51. def copyToBuffer[B >: Param[Graph[Rule, LDiEdge], DiEdge]](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  52. def count(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  53. final def cycle(results: Option[(NodeT, ArrayStack[CycleStackElem])], edgeFilter: EdgeFilter): Option[Cycle]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  54. final def cycle(maybeStart: Option[NodeT], stack: ArrayStack[Element], edgeFilter: EdgeFilter): Option[Cycle]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  55. final lazy val defaultEdgeOrdering: EdgeOrdering
    Definition Classes
    GraphBase
  56. final lazy val defaultNodeOrdering: NodeOrdering
    Definition Classes
    GraphBase
  57. final def defaultPathSize: Int
    Attributes
    protected
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  58. def degreeCount(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, Int]
    Definition Classes
    GraphDegree
  59. def degreeNodeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[DegreeNodeSeqEntry]
    Definition Classes
    GraphDegree
  60. def degreeNodesMap(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, AnySet[NodeT]]
    Definition Classes
    GraphDegree
  61. def degreeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[Int]
    Definition Classes
    GraphDegree
  62. def degreeSet(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedSet[Int]
    Definition Classes
    GraphDegree
  63. def diff(that: GenSet[Param[Graph[Rule, LDiEdge], DiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    SetLike → GenSetLike
  64. def drop(n: Int): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  65. def dropRight(n: Int): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    IterableLike
  66. def dropWhile(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    TraversableLike → GenTraversableLike
  67. def dump(store: FlagStore): ExtBitSet
    Attributes
    protected
    Definition Classes
    State
  68. def dumpDirty: ExtBitSet
    Definition Classes
    State
  69. def dumpInUse: ExtBitSet
    Definition Classes
    State
  70. def edgeIterator: GroupIterator[EdgeT] { ... /* 2 definitions in type refinement */ }
    Definition Classes
    AdjacencyListBase
  71. implicit val edgeT: ClassTag[DiEdge[Graph[Rule, LDiEdge]]]
    Definition Classes
    DefaultGraphImpl → GraphLike
  72. implicit final def edgeToEdgeCont(e: DiEdge[Graph[Rule, LDiEdge]]): DiEdge[NodeT]
    Attributes
    protected
    Definition Classes
    GraphBase
  73. final def edges: EdgeSetT
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  74. final def empty: DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    DefaultGraphImpl → Graph → Graph → SetLike → GenericSetTemplate
  75. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  76. def equals(that: Any): Boolean
    Definition Classes
    GraphLike → GenSetLike → Equals → AnyRef → Any
  77. def exists(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  78. final def expectedMaxNodes(divisor: Int, min: Int): Int
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  79. def filter(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    TraversableLike → GenTraversableLike
  80. def filterNot(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    TraversableLike → GenTraversableLike
  81. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  82. final def find(outerEdge: DiEdge[Graph[Rule, LDiEdge]]): Option[EdgeT]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  83. final def find(outerNode: Graph[Rule, LDiEdge]): Option[NodeT]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  84. def find(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): Option[Param[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  85. final def findCycle[U](implicit visitor: (InnerElem) ⇒ U): Option[Cycle]
    Definition Classes
    GraphTraversal
  86. final def findCycleContaining[U](node: NodeT)(implicit visitor: (InnerElem) ⇒ U): Option[Cycle]
    Definition Classes
    GraphTraversal
  87. def flatMap[B, That](f: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  88. def flatten[B](implicit asTraversable: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ GenTraversableOnce[B]): Set[B]
    Definition Classes
    GenericTraversableTemplate
  89. def fold[A1 >: Param[Graph[Rule, LDiEdge], DiEdge]](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def foldLeft[B](z: B)(op: (B, Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def foldRight[B](z: B)(op: (Param[Graph[Rule, LDiEdge], DiEdge], B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  92. final def forInDegrees(traversable: Traversable[NodeT] with SubgraphProperties, maybeHandle: Option[Handle], includeAnyway: Option[NodeT], includeInDegree: NodeFilter, fillInDegrees: Boolean): TopoSortSetup
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  93. def forall(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  94. def foreach[U](f: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  95. def genericBuilder[B]: Builder[B, Set[B]]
    Definition Classes
    GenericTraversableTemplate
  96. final def get(outerEdge: DiEdge[Graph[Rule, LDiEdge]]): EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  97. final def get(outerNode: Graph[Rule, LDiEdge]): NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  98. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  99. final def getOrElse(outerEdge: DiEdge[Graph[Rule, LDiEdge]], default: EdgeT): EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  100. final def getOrElse(outerNode: Graph[Rule, LDiEdge], default: NodeT): NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  101. final val graphCompanion: DefaultGraphImpl.type
    Definition Classes
    DefaultGraphImpl → GraphLike
  102. def graphSize: Int
    Definition Classes
    GraphBase
  103. def groupBy[K](f: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ K): Map[K, DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    TraversableLike → GenTraversableLike
  104. def grouped(size: Int): Iterator[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    IterableLike
  105. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  106. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  107. def having(node: NodeFilter, edge: EdgeFilter): PartialFunction[Param[Graph[Rule, LDiEdge], DiEdge], Boolean]
    Definition Classes
    GraphLike
  108. def head: Param[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  109. def headOption: Option[Param[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    TraversableLike → GenTraversableLike
  110. def init: DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    TraversableLike → GenTraversableLike
  111. def initialize(nodes: Traversable[Graph[Rule, LDiEdge]], edges: Traversable[DiEdge[Graph[Rule, LDiEdge]]]): Unit
    Attributes
    protected
    Definition Classes
    GraphBase
  112. def initializeFrom(in: ObjectInputStream, nodes: NodeSetT, edges: EdgeSetT): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  113. def inits: Iterator[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    TraversableLike
  114. def innerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerEdgeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  115. def innerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerElemTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  116. def innerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerNodeDownUpTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  117. def innerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerNodeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  118. def intersect(that: GenSet[Param[Graph[Rule, LDiEdge], DiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    GenSetLike
  119. final def isAcyclic: Boolean
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  120. def isComplete: Boolean
    Definition Classes
    GraphTraversal
  121. def isConnected: Boolean
    Definition Classes
    GraphTraversal
  122. final def isCustomEdgeFilter(f: EdgeFilter): Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  123. final def isCustomNodeFilter(f: NodeFilter): Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  124. final def isCyclic: Boolean
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  125. def isDirected: Boolean
    Definition Classes
    GraphLike → GraphBase
  126. final val isDirectedT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  127. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  128. def isHyper: Boolean
    Definition Classes
    GraphLike → GraphBase
  129. final val isHyperT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  130. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  131. def isMixed: Boolean
    Definition Classes
    GraphLike → GraphBase
  132. def isMulti: Boolean
    Definition Classes
    GraphLike → GraphBase
  133. final val isMultiT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  134. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  135. final def isTrivial: Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  136. def iterator: Iterator[Param[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    GraphLike → GenSetLike → IterableLike → GenIterableLike
  137. def last: Param[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    TraversableLike → GenTraversableLike
  138. def lastOption: Option[Param[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    TraversableLike → GenTraversableLike
  139. def layers(): Traversable[(Int, Iterable[RuleDependencyGraph])]

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

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

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

  141. def max[B >: Param[Graph[Rule, LDiEdge], DiEdge]](implicit cmp: Ordering[B]): Param[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  142. def maxBy[B](f: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ B)(implicit cmp: Ordering[B]): Param[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  143. def maxDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  144. def min[B >: Param[Graph[Rule, LDiEdge], DiEdge]](implicit cmp: Ordering[B]): Param[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  145. def minBy[B](f: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ B)(implicit cmp: Ordering[B]): Param[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  146. def minDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  147. def minusMinus(delNodes: Traversable[Graph[Rule, LDiEdge]], delEdges: Traversable[DiEdge[Graph[Rule, LDiEdge]]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Attributes
    protected
    Definition Classes
    GraphLike
  148. def minusMinusNodesEdges(delNodes: Traversable[Graph[Rule, LDiEdge]], delEdges: Traversable[DiEdge[Graph[Rule, LDiEdge]]]): (Set[Graph[Rule, LDiEdge]], Set[DiEdge[Graph[Rule, LDiEdge]]])
    Attributes
    protected
    Definition Classes
    GraphLike
  149. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  150. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  151. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  152. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  153. def newBuilder: GraphBuilder[Graph[Rule, LDiEdge], DiEdge, DefaultGraphImpl]
    Attributes
    protected[this]
    Definition Classes
    DefaultGraphImpl → SetLike → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  154. final def newEdge(innerEdge: DiEdge[NodeT]): EdgeT
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
  155. final def newEdgeTArray(size: Int): Array[EdgeT]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase
    Annotations
    @inline()
  156. final def newNode(n: Graph[Rule, LDiEdge]): NodeT
    Attributes
    protected
    Definition Classes
    AdjacencyListBase → GraphBase
    Annotations
    @inline()
  157. final def newNodeSet: NodeSetT
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase
    Annotations
    @inline()
  158. final def newNodeWithHints(n: Graph[Rule, LDiEdge], h: Hints): NodeBase
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase
    Annotations
    @inline()
  159. def newPathBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): PathBuilder
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  160. def newWalkBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): WalkBuilder
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  161. def nextHandle: Handle
    Attributes
    protected
    Definition Classes
    State
  162. final val noNode: NodeFilter
    Definition Classes
    GraphBase
  163. final def nodes: NodeSetT
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  164. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  165. final def nonTrivial: Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  166. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  167. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  168. def order: Int
    Definition Classes
    GraphBase
  169. def outerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterEdgeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  170. def outerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterElemTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  171. def outerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterNodeDownUpTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  172. def outerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterNodeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  173. def par: ParSet[Param[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    Parallelizable
  174. def parCombiner: Combiner[Param[Graph[Rule, LDiEdge], DiEdge], ParSet[Param[Graph[Rule, LDiEdge], DiEdge]]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → Parallelizable
  175. final def partition(elems: GenTraversableOnce[Param[Graph[Rule, LDiEdge], DiEdge]]): Partitions[Graph[Rule, LDiEdge], DiEdge]
    Attributes
    protected
    Definition Classes
    GraphLike
  176. def partition(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): (DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge])
    Definition Classes
    TraversableLike → GenTraversableLike
  177. def plusPlus(newNodes: Traversable[Graph[Rule, LDiEdge]], newEdges: Traversable[DiEdge[Graph[Rule, LDiEdge]]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Attributes
    protected
    Definition Classes
    GraphLike
  178. def product[B >: Param[Graph[Rule, LDiEdge], DiEdge]](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  179. def reduce[A1 >: Param[Graph[Rule, LDiEdge], DiEdge]](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  180. def reduceLeft[B >: Param[Graph[Rule, LDiEdge], DiEdge]](op: (B, Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ B): B
    Definition Classes
    TraversableOnce
  181. def reduceLeftOption[B >: Param[Graph[Rule, LDiEdge], DiEdge]](op: (B, Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  182. def reduceOption[A1 >: Param[Graph[Rule, LDiEdge], DiEdge]](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  183. def reduceRight[B >: Param[Graph[Rule, LDiEdge], DiEdge]](op: (Param[Graph[Rule, LDiEdge], DiEdge], B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  184. def reduceRightOption[B >: Param[Graph[Rule, LDiEdge], DiEdge]](op: (Param[Graph[Rule, LDiEdge], DiEdge], B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  185. def releaseHandle(handle: Handle): Unit
    Attributes
    protected
    Definition Classes
    State
  186. def repr: DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    TraversableLike → GenTraversableLike
  187. def reversed: List[Param[Graph[Rule, LDiEdge], DiEdge]]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  188. def sameElements[B >: Param[Graph[Rule, LDiEdge], DiEdge]](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  189. 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
    Definition Classes
    TraversableLike → GenTraversableLike
  190. 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
    Definition Classes
    TraversableLike → GenTraversableLike
  191. 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
    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.

  192. def seq: Set[Param[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    Set → GenSet → GenSetLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  193. final def serializeTo(out: ObjectOutputStream): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  194. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  195. def sizeHintIfCheap: Int
    Attributes
    protected[collection]
    Definition Classes
    GenTraversableOnce
  196. def slice(from: Int, until: Int): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  197. def sliding(size: Int, step: Int): Iterator[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    IterableLike
  198. def sliding(size: Int): Iterator[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    IterableLike
  199. def span(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): (DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge])
    Definition Classes
    TraversableLike → GenTraversableLike
  200. def splitAt(n: Int): (DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge])
    Definition Classes
    TraversableLike → GenTraversableLike
  201. def stringPrefix: String
    Definition Classes
    GraphLike → SetLike → TraversableLike → GenTraversableLike
  202. def strongComponentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): StrongComponentTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  203. def subsetOf(that: GenSet[Param[Graph[Rule, LDiEdge], DiEdge]]): Boolean
    Definition Classes
    GenSetLike
  204. def subsets(): Iterator[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    SetLike
  205. def subsets(len: Int): Iterator[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    SetLike
  206. def sum[B >: Param[Graph[Rule, LDiEdge], DiEdge]](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  207. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  208. def tail: DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    TraversableLike → GenTraversableLike
  209. def tails: Iterator[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    TraversableLike
  210. def take(n: Int): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  211. def takeRight(n: Int): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    IterableLike
  212. def takeWhile(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  213. def thisCollection: Iterable[Param[Graph[Rule, LDiEdge], DiEdge]]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  214. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Param[Graph[Rule, LDiEdge], DiEdge], Col[Param[Graph[Rule, LDiEdge], DiEdge]]]): Col[Param[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  215. def toArray[B >: Param[Graph[Rule, LDiEdge], DiEdge]](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  216. def toBuffer[A1 >: Param[Graph[Rule, LDiEdge], DiEdge]]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  217. def toCollection(repr: DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]): Iterable[Param[Graph[Rule, LDiEdge], DiEdge]]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  218. def toIndexedSeq: IndexedSeq[Param[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  219. def toIterable: Iterable[Param[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  220. def toIterator: Iterator[Param[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  221. def toList: List[Param[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  222. def toMap[T, U](implicit ev: <:<[Param[Graph[Rule, LDiEdge], DiEdge], (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  223. def toSeq: Seq[Param[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  224. def toSet[B >: Param[Graph[Rule, LDiEdge], DiEdge]]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  225. def toSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String
    Definition Classes
    GraphLike
  226. def toStream: Stream[Param[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  227. def toString(): String
    Definition Classes
    GraphLike → SetLike → Function1 → TraversableLike → AnyRef → Any
  228. def toTraversable: Traversable[Param[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  229. def toVector: Vector[Param[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  230. final def topologicalSort[U](implicit visitor: (InnerElem) ⇒ U): CycleNodeOrTopologicalOrder
    Definition Classes
    GraphTraversal
  231. final def topologicalSortByComponent[U](implicit visitor: (InnerElem) ⇒ U): Traversable[CycleNodeOrTopologicalOrder]
    Definition Classes
    GraphTraversal
  232. def totalDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  233. def totalWeight: Double
    Definition Classes
    GraphBase
  234. def transpose[B](implicit asTraversable: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ GenTraversableOnce[B]): Set[Set[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  235. def union(that: GenSet[Param[Graph[Rule, LDiEdge], DiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    SetLike → GenSetLike
  236. def unzip[A1, A2](implicit asPair: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    GenericTraversableTemplate
  237. def unzip3[A1, A2, A3](implicit asTriple: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    GenericTraversableTemplate
  238. def view(from: Int, until: Int): IterableView[Param[Graph[Rule, LDiEdge], DiEdge], DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    IterableLike → TraversableLike
  239. def view: IterableView[Param[Graph[Rule, LDiEdge], DiEdge], DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    IterableLike → TraversableLike
  240. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  241. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  242. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  243. def withFilter(p: (Param[Graph[Rule, LDiEdge], DiEdge]) ⇒ Boolean): FilterMonadic[Param[Graph[Rule, LDiEdge], DiEdge], DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]]
    Definition Classes
    TraversableLike → FilterMonadic
  244. def withHandle[T](reuse: Option[Handle])(block: (Handle) ⇒ T): T
    Attributes
    protected
    Definition Classes
    State
  245. def withHandles[T](nr: Int, reuse: Array[Handle])(block: (Array[Handle]) ⇒ T): T
    Attributes
    protected
    Definition Classes
    State
  246. 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
    Definition Classes
    IterableLike → GenIterableLike
  247. 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
    Definition Classes
    IterableLike → GenIterableLike
  248. def zipWithIndex[A1 >: Param[Graph[Rule, LDiEdge], DiEdge], That](implicit bf: CanBuildFrom[DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  249. def |(that: GenSet[Param[Graph[Rule, LDiEdge], DiEdge]]): DefaultGraphImpl[Graph[Rule, LDiEdge], DiEdge]
    Definition Classes
    GenSetLike
  250. object Edge extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  251. object InnerEdge extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  252. object InnerNode extends Serializable
    Definition Classes
    GraphBase
  253. object Node extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  254. object TraverserInnerNode extends Serializable
    Definition Classes
    GraphTraversal
    Annotations
    @transient()

Deprecated Value Members

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

    (Since version 2.12.10) Use foldLeft instead of /:

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

    (Since version 2.12.10) Use foldRight instead of :\

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