class RuleDependencyGraph extends DefaultGraphImpl[Rule, LDiEdge]
Given a set of rules R, a rule dependency graph (RDG) is a directed graph G = (V, E) such that
- each vertex in V represents a rule r_i from R and
- each edge (r_i, r_j) in E denotes the dependency between them
The dependency between two rules r_i and r_j, denoted as r_i -> r_j, resp. "r_i depends on r_j" indicates that the result of r_j is used as input of r_i. In particular, that means we use the same direction in the graph although one would expect to have an edge from the rule r_j producing the data to the rule r_i consuming the data.
Some notes about the types used: The Rule class stems from org.apache.jena.reasoner.rulesys and comprises a list of antecedents (body) and a list of consequents (head), i.e.
consequent [, consequent] <- antecedent [, antecedent]
where each consequent or antecedent can be a TriplePattern (i.e. a triple of Nodes, themselves being either variables, wildcards, embedded functors, uri or literal graph nodes), a Functor or a Rule.
The Graph and LDiEdge ('labeled directed edge') classes stem from scalax.collection which provides the main graph functionality. Considering a scalax.collection.Graph two kinds of Nodes are distinguished:
- Outer Nodes Outer nodes exist outside of the context of any particular graph and must be provided by the library user. When added to a graph, they will be transparently wrapped by a corresponding inner node. Outer nodes must satisfy the upper bound of the node type parameter of the graph - Inner Nodes Inner nodes are objects bound to a particular graph. They are transparently created on graph instantiation or on adding nodes to a graph. Inner nodes are instances of the inner class NodeT, hence the term, and are implementing the InnerNodeLike interface. An inner node acts as a container of the corresponding outer node also providing a wealth of graph functionality such as diSuccessors or pathTo. Inner nodes always equal to the contained, user-provided outer node thus facilitating interchangeability of inner and outer nodes in many situations. Note that NodeT is a path dependent type such as g.NodeT with g denoting a single graph instance.
(Descriptions taken from http://www.scala-graph.org/guides/core-inner-outer.html)
- Alphabetic
- By Inheritance
- RuleDependencyGraph
- DefaultGraphImpl
- GraphTraversalImpl
- State
- TraverserImpl
- AdjacencyListGraph
- AdjacencyListBase
- Graph
- GraphLike
- Mutable
- EdgeOps
- Cloneable
- Cloneable
- Cloneable
- Shrinkable
- Growable
- Clearable
- Graph
- GraphLike
- GraphDegree
- GraphTraversal
- GraphBase
- Serializable
- Serializable
- Set
- SetLike
- Subtractable
- GenSet
- GenericSetTemplate
- GenSetLike
- Iterable
- IterableLike
- Equals
- GenIterable
- GenIterableLike
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- Function1
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
Type Members
-
sealed abstract
class
AbstractTopologicalOrder[+A, +T] extends AbstractTraversable[T]
- Definition Classes
- GraphTraversal
-
class
AnyEdgeLazyCycle extends (GraphTraversalImpl.this)#AnyEdgeLazyPath with (GraphTraversalImpl.this)#Cycle
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
class
AnyEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
abstract
class
Component extends Properties
- Definition Classes
- GraphTraversal
-
case class
ComponentTraverser extends (GraphTraversalImpl.this)#ComponentTraverser with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
type
Config = CoreConfig
- Attributes
- protected
- Definition Classes
- DefaultGraphImpl → AdjacencyListBase → GraphLike
-
trait
Cycle extends Path
- Definition Classes
- GraphTraversal
-
type
CycleNodeOrTopologicalOrder = Either[NodeT, TopologicalOrder[NodeT]]
- Definition Classes
- GraphTraversal
-
trait
DegreeFunction extends ((GraphDegree.this)#NodeT) ⇒ Int
- Definition Classes
- GraphDegree
-
type
DegreeNodeSeqEntry = (Int, NodeT)
- Definition Classes
- GraphDegree
-
final
class
DegreeOrdering extends Ordering[(GraphDegree.this)#NodeT]
- Definition Classes
- GraphDegree
-
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
-
trait
Edge extends Serializable
- Definition Classes
- GraphBase
-
class
EdgeBase extends InnerEdgeParam[N, E, (GraphLike.this)#NodeT, E] with (GraphLike.this)#InnerEdge
- Definition Classes
- GraphLike
-
type
EdgeFilter = (EdgeT) ⇒ Boolean
- Definition Classes
- GraphBase
-
class
EdgeImpl extends scalax.collection.mutable.AdjacencyListGraph.This.EdgeBase
- Definition Classes
- AdjacencyListGraph
- Annotations
- @SerialVersionUID()
-
sealed
trait
EdgeOrdering extends Ordering[scalax.collection.GraphBase.EdgeT] with ElemOrdering
- Definition Classes
- GraphBase
-
class
EdgeSet extends scalax.collection.mutable.AdjacencyListGraph.This.EdgeSet with scalax.collection.mutable.AdjacencyListGraph.This.EdgeSet
- Definition Classes
- AdjacencyListGraph
-
type
EdgeSetT = EdgeSet
- Definition Classes
- AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphBase
-
type
EdgeT = EdgeImpl
- Definition Classes
- AdjacencyListGraph → GraphLike → GraphBase
-
sealed
trait
ElemOrdering extends AnyRef
- Attributes
- protected
- Definition Classes
- GraphBase
-
trait
ExtendedNodeVisitor[U] extends (scalax.collection.GraphTraversal.NodeT) ⇒ U with (scalax.collection.GraphTraversal.NodeT, Int, Int, ⇒ NodeInformer) ⇒ U
- Definition Classes
- GraphTraversal
-
trait
Filter[T] extends (T) ⇒ Boolean
- Definition Classes
- GraphDegree
-
abstract
class
FluentProperties[+This <: FluentProperties[This]] extends AnyRef
- Attributes
- protected
- Definition Classes
- GraphTraversal
-
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
-
trait
InnerEdge extends (GraphLike.this)#InnerEdge
- Definition Classes
- GraphLike
-
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
-
sealed
trait
InnerElem extends AnyRef
- Definition Classes
- GraphBase
-
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
-
trait
InnerNode extends (AdjacencyListBase.this)#InnerNode
- Definition Classes
- AdjacencyListBase
-
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
-
abstract
class
InnerNodeImpl extends scalax.collection.mutable.AdjacencyListGraph.This.NodeBase with scalax.collection.mutable.AdjacencyListGraph.This.InnerNode with scalax.collection.mutable.AdjacencyListGraph.This.InnerNode
- Definition Classes
- AdjacencyListGraph
-
trait
InnerNodeOps extends AnyRef
- Definition Classes
- EdgeOps
-
trait
InnerNodeState extends AnyRef
- Definition Classes
- State
-
trait
InnerNodeTraversalImpl extends (GraphTraversalImpl.this)#TraverserInnerNode with (GraphTraversalImpl.this)#InnerNodeState
- Definition Classes
- GraphTraversalImpl
-
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
-
case class
Layer extends Product with Serializable
- Definition Classes
- GraphTraversal
-
final
class
LayeredTopologicalOrder[+A] extends AbstractTopologicalOrder[A, (Int, Iterable[A])]
- Definition Classes
- GraphTraversal
-
type
Layers = Traversable[Layer]
- Definition Classes
- GraphTraversal
-
abstract
class
LazyPath extends (GraphTraversalImpl.this)#Path
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
final
class
MapPathTraversable[T] extends Traversable[T]
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
class
MinWeightEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
class
MultiEdgeLazyCycle extends (GraphTraversalImpl.this)#MultiEdgeLazyPath with (GraphTraversalImpl.this)#Cycle
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
class
MultiEdgeLazyPath extends (GraphTraversalImpl.this)#LazyPath
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
trait
Node extends Serializable
- Definition Classes
- GraphBase
-
final
class
NodeBase extends scalax.collection.mutable.DefaultGraphImpl.InnerNodeImpl with scalax.collection.mutable.DefaultGraphImpl.InnerNodeTraversalImpl
- Attributes
- protected
- Definition Classes
- DefaultGraphImpl
- Annotations
- @SerialVersionUID()
-
type
NodeFilter = (NodeT) ⇒ Boolean
- Definition Classes
- GraphBase
-
sealed
trait
NodeOrdering extends Ordering[scalax.collection.GraphBase.NodeT] with ElemOrdering
- Definition Classes
- GraphBase
-
class
NodeSet extends scalax.collection.mutable.AdjacencyListGraph.This.NodeSet with scalax.collection.mutable.AdjacencyListGraph.This.NodeSet
- Definition Classes
- AdjacencyListGraph
-
type
NodeSetT = NodeSet
- Definition Classes
- AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphBase
-
type
NodeT = NodeBase
- Definition Classes
- DefaultGraphImpl → GraphTraversalImpl → AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphTraversal → GraphBase
-
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
-
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
-
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
-
case class
OuterNodeTraverser extends (GraphTraversalImpl.this)#OuterNodeTraverser with (GraphTraversalImpl.this)#Impl[N, (GraphTraversalImpl.this)#OuterNodeTraverser] with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
trait
Path extends Walk
- Definition Classes
- GraphTraversal
-
class
PathBuilder extends (GraphTraversalImpl.this)#WalkBuilder with (GraphTraversalImpl.this)#PathBuilder
- Definition Classes
- GraphTraversalImpl
-
trait
Properties extends SubgraphProperties
- Attributes
- protected
- Definition Classes
- GraphTraversal
-
final
class
ReverseStackTraversable[S <: NodeElement] extends Traversable[(GraphTraversalImpl.this)#NodeT]
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
type
Self = DefaultGraphImpl[Rule, LDiEdge]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
abstract
class
SimpleLazyPath extends (GraphTraversalImpl.this)#LazyPath
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
class
StrongComponentImpl extends (GraphTraversalImpl.this)#Component
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
case class
StrongComponentTraverser extends (GraphTraversalImpl.this)#StrongComponentTraverser with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
trait
SubgraphProperties extends AnyRef
- Attributes
- protected
- Definition Classes
- GraphTraversal
-
type
ThisGraph = RuleDependencyGraph.this.type
- Attributes
- protected
- Definition Classes
- GraphLike
-
type
TopoSortSetup = (Buffer[NodeT], Map[NodeT, Int], Option[NodeT])
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
final
class
TopologicalOrder[+A] extends AbstractTopologicalOrder[A, A]
- Definition Classes
- GraphTraversal
-
trait
Traverser[A, +This <: Traverser[A, This]] extends TraverserMethods[A, This] with Properties with Traversable[A]
- Definition Classes
- GraphTraversal
-
trait
TraverserInnerNode extends scalax.collection.GraphTraversal.InnerNode
- Definition Classes
- GraphTraversal
-
abstract
class
TraverserMethods[A, +This <: TraverserMethods[A, This]] extends FluentProperties[This]
- Attributes
- protected
- Definition Classes
- GraphTraversal
-
trait
Walk extends Traversable[scalax.collection.GraphTraversal.InnerElem]
- Definition Classes
- GraphTraversal
-
class
WalkBuilder extends (GraphTraversalImpl.this)#WalkBuilder
- Definition Classes
- GraphTraversalImpl
-
class
WeakComponentImpl extends (GraphTraversalImpl.this)#Component
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
class
Weight extends AnyRef
- Definition Classes
- GraphTraversal
-
class
WithFilter extends FilterMonadic[A, Repr]
- Definition Classes
- TraversableLike
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
&(that: GenSet[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- GenSetLike
-
def
&=(coll: Iterable[Param[Rule, LDiEdge]]): RuleDependencyGraph.this.type
- Definition Classes
- GraphLike
-
def
&~(that: GenSet[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- GenSetLike
-
def
+(node: Rule): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- GraphLike → GraphLike
-
def
+(elem: Param[Rule, LDiEdge]): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- GraphLike → SetLike → GenSetLike
-
def
+(elem1: Param[Rule, LDiEdge], elem2: Param[Rule, LDiEdge], elems: Param[Rule, LDiEdge]*): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- SetLike
-
final
def
+#(edge: LDiEdge[Rule]): DefaultGraphImpl[Rule, LDiEdge]
- Attributes
- protected
- Definition Classes
- GraphLike → GraphLike
- Annotations
- @inline()
-
def
++(elems: GenTraversableOnce[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- GraphLike → SetLike
-
def
++[B >: Param[Rule, LDiEdge], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: Param[Rule, LDiEdge], That](that: Traversable[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: Param[Rule, LDiEdge], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That
- Definition Classes
- TraversableLike
-
def
++=(xs: TraversableOnce[Param[Rule, LDiEdge]]): RuleDependencyGraph.this.type
- Definition Classes
- GraphLike → Growable
-
def
+=(elem: Param[Rule, LDiEdge]): RuleDependencyGraph.this.type
- Definition Classes
- GraphLike → Growable
-
final
def
+=(node: Rule): RuleDependencyGraph.this.type
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
def
+=(elem1: Param[Rule, LDiEdge], elem2: Param[Rule, LDiEdge], elems: Param[Rule, LDiEdge]*): RuleDependencyGraph.this.type
- Definition Classes
- Growable
-
final
def
+=#(edge: LDiEdge[Rule]): RuleDependencyGraph.this.type
- Attributes
- protected
- Definition Classes
- AdjacencyListGraph → GraphLike
- Annotations
- @inline()
-
final
def
+~%+=[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: Rule, node_2: Rule, nodes: Rule*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): RuleDependencyGraph.this.type
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
+~%+=[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: Rule, node_2: Rule)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): RuleDependencyGraph.this.type
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
+~%=[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: Rule, node_2: Rule, nodes: Rule*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): RuleDependencyGraph.this.type
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
+~%=[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: Rule, node_2: Rule)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): RuleDependencyGraph.this.type
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
+~+=[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: Rule, node_2: Rule, nodes: Rule*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): RuleDependencyGraph.this.type
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
+~+=[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: Rule, node_2: Rule)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): RuleDependencyGraph.this.type
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
+~=(node_1: Rule, node_2: Rule, nodes: Rule*)(implicit edgeFactory: HyperEdgeCompanion[LDiEdge], endpointsKind: CollectionKind): RuleDependencyGraph.this.type
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
+~=(node_1: Rule, node_2: Rule)(implicit edgeFactory: EdgeCompanion[LDiEdge]): RuleDependencyGraph.this.type
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
-(edge: LDiEdge[Rule]): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
def
-(node: Rule): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- GraphLike → GraphLike
- Annotations
- @inline()
-
def
-(elem: Param[Rule, LDiEdge]): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- GraphLike → SetLike → Subtractable → GenSetLike
-
def
-(elem1: Param[Rule, LDiEdge], elem2: Param[Rule, LDiEdge], elems: Param[Rule, LDiEdge]*): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- Subtractable
-
final
def
-!(edge: LDiEdge[Rule]): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
def
-!(elem: Param[Rule, LDiEdge]): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- GraphLike
-
final
def
-!#(edge: LDiEdge[Rule]): DefaultGraphImpl[Rule, LDiEdge]
- Attributes
- protected
- Definition Classes
- GraphLike → GraphLike
- Annotations
- @inline()
-
def
-!=(elem: Param[Rule, LDiEdge]): RuleDependencyGraph.this.type
- Definition Classes
- GraphLike
-
final
def
-!=#(edge: LDiEdge[Rule]): RuleDependencyGraph.this.type
- Attributes
- protected
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
def
-#(edge: LDiEdge[Rule]): DefaultGraphImpl[Rule, LDiEdge]
- Attributes
- protected
- Definition Classes
- GraphLike → GraphLike
- Annotations
- @inline()
-
def
--(elems: GenTraversableOnce[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- GraphLike → Subtractable
-
def
--!(elems: GenTraversableOnce[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- GraphLike
-
final
def
--!=(coll: Iterable[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
def
--=(xs: TraversableOnce[Param[Rule, LDiEdge]]): RuleDependencyGraph.this.type
- Definition Classes
- Shrinkable
-
def
-=(elem: Param[Rule, LDiEdge]): RuleDependencyGraph.this.type
- Definition Classes
- GraphLike → Shrinkable
-
final
def
-=(node: Rule): RuleDependencyGraph.this.type
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
def
-=(elem1: Param[Rule, LDiEdge], elem2: Param[Rule, LDiEdge], elems: Param[Rule, LDiEdge]*): RuleDependencyGraph.this.type
- Definition Classes
- Shrinkable
-
final
def
-=#(edge: LDiEdge[Rule]): RuleDependencyGraph.this.type
- Attributes
- protected
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
def
-?(node: Rule): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- GraphLike → GraphLike
- Annotations
- @inline()
-
final
def
-?=(node: Rule): RuleDependencyGraph.this.type
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
add(edge: LDiEdge[Rule]): Boolean
- Definition Classes
- AdjacencyListGraph → GraphLike
- Annotations
- @inline()
-
final
def
add(node: Rule): Boolean
- Definition Classes
- AdjacencyListGraph → GraphLike
- Annotations
- @inline()
-
final
def
addAndGet(edge: LDiEdge[Rule]): EdgeT
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
def
addAndGet(node: Rule): NodeT
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
def
addAndGetEdge(node_1: Rule, node_2: Rule, nodes: Rule*)(implicit edgeFactory: HyperEdgeCompanion[LDiEdge], endpointsKind: CollectionKind): EdgeT
- Definition Classes
- EdgeOps
-
final
def
addAndGetEdge(node_1: Rule, node_2: Rule)(implicit edgeFactory: EdgeCompanion[LDiEdge]): EdgeT
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
def
addAndGetLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: Rule, node_2: Rule, nodes: Rule*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): EdgeT
- Definition Classes
- EdgeOps
-
final
def
addAndGetLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: Rule, node_2: Rule)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): EdgeT
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
def
addAndGetWEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: Rule, node_2: Rule, nodes: Rule*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): EdgeT
- Definition Classes
- EdgeOps
-
final
def
addAndGetWEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: Rule, node_2: Rule)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): EdgeT
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
def
addAndGetWLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: Rule, node_2: Rule, nodes: Rule*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): EdgeT
- Definition Classes
- EdgeOps
-
final
def
addAndGetWLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: Rule, node_2: Rule)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): EdgeT
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
addEdge(node_1: Rule, node_2: Rule, nodes: Rule*)(implicit edgeFactory: HyperEdgeCompanion[LDiEdge], endpointsKind: CollectionKind): Boolean
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
addEdge(node_1: Rule, node_2: Rule)(implicit edgeFactory: EdgeCompanion[LDiEdge]): Boolean
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
addLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: Rule, node_2: Rule, nodes: Rule*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): Boolean
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
addLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: Rule, node_2: Rule)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): Boolean
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- TraversableOnce
-
final
def
addWEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: Rule, node_2: Rule, nodes: Rule*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): Boolean
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
addWEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: Rule, node_2: Rule)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): Boolean
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
addWLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: Rule, node_2: Rule, nodes: Rule*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): Boolean
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
addWLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: Rule, node_2: Rule)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): Boolean
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
def
aggregate[B](z: ⇒ B)(seqop: (B, Param[Rule, LDiEdge]) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
andThen[A](g: (Boolean) ⇒ A): (Param[Rule, LDiEdge]) ⇒ A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
final
val
anyEdge: EdgeFilter
- Definition Classes
- GraphBase
-
final
def
anyEdgeSelector(from: NodeT, to: NodeT): Option[EdgeT]
- Definition Classes
- GraphTraversal
- Annotations
- @inline()
-
final
val
anyNode: NodeFilter
- Definition Classes
- GraphBase
-
final
lazy val
anyOrdering: AnyOrdering[Rule]
- Attributes
- protected
- Definition Classes
- GraphBase
-
def
apply(elem: Param[Rule, LDiEdge]): Boolean
- Definition Classes
- GenSetLike → Function1
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
asSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String
- Definition Classes
- GraphLike
-
final
def
bulkOp(elems: GenTraversableOnce[Param[Rule, LDiEdge]], isPlusPlus: Boolean): DefaultGraphImpl[Rule, LDiEdge]
- Attributes
- protected
- Definition Classes
- GraphLike
-
def
canEqual(that: Any): Boolean
- Definition Classes
- IterableLike → Equals
-
final
def
clear(): Unit
- Definition Classes
- AdjacencyListGraph → Growable → Clearable
- Annotations
- @inline()
-
def
clearNodeStates(flags: FlagWord, flagsExt: ExtBitSet): Unit
- Attributes
- protected
- Definition Classes
- State
-
final
def
clone(): RuleDependencyGraph.this.type
- Definition Classes
- DefaultGraphImpl → GraphLike → Cloneable → AnyRef
-
def
collect[B, That](pf: PartialFunction[Param[Rule, LDiEdge], B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[Param[Rule, LDiEdge], B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
companion: GenericCompanion[Set]
- Definition Classes
- Set → GenSet → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
-
def
componentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): ComponentTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
def
compose[A](g: (A) ⇒ Param[Rule, LDiEdge]): (A) ⇒ Boolean
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
implicit
val
config: scalax.collection.mutable.DefaultGraphImpl.Config with AdjacencyListArrayConfig
- Definition Classes
- DefaultGraphImpl → GraphLike
-
def
contains(elem: Param[Rule, LDiEdge]): Boolean
- Definition Classes
- GraphLike → SetLike → GenSetLike
-
def
copyToArray[B >: Param[Rule, LDiEdge]](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: Param[Rule, LDiEdge]](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: Param[Rule, LDiEdge]](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: Param[Rule, LDiEdge]](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: (Param[Rule, LDiEdge]) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
cycle(results: Option[(NodeT, ArrayStack[CycleStackElem])], edgeFilter: EdgeFilter): Option[Cycle]
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
final
def
cycle(maybeStart: Option[NodeT], stack: ArrayStack[Element], edgeFilter: EdgeFilter): Option[Cycle]
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
final
lazy val
defaultEdgeOrdering: EdgeOrdering
- Definition Classes
- GraphBase
-
final
lazy val
defaultNodeOrdering: NodeOrdering
- Definition Classes
- GraphBase
-
final
def
defaultPathSize: Int
- Attributes
- protected
- Definition Classes
- GraphTraversal
- Annotations
- @inline()
-
def
degreeCount(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, Int]
- Definition Classes
- GraphDegree
-
def
degreeNodeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[DegreeNodeSeqEntry]
- Definition Classes
- GraphDegree
-
def
degreeNodesMap(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, AnySet[NodeT]]
- Definition Classes
- GraphDegree
-
def
degreeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[Int]
- Definition Classes
- GraphDegree
-
def
degreeSet(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedSet[Int]
- Definition Classes
- GraphDegree
-
def
diff(that: GenSet[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- SetLike → GenSetLike
-
def
drop(n: Int): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
dropRight(n: Int): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- IterableLike
-
def
dropWhile(p: (Param[Rule, LDiEdge]) ⇒ Boolean): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
dump(store: FlagStore): ExtBitSet
- Attributes
- protected
- Definition Classes
- State
-
def
dumpDirty: ExtBitSet
- Definition Classes
- State
-
def
dumpInUse: ExtBitSet
- Definition Classes
- State
-
def
edgeIterator: GroupIterator[EdgeT] { ... /* 2 definitions in type refinement */ }
- Definition Classes
- AdjacencyListBase
-
implicit
val
edgeT: ClassTag[LDiEdge[Rule]]
- Definition Classes
- DefaultGraphImpl → GraphLike
-
implicit final
def
edgeToEdgeCont(e: LDiEdge[Rule]): LDiEdge[NodeT]
- Attributes
- protected
- Definition Classes
- GraphBase
-
final
def
edges: EdgeSetT
- Definition Classes
- DefaultGraphImpl → AdjacencyListGraph → GraphBase
- Annotations
- @inline()
-
final
def
empty: DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- DefaultGraphImpl → Graph → Graph → SetLike → GenericSetTemplate
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- GraphLike → GenSetLike → Equals → AnyRef → Any
-
def
exists(p: (Param[Rule, LDiEdge]) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
expectedMaxNodes(divisor: Int, min: Int): Int
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
def
filter(p: (Param[Rule, LDiEdge]) ⇒ Boolean): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: (Param[Rule, LDiEdge]) ⇒ Boolean): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
find(outerEdge: LDiEdge[Rule]): Option[EdgeT]
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
def
find(outerNode: Rule): Option[NodeT]
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
def
find(p: (Param[Rule, LDiEdge]) ⇒ Boolean): Option[Param[Rule, LDiEdge]]
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
findCycle[U](implicit visitor: (InnerElem) ⇒ U): Option[Cycle]
- Definition Classes
- GraphTraversal
-
final
def
findCycleContaining[U](node: NodeT)(implicit visitor: (InnerElem) ⇒ U): Option[Cycle]
- Definition Classes
- GraphTraversal
-
def
flatMap[B, That](f: (Param[Rule, LDiEdge]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: (Param[Rule, LDiEdge]) ⇒ GenTraversableOnce[B]): Set[B]
- Definition Classes
- GenericTraversableTemplate
-
def
fold[A1 >: Param[Rule, LDiEdge]](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, Param[Rule, LDiEdge]) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: (Param[Rule, LDiEdge], B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
final
def
forInDegrees(traversable: Traversable[NodeT] with SubgraphProperties, maybeHandle: Option[Handle], includeAnyway: Option[NodeT], includeInDegree: NodeFilter, fillInDegrees: Boolean): TopoSortSetup
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
def
forall(p: (Param[Rule, LDiEdge]) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: (Param[Rule, LDiEdge]) ⇒ U): Unit
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
def
genericBuilder[B]: Builder[B, Set[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
get(outerEdge: LDiEdge[Rule]): EdgeT
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
def
get(outerNode: Rule): NodeT
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
getOrElse(outerEdge: LDiEdge[Rule], default: EdgeT): EdgeT
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
def
getOrElse(outerNode: Rule, default: NodeT): NodeT
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
val
graphCompanion: DefaultGraphImpl.type
- Definition Classes
- DefaultGraphImpl → GraphLike
-
def
graphSize: Int
- Definition Classes
- GraphBase
-
def
groupBy[K](f: (Param[Rule, LDiEdge]) ⇒ K): Map[K, DefaultGraphImpl[Rule, LDiEdge]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
grouped(size: Int): Iterator[DefaultGraphImpl[Rule, LDiEdge]]
- Definition Classes
- IterableLike
-
def
hasCycle(): Boolean
Returns true if there is a cycle in the graph, i.e.
Returns true if there is a cycle in the graph, i.e. either
- there is a path n1 -> n2 -> ... -> n1 or - a loop, i.e. an edge that connects a vertex to itself.
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
hashCode(): Int
- Definition Classes
- GenSetLike → AnyRef → Any
-
def
having(node: NodeFilter, edge: EdgeFilter): PartialFunction[Param[Rule, LDiEdge], Boolean]
- Definition Classes
- GraphLike
-
def
head: Param[Rule, LDiEdge]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
headOption: Option[Param[Rule, LDiEdge]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
init: DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
initialize(nodes: Traversable[Rule], edges: Traversable[LDiEdge[Rule]]): Unit
- Attributes
- protected
- Definition Classes
- GraphBase
-
def
initializeFrom(in: ObjectInputStream, nodes: NodeSetT, edges: EdgeSetT): Unit
- Attributes
- protected
- Definition Classes
- AdjacencyListBase
-
def
inits: Iterator[DefaultGraphImpl[Rule, LDiEdge]]
- Definition Classes
- TraversableLike
-
def
innerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerEdgeTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
def
innerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerElemTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
def
innerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerNodeDownUpTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
def
innerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerNodeTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
def
intersect(that: GenSet[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- GenSetLike
-
final
def
isAcyclic: Boolean
- Definition Classes
- GraphTraversal
- Annotations
- @inline()
-
def
isComplete: Boolean
- Definition Classes
- GraphTraversal
-
def
isConnected: Boolean
- Definition Classes
- GraphTraversal
-
final
def
isCustomEdgeFilter(f: EdgeFilter): Boolean
- Definition Classes
- GraphBase
- Annotations
- @inline()
-
final
def
isCustomNodeFilter(f: NodeFilter): Boolean
- Definition Classes
- GraphBase
- Annotations
- @inline()
-
final
def
isCyclic: Boolean
- Definition Classes
- GraphTraversal
- Annotations
- @inline()
-
def
isDirected: Boolean
- Definition Classes
- GraphLike → GraphBase
-
final
val
isDirectedT: Boolean
- Attributes
- protected
- Definition Classes
- GraphLike
-
def
isEmpty: Boolean
- Definition Classes
- SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
isHyper: Boolean
- Definition Classes
- GraphLike → GraphBase
-
final
val
isHyperT: Boolean
- Attributes
- protected
- Definition Classes
- GraphLike
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isMixed: Boolean
- Definition Classes
- GraphLike → GraphBase
-
def
isMulti: Boolean
- Definition Classes
- GraphLike → GraphBase
-
final
val
isMultiT: Boolean
- Attributes
- protected
- Definition Classes
- GraphLike
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
final
def
isTrivial: Boolean
- Definition Classes
- GraphBase
- Annotations
- @inline()
-
def
iterator: Iterator[Param[Rule, LDiEdge]]
- Definition Classes
- GraphLike → GenSetLike → IterableLike → GenIterableLike
-
def
last: Param[Rule, LDiEdge]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[Param[Rule, LDiEdge]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
layers(): Traversable[(Int, Iterable[Rule])]
Applies topological sort and returns the resulting layers.
Applies topological sort and returns the resulting layers. Each layer contains its level and a set of rules.
- returns
the layers
-
def
loopNodes(): Set[NodeBase]
Returns all nodes that are connected by an edge to itself.
-
def
map[B, That](f: (Param[Rule, LDiEdge]) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That
- Definition Classes
- SetLike → TraversableLike → GenTraversableLike → FilterMonadic
- Annotations
- @migration
- Migration
(Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.
-
def
max[B >: Param[Rule, LDiEdge]](implicit cmp: Ordering[B]): Param[Rule, LDiEdge]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: (Param[Rule, LDiEdge]) ⇒ B)(implicit cmp: Ordering[B]): Param[Rule, LDiEdge]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
- Definition Classes
- GraphDegree
-
def
min[B >: Param[Rule, LDiEdge]](implicit cmp: Ordering[B]): Param[Rule, LDiEdge]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (Param[Rule, LDiEdge]) ⇒ B)(implicit cmp: Ordering[B]): Param[Rule, LDiEdge]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
- Definition Classes
- GraphDegree
-
def
minusMinus(delNodes: Traversable[Rule], delEdges: Traversable[LDiEdge[Rule]]): DefaultGraphImpl[Rule, LDiEdge]
- Attributes
- protected
- Definition Classes
- GraphLike
-
def
minusMinusNodesEdges(delNodes: Traversable[Rule], delEdges: Traversable[LDiEdge[Rule]]): (Set[Rule], Set[LDiEdge[Rule]])
- Attributes
- protected
- Definition Classes
- GraphLike
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: GraphBuilder[Rule, LDiEdge, DefaultGraphImpl]
- Attributes
- protected[this]
- Definition Classes
- DefaultGraphImpl → SetLike → GenericTraversableTemplate → TraversableLike → HasNewBuilder
-
final
def
newEdge(innerEdge: LDiEdge[NodeT]): EdgeT
- Attributes
- protected
- Definition Classes
- AdjacencyListGraph → GraphBase
- Annotations
- @inline()
-
final
def
newEdgeTArray(size: Int): Array[EdgeT]
- Definition Classes
- AdjacencyListGraph → AdjacencyListBase
- Annotations
- @inline()
-
final
def
newNode(n: Rule): NodeT
- Attributes
- protected
- Definition Classes
- AdjacencyListBase → GraphBase
- Annotations
- @inline()
-
final
def
newNodeSet: NodeSetT
- Attributes
- protected
- Definition Classes
- DefaultGraphImpl → AdjacencyListBase
- Annotations
- @inline()
-
final
def
newNodeWithHints(n: Rule, h: Hints): NodeBase
- Attributes
- protected
- Definition Classes
- DefaultGraphImpl → AdjacencyListBase
- Annotations
- @inline()
-
def
newPathBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): PathBuilder
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
def
newWalkBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): WalkBuilder
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
def
nextHandle: Handle
- Attributes
- protected
- Definition Classes
- State
-
final
val
noNode: NodeFilter
- Definition Classes
- GraphBase
-
final
def
nodes: NodeSetT
- Definition Classes
- DefaultGraphImpl → AdjacencyListGraph → GraphBase
- Annotations
- @inline()
-
def
nodesToCEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with CHyperEdgeBound[_, EE]](factory: CHyperEdgeCompanion[EE], attrib: Product, node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): LDiEdge[NodeT]
- Attributes
- protected[collection]
- Definition Classes
- EdgeOps
-
def
nodesToCEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with CEdgeBound[_, EE]](factory: CEdgeCompanion[EE], attrib: Product, node_1: Rule, node_2: Rule): LDiEdge[NodeT]
- Attributes
- protected[collection]
- Definition Classes
- EdgeOps
-
final
def
nodesToEdge(edgeFactory: HyperEdgeCompanion[LDiEdge], node_1: Rule, node_2: Rule, nodes: Rule*)(implicit endpointsKind: CollectionKind): EdgeT
- Attributes
- protected
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
nodesToEdge(edgeFactory: EdgeCompanion[LDiEdge], node_1: Rule, node_2: Rule): EdgeT
- Attributes
- protected
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
def
nodesToEdgeCont(factory: EdgeCompanion[LDiEdge], node_1: Rule, node_2: Rule): LDiEdge[NodeT]
- Attributes
- protected[collection]
- Definition Classes
- EdgeOps
-
def
nodesToEdgeCont(factory: HyperEdgeCompanion[LDiEdge], node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): LDiEdge[NodeT]
- Attributes
- protected[collection]
- Definition Classes
- EdgeOps
-
final
def
nodesToLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](edgeFactory: LHyperEdgeCompanion[EE], label: L, node_1: Rule, node_2: Rule, nodes: Rule*): EdgeT
- Attributes
- protected
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
nodesToLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](edgeFactory: LEdgeCompanion[EE], label: L, node_1: Rule, node_2: Rule): EdgeT
- Attributes
- protected
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
def
nodesToLEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](factory: LEdgeCompanion[EE], label: L, node_1: Rule, node_2: Rule): LDiEdge[NodeT]
- Attributes
- protected[collection]
- Definition Classes
- EdgeOps
-
def
nodesToLEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](factory: LHyperEdgeCompanion[EE], label: L, node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): LDiEdge[NodeT]
- Attributes
- protected[collection]
- Definition Classes
- EdgeOps
-
final
def
nodesToWEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](edgeFactory: WHyperEdgeCompanion[EE], weight: Double, node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): EdgeT
- Attributes
- protected
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
nodesToWEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](edgeFactory: WEdgeCompanion[EE], weight: Double, node_1: Rule, node_2: Rule): EdgeT
- Attributes
- protected
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
def
nodesToWEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](factory: WEdgeCompanion[EE], weight: Double, node_1: Rule, node_2: Rule): LDiEdge[NodeT]
- Attributes
- protected[collection]
- Definition Classes
- EdgeOps
-
def
nodesToWEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](factory: WHyperEdgeCompanion[EE], weight: Double, node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): LDiEdge[NodeT]
- Attributes
- protected[collection]
- Definition Classes
- EdgeOps
-
final
def
nodesToWLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](edgeFactory: WLHyperEdgeCompanion[EE], weight: Double, label: L, node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): EdgeT
- Attributes
- protected
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
nodesToWLEdge[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](edgeFactory: WLEdgeCompanion[EE], weight: Double, label: L, node_1: Rule, node_2: Rule): EdgeT
- Attributes
- protected
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
def
nodesToWLEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](factory: WLEdgeCompanion[EE], weight: Double, label: L, node_1: Rule, node_2: Rule): LDiEdge[NodeT]
- Attributes
- protected[collection]
- Definition Classes
- EdgeOps
-
def
nodesToWLEdgeCont[EE[X] <: LDiEdge[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](factory: WLHyperEdgeCompanion[EE], weight: Double, label: L, node_1: Rule, node_2: Rule, nodes: Rule*)(implicit kind: CollectionKind): LDiEdge[NodeT]
- Attributes
- protected[collection]
- Definition Classes
- EdgeOps
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
nonTrivial: Boolean
- Definition Classes
- GraphBase
- Annotations
- @inline()
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
order: Int
- Definition Classes
- GraphBase
-
def
outerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterEdgeTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
def
outerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterElemTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
def
outerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterNodeDownUpTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
def
outerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterNodeTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
def
par: ParSet[Param[Rule, LDiEdge]]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[Param[Rule, LDiEdge], ParSet[Param[Rule, LDiEdge]]]
- Attributes
- protected[this]
- Definition Classes
- SetLike → TraversableLike → Parallelizable
-
final
def
partition(elems: GenTraversableOnce[Param[Rule, LDiEdge]]): Partitions[Rule, LDiEdge]
- Attributes
- protected
- Definition Classes
- GraphLike
-
def
partition(p: (Param[Rule, LDiEdge]) ⇒ Boolean): (DefaultGraphImpl[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
plusPlus(newNodes: Traversable[Rule], newEdges: Traversable[LDiEdge[Rule]]): DefaultGraphImpl[Rule, LDiEdge]
- Attributes
- protected
- Definition Classes
- GraphLike
-
def
printNodes(): String
- returns
a simple string representation of this graph
-
def
product[B >: Param[Rule, LDiEdge]](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: Param[Rule, LDiEdge]](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: Param[Rule, LDiEdge]](op: (B, Param[Rule, LDiEdge]) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: Param[Rule, LDiEdge]](op: (B, Param[Rule, LDiEdge]) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: Param[Rule, LDiEdge]](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: Param[Rule, LDiEdge]](op: (Param[Rule, LDiEdge], B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: Param[Rule, LDiEdge]](op: (Param[Rule, LDiEdge], B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
releaseHandle(handle: Handle): Unit
- Attributes
- protected
- Definition Classes
- State
-
final
def
remove(edge: LDiEdge[Rule]): Boolean
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
def
remove(node: Rule): Boolean
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
def
removeGently(node: Rule): Boolean
- Definition Classes
- GraphLike
-
final
def
removeWithNodes(edge: LDiEdge[Rule]): Boolean
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
def
repr: DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
reversed: List[Param[Rule, LDiEdge]]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
rules(): Set[Rule]
This converts the graph-specific inner nodes to its corresponding outer nodes which may exist outside a graph context.
This converts the graph-specific inner nodes to its corresponding outer nodes which may exist outside a graph context.
- returns
the set of rules contained in this graph
-
def
sameElements[B >: Param[Rule, LDiEdge]](that: GenIterable[B]): Boolean
- Definition Classes
- IterableLike → GenIterableLike
-
def
scan[B >: Param[Rule, LDiEdge], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, Param[Rule, LDiEdge]) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: (Param[Rule, LDiEdge], B) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
- Annotations
- @migration
- Migration
(Changed in version 2.9.0) The behavior of
scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
-
def
seq: Set[Param[Rule, LDiEdge]]
- Definition Classes
- Set → GenSet → GenSetLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
final
def
serializeTo(out: ObjectOutputStream): Unit
- Attributes
- protected
- Definition Classes
- AdjacencyListBase
-
def
size: Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
sizeHintIfCheap: Int
- Attributes
- protected[collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
sliding(size: Int, step: Int): Iterator[DefaultGraphImpl[Rule, LDiEdge]]
- Definition Classes
- IterableLike
-
def
sliding(size: Int): Iterator[DefaultGraphImpl[Rule, LDiEdge]]
- Definition Classes
- IterableLike
-
def
span(p: (Param[Rule, LDiEdge]) ⇒ Boolean): (DefaultGraphImpl[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (DefaultGraphImpl[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
stringPrefix: String
- Definition Classes
- GraphLike → SetLike → TraversableLike → GenTraversableLike
-
def
strongComponentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): StrongComponentTraverser
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
def
subsetOf(that: GenSet[Param[Rule, LDiEdge]]): Boolean
- Definition Classes
- GenSetLike
-
def
subsets(): Iterator[DefaultGraphImpl[Rule, LDiEdge]]
- Definition Classes
- SetLike
-
def
subsets(len: Int): Iterator[DefaultGraphImpl[Rule, LDiEdge]]
- Definition Classes
- SetLike
-
def
sum[B >: Param[Rule, LDiEdge]](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[DefaultGraphImpl[Rule, LDiEdge]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
takeRight(n: Int): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- IterableLike
-
def
takeWhile(p: (Param[Rule, LDiEdge]) ⇒ Boolean): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
thisCollection: Iterable[Param[Rule, LDiEdge]]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Param[Rule, LDiEdge], Col[Param[Rule, LDiEdge]]]): Col[Param[Rule, LDiEdge]]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: Param[Rule, LDiEdge]](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[A1 >: Param[Rule, LDiEdge]]: Buffer[A1]
- Definition Classes
- SetLike → TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: DefaultGraphImpl[Rule, LDiEdge]): Iterable[Param[Rule, LDiEdge]]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
def
toIndexedSeq: IndexedSeq[Param[Rule, LDiEdge]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[Param[Rule, LDiEdge]]
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[Param[Rule, LDiEdge]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toList: List[Param[Rule, LDiEdge]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[Param[Rule, LDiEdge], (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSeq: Seq[Param[Rule, LDiEdge]]
- Definition Classes
- SetLike → TraversableOnce → GenTraversableOnce
-
def
toSet[B >: Param[Rule, LDiEdge]]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String
- Definition Classes
- GraphLike
-
def
toStream: Stream[Param[Rule, LDiEdge]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
-
def
toString(): String
- Definition Classes
- GraphLike → SetLike → Function1 → TraversableLike → AnyRef → Any
-
def
toTraversable: Traversable[Param[Rule, LDiEdge]]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[Param[Rule, LDiEdge]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
topologicalSort[U](implicit visitor: (InnerElem) ⇒ U): CycleNodeOrTopologicalOrder
- Definition Classes
- GraphTraversal
-
final
def
topologicalSortByComponent[U](implicit visitor: (InnerElem) ⇒ U): Traversable[CycleNodeOrTopologicalOrder]
- Definition Classes
- GraphTraversal
-
def
totalDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
- Definition Classes
- GraphDegree
-
def
totalWeight: Double
- Definition Classes
- GraphBase
-
def
transpose[B](implicit asTraversable: (Param[Rule, LDiEdge]) ⇒ GenTraversableOnce[B]): Set[Set[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transpose
throws anIllegalArgumentException
if collections are not uniformly sized.
-
def
union(that: GenSet[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- SetLike → GenSetLike
-
def
unzip[A1, A2](implicit asPair: (Param[Rule, LDiEdge]) ⇒ (A1, A2)): (Set[A1], Set[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: (Param[Rule, LDiEdge]) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
- Definition Classes
- GenericTraversableTemplate
-
final
def
upsert(edge: LDiEdge[Rule]): Boolean
- Definition Classes
- AdjacencyListGraph → GraphLike
- Annotations
- @inline()
-
def
view(from: Int, until: Int): IterableView[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]]
- Definition Classes
- IterableLike → TraversableLike
-
def
view: IterableView[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]]
- Definition Classes
- IterableLike → TraversableLike
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
def
withFilter(p: (Param[Rule, LDiEdge]) ⇒ Boolean): FilterMonadic[Param[Rule, LDiEdge], DefaultGraphImpl[Rule, LDiEdge]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
withHandle[T](reuse: Option[Handle])(block: (Handle) ⇒ T): T
- Attributes
- protected
- Definition Classes
- State
-
def
withHandles[T](nr: Int, reuse: Array[Handle])(block: (Array[Handle]) ⇒ T): T
- Attributes
- protected
- Definition Classes
- State
-
def
zip[A1 >: Param[Rule, LDiEdge], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipAll[B, A1 >: Param[Rule, LDiEdge], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipWithIndex[A1 >: Param[Rule, LDiEdge], That](implicit bf: CanBuildFrom[DefaultGraphImpl[Rule, LDiEdge], (A1, Int), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
|(that: GenSet[Param[Rule, LDiEdge]]): DefaultGraphImpl[Rule, LDiEdge]
- Definition Classes
- GenSetLike
-
object
Edge extends Serializable
- Definition Classes
- GraphBase
- Annotations
- @transient()
-
object
InnerEdge extends Serializable
- Definition Classes
- GraphBase
- Annotations
- @transient()
-
object
InnerNode extends Serializable
- Definition Classes
- GraphBase
-
object
Node extends Serializable
- Definition Classes
- GraphBase
- Annotations
- @transient()
-
object
TraverserInnerNode extends Serializable
- Definition Classes
- GraphTraversal
- Annotations
- @transient()
Deprecated Value Members
-
def
/:[B](z: B)(op: (B, Param[Rule, LDiEdge]) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
- Annotations
- @deprecated
- Deprecated
(Since version 2.12.10) Use foldLeft instead of /:
-
def
:\[B](z: B)(op: (Param[Rule, LDiEdge], B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
- Annotations
- @deprecated
- Deprecated
(Since version 2.12.10) Use foldRight instead of :\