trait GraphLike[N, E[X] <: EdgeLikeIn[X], +This[X, Y[X] <: EdgeLikeIn[X]] <: GraphLike[X, Y[X], This] with AnySet[Param[X, Y[X]]] with Graph[X, Y[X]]] extends SetLike[Param[N, E], This[N, E]] with GraphTraversal[N, E] with GraphBase[N, E] with GraphDegree[N, E]
A template trait for graphs.
This trait provides the common structure and operations of immutable graphs independently of their representation.
If E inherits DirectedEdgeLike the graph is directed, otherwise it is undirected or mixed.
- N
the user type of the nodes (vertices) in this graph.
- E
the higher kinded type of the edges (links) in this graph.
- This
the higher kinded type of the graph itself.
- Alphabetic
- By Inheritance
- GraphLike
- GraphDegree
- GraphTraversal
- GraphBase
- Serializable
- Serializable
- SetLike
- Subtractable
- GenSetLike
- Function1
- IterableLike
- GenIterableLike
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- Equals
- AnyRef
- Any
- by anyToNode
- by CollectionsHaveToParArray
- by MonadOps
- by EdgeAssoc
- by predicateToNodePredicate
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- by alternateImplicit
- Hide All
- Show All
- Public
- All
Type Members
-
trait
Edge extends Serializable
- Definition Classes
- GraphBase
-
sealed
trait
EdgeOrdering extends Ordering[EdgeT] with ElemOrdering
- Definition Classes
- GraphBase
-
sealed
trait
ElemOrdering extends AnyRef
Base trait for graph
Orderings.Base trait for graph
Orderings.- Attributes
- protected
- Definition Classes
- GraphBase
-
sealed
trait
InnerElem extends AnyRef
- Definition Classes
- GraphBase
-
trait
Node extends Serializable
- Definition Classes
- GraphBase
-
sealed
trait
NodeOrdering extends Ordering[NodeT] with ElemOrdering
Ordering for the path dependent type NodeT.
Ordering for the path dependent type NodeT.
- Definition Classes
- GraphBase
-
trait
DegreeFunction extends ((GraphDegree.this)#NodeT) ⇒ Int
- Definition Classes
- GraphDegree
-
final
class
DegreeOrdering extends Ordering[(GraphDegree.this)#NodeT]
Decreasing ordering of nodes with respect to their degree.
Decreasing ordering of nodes with respect to their degree.
- Definition Classes
- GraphDegree
-
trait
Filter[T] extends (T) ⇒ Boolean
- Definition Classes
- GraphDegree
-
abstract
type
Config <: GraphConfig
- Attributes
- protected
-
type
CycleNodeOrTopologicalOrder = Either[(GraphLike.this)#NodeT, (GraphLike.this)#TopologicalOrder[(GraphLike.this)#NodeT]]
Either a
Rightcontaining a valid topological order or aLeftcontaining a node on a cycle.Either a
Rightcontaining a valid topological order or aLeftcontaining a node on a cycle.- Definition Classes
- GraphTraversal
-
type
DegreeNodeSeqEntry = (Int, (GraphLike.this)#NodeT)
Type alias for entries in degree maps returned by
degreeSeqMap.Type alias for entries in degree maps returned by
degreeSeqMap.- Definition Classes
- GraphDegree
- class EdgeBase extends InnerEdgeParam[N, E, (GraphLike.this)#NodeT, E] with (GraphLike.this)#InnerEdge
-
type
EdgeFilter = ((GraphLike.this)#EdgeT) ⇒ Boolean
- Definition Classes
- GraphBase
- trait EdgeSet extends (GraphLike.this)#EdgeSet
- abstract type EdgeSetT <: (GraphLike.this)#EdgeSet
- abstract type EdgeT <: InnerEdgeParam[N, E, (GraphLike.this)#NodeT, E] with (GraphLike.this)#InnerEdge with Serializable
- trait InnerEdge extends (GraphLike.this)#InnerEdge
- trait InnerNode extends (GraphLike.this)#InnerNode with (GraphLike.this)#TraverserInnerNode
-
type
Layers = Traversable[(GraphLike.this)#Layer]
The result of a topological sort in the layered view.
The result of a topological sort in the layered view.
- Definition Classes
- GraphTraversal
-
abstract
class
NodeBase extends (GraphLike.this)#NodeBase with InnerNodeParam[N] with (GraphLike.this)#InnerNode
- Attributes
- protected
-
type
NodeFilter = ((GraphLike.this)#NodeT) ⇒ Boolean
- Definition Classes
- GraphBase
- trait NodeSet extends (GraphLike.this)#NodeSet
- abstract type NodeSetT <: (GraphLike.this)#NodeSet
-
abstract
type
NodeT <: (GraphLike.this)#InnerNode
- Definition Classes
- GraphLike → GraphTraversal → GraphBase
-
type
Self = This[N, E]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
type
ThisGraph = GraphLike.this
- Attributes
- protected
-
class
WithFilter extends FilterMonadic[A, Repr]
- Definition Classes
- TraversableLike
-
sealed abstract
class
AbstractTopologicalOrder[+A, +T] extends AbstractTraversable[T]
Topologically ordered nodes or layers of a topological order of a graph or of an isolated graph component.
Topologically ordered nodes or layers of a topological order of a graph or of an isolated graph component.
- A
one of
NodeT,N- T
one of
Aor(Int, Iterable[A])
- Definition Classes
- GraphTraversal
-
abstract
class
Component extends Properties
Represents a component of
thisgraph.Represents a component of
thisgraph. Edges and bridges are computed lazily. Components will be instantiated by componentTraverser or strongComponentTraverser.- Definition Classes
- GraphTraversal
-
abstract
class
ComponentTraverser extends FluentProperties[ComponentTraverser] with Properties with Traversable[Component]
Controls the properties of graph traversals with no specific root and allows you to produce the (weakly) connected components by a traversal or call methods like
findCyclethat work component-wise.Controls the properties of graph traversals with no specific root and allows you to produce the (weakly) connected components by a traversal or call methods like
findCyclethat work component-wise.- Definition Classes
- GraphTraversal
-
trait
Cycle extends Path
Represents a cycle in this graph listing the nodes and connecting edges on it with the following syntax:
Represents a cycle in this graph listing the nodes and connecting edges on it with the following syntax:
cycle ::= start-end-node { edge node } edge start-end-nodeAll nodes and edges on the path are distinct except the start and end nodes that are equal. A cycle contains at least a start node followed by any number of consecutive pairs of an edge and a node and the end node equaling to the start node. The first element is the start node, the second is an edge with its tail being the start node and its head being the third element etc.
- Definition Classes
- GraphTraversal
-
trait
ExtendedNodeVisitor[U] extends (NodeT) ⇒ U with (NodeT, Int, Int, ⇒ NodeInformer) ⇒ U
Template for extended node visitors.
Template for extended node visitors. While the default node visitor of the type
NodeT => Upasses solely the inner node being visited, extended node visitors pass the following traversal state information:- the inner node currently visited as with a standard node visitor
- the number of nodes visited so far and
- the current depth in terms of the underlying algorithm and
- a reference to a specific informer that may be pattern matched to collect even further data specific to the implementation.
- Definition Classes
- GraphTraversal
-
abstract
class
FluentProperties[+This <: FluentProperties[This]] extends AnyRef
Properties and methods for creating modified properties in a fluent-interface manner.
Properties and methods for creating modified properties in a fluent-interface manner.
- Attributes
- protected
- Definition Classes
- GraphTraversal
-
abstract
class
InnerEdgeTraverser extends TraverserMethods[EdgeT, InnerEdgeTraverser] with Traverser[EdgeT, InnerEdgeTraverser]
Controls the properties of inner-edge graph traversals.
Controls the properties of inner-edge graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.
- Definition Classes
- GraphTraversal
-
abstract
class
InnerElemTraverser extends TraverserMethods[InnerElem, InnerElemTraverser] with Traverser[InnerElem, InnerElemTraverser]
Controls the properties of inner-element graph traversals.
Controls the properties of inner-element graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.
- Attributes
- protected
- Definition Classes
- GraphTraversal
-
abstract
class
InnerNodeDownUpTraverser extends TraverserMethods[(Boolean, NodeT), InnerNodeDownUpTraverser] with Traverser[(Boolean, NodeT), InnerNodeDownUpTraverser]
Controls the properties of inner-node down-up graph traversals.
Controls the properties of inner-node down-up graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.
- Definition Classes
- GraphTraversal
-
abstract
class
InnerNodeTraverser extends TraverserMethods[NodeT, InnerNodeTraverser] with Traverser[NodeT, InnerNodeTraverser]
Controls the properties of inner-node graph traversals.
Controls the properties of inner-node graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.
- Definition Classes
- GraphTraversal
-
case class
Layer(index: Int, nodes: IndexedSeq[NodeT]) extends Product with Serializable
Represents a topological sort layer.
Represents a topological sort layer.
- Definition Classes
- GraphTraversal
-
final
class
LayeredTopologicalOrder[+A] extends AbstractTopologicalOrder[A, (Int, Iterable[A])]
Layers of a topological order of a graph or of an isolated graph component.
Layers of a topological order of a graph or of an isolated graph component. The layers of a topological sort can roughly be defined as follows:
- layer 0 contains all nodes having no predecessors,
- layer n contains those nodes that have only predecessors in anchestor layers with at least one of them contained in layer n - 1
- A
one of
NodeT,N
- Definition Classes
- GraphTraversal
-
abstract
class
OuterEdgeTraverser extends TraverserMethods[E[N], OuterEdgeTraverser] with Traverser[E[N], OuterEdgeTraverser]
Controls the properties of outer-edge graph traversals.
Controls the properties of outer-edge graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.
- Definition Classes
- GraphTraversal
-
trait
OuterElemTraverser extends TraverserMethods[OuterElem[N, E], OuterElemTraverser] with Traverser[OuterElem[N, E], OuterElemTraverser]
Controls the properties of outer-element graph traversals.
Controls the properties of outer-element graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.
- Definition Classes
- GraphTraversal
-
abstract
class
OuterNodeDownUpTraverser extends TraverserMethods[(Boolean, N), OuterNodeDownUpTraverser] with Traverser[(Boolean, N), OuterNodeDownUpTraverser]
Controls the properties of outer-node down-up graph traversals.
Controls the properties of outer-node down-up graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.
- Definition Classes
- GraphTraversal
-
abstract
class
OuterNodeTraverser extends TraverserMethods[N, OuterNodeTraverser] with Traverser[N, OuterNodeTraverser]
Controls the properties of outer-node graph traversals.
Controls the properties of outer-node graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.
- Definition Classes
- GraphTraversal
-
trait
Path extends Walk
Represents a path in this graph where
Represents a path in this graph where
path::= node { edge node }Nodes and edges on the path are distinct. A walk/path contains at least one node followed by any number of consecutive pairs of an edge and a node. The first element is the start node, the second is an edge with its source being the start node and its target being the third element etc.
- Definition Classes
- GraphTraversal
-
trait
PathBuilder extends WalkBuilder with Builder[InnerElem, Path]
A
Builderfor valid paths in this graph.A
Builderfor valid paths in this graph.Nodes and edges may be added either alternating or node by node respectively edge by edge. Either way, the builder ensures that the added elements build a valid path.
A node addition fails if either the node to be added is already contained or the node is not a direct successor of the previously added node or of the target node of the previously added edge. An edge addition fails if either the edge to be added is is already contained or the edge is not an outgoing edge from the previously added node or of the target node of the previously added edge.
It is recommended using
addinstead of+=to track failed additions.- Definition Classes
- GraphTraversal
-
trait
Properties extends SubgraphProperties
Properties controlling traversals.
Properties controlling traversals.
- Attributes
- protected
- Definition Classes
- GraphTraversal
-
abstract
class
StrongComponentTraverser extends FluentProperties[StrongComponentTraverser] with Properties with Traversable[Component]
Controls the properties of graph traversals with no specific root and allows you to produce the strongly connected components by a traversal.
Controls the properties of graph traversals with no specific root and allows you to produce the strongly connected components by a traversal.
- Definition Classes
- GraphTraversal
-
trait
SubgraphProperties extends AnyRef
Properties controlling the scope of traversals.
Properties controlling the scope of traversals.
- Attributes
- protected
- Definition Classes
- GraphTraversal
-
final
class
TopologicalOrder[+A] extends AbstractTopologicalOrder[A, A]
A traversable topological order of nodes of a graph or of an isolated graph component.
A traversable topological order of nodes of a graph or of an isolated graph component.
- A
one of
NodeT,N
- Definition Classes
- GraphTraversal
-
trait
Traverser[A, +This <: Traverser[A, This]] extends TraverserMethods[A, This] with Properties with Traversable[A]
Controls the properties of consecutive graph traversals starting at a root node.
Controls the properties of consecutive graph traversals starting at a root node. Provides methods to refine the properties and to invoke traversals. Instances will be created by innerNodeTraverser etc.
- Definition Classes
- GraphTraversal
-
trait
TraverserInnerNode extends InnerNode
- Definition Classes
- GraphTraversal
-
abstract
class
TraverserMethods[A, +This <: TraverserMethods[A, This]] extends FluentProperties[This]
The
root-related methods Traverser will inherit.The
root-related methods Traverser will inherit.- Attributes
- protected
- Definition Classes
- GraphTraversal
-
trait
Walk extends Traversable[InnerElem]
Represents a walk in this graph where
walk::= node { edge node }A walk/path contains at least one node followed by any number of consecutive pairs of an edge and a node.Represents a walk in this graph where
walk::= node { edge node }A walk/path contains at least one node followed by any number of consecutive pairs of an edge and a node. The first element is the start node, the second is an edge with its source being the start node and its target being the third element etc.- Definition Classes
- GraphTraversal
-
trait
WalkBuilder extends Builder[InnerElem, Walk]
A
Builderfor valid walks in this graph.A
Builderfor valid walks in this graph.Nodes and edges may be added either alternating or node by node respectively edge by edge. Either way, the builder ensures that the added elements build a valid walk.
A node addition fails if the node to be added is not a direct successor of the previously added node or of the target node of the previously added edge. An edge addition fails if the edge to be added is not an outgoing edge from the previously added node or of the target node of the previously added edge.
It is recommended using
addinstead of+=to track failed additions.- Definition Classes
- GraphTraversal
-
class
Weight extends AnyRef
Stores a value and an edge weight function for use in weight-based traversals that may be defined by
withMaxWeight.Stores a value and an edge weight function for use in weight-based traversals that may be defined by
withMaxWeight.- Definition Classes
- GraphTraversal
Abstract Value Members
-
abstract
def
+(node: N): This[N, E]
Creates a new supergraph with an additional node, unless the node passed is already present.
Creates a new supergraph with an additional node, unless the node passed is already present.
- node
the node to be added
- returns
the new supergraph containing all nodes and edges of this graph and
nodeadditionally.
-
abstract
def
+#(edge: E[N]): This[N, E]
Creates a new supergraph with an additional edge, unless the edge passed is already present.
Creates a new supergraph with an additional edge, unless the edge passed is already present.
- edge
the edge to be added
- returns
the new supergraph containing all nodes and edges of this graph plus
edge.
- Attributes
- protected
-
abstract
def
-(node: N): This[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph except
nodeand those edges whichnodeis incident with.Creates a new subgraph consisting of all nodes and edges of this graph except
nodeand those edges whichnodeis incident with.- node
the node to be removed.
- returns
the new subgraph of this graph after the "ripple" deletion of
node.
-
abstract
def
-!#(edge: E[N]): This[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph except
edgeand those nodes which are incident withedgeand would become edge-less after deletion.Creates a new subgraph consisting of all nodes and edges of this graph except
edgeand those nodes which are incident withedgeand would become edge-less after deletion.- edge
the edge to be removed.
- returns
a new subgraph of this graph after the "ripple" deletion of
edgefrom this graph.
- Attributes
- protected
-
abstract
def
-#(edge: E[N]): This[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph but
edge.Creates a new subgraph consisting of all nodes and edges of this graph but
edge. The node set remains unchanged.- edge
the edge to be removed.
- returns
a new subgraph of this graph that contains all nodes and edges of this graph except of
edge.
- Attributes
- protected
-
abstract
def
-?(node: N): This[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph but
nodewhich is conditionally removed from this graph.Creates a new subgraph consisting of all nodes and edges of this graph but
nodewhich is conditionally removed from this graph. The removal only succeeds if the node is not incident with any edges or it is only incident with hooks.- node
the node to be gently removed.
- returns
the new subgraph of this graph after the "gentle" deletion of
node. Ifnodecould not be deleted, the new graph is a copy of this graph.
-
abstract
def
componentTraverser(parameters: Parameters = Parameters(), subgraphNodes: (GraphLike.this)#NodeFilter = anyNode, subgraphEdges: (GraphLike.this)#EdgeFilter = anyEdge, ordering: (GraphLike.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphLike.this)#Weight] = None): (GraphLike.this)#ComponentTraverser
Creates a ComponentTraverser responsible for invoking graph traversal methods in all (weakly) connected components of this possibly disconnected graph.
Creates a ComponentTraverser responsible for invoking graph traversal methods in all (weakly) connected components of this possibly disconnected graph.
- parameters
The properties controlling subsequent traversals.
- subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
- subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
- ordering
If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
- Definition Classes
- GraphTraversal
- implicit abstract def config: generic.GraphCompanion.Config with (GraphLike.this)#Config
- implicit abstract val edgeT: ClassTag[E[N]]
-
abstract
def
edges: (GraphLike.this)#EdgeSetT
The edge set of this
Graphcommonly referred to as E(G).The edge set of this
Graphcommonly referred to as E(G).- returns
Set of all contained edges.
- Definition Classes
- GraphBase
-
abstract
def
empty: This[N, E]
- Definition Classes
- SetLike
-
abstract
val
graphCompanion: GraphCompanion[This]
The companion object of
This. -
abstract
def
innerEdgeTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphLike.this)#NodeFilter = anyNode, subgraphEdges: (GraphLike.this)#EdgeFilter = anyEdge, ordering: (GraphLike.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphLike.this)#Weight] = None): (GraphLike.this)#InnerEdgeTraverser
Creates a InnerEdgeTraverser based on
scala.collection.Traversable[EdgeT].Creates a InnerEdgeTraverser based on
scala.collection.Traversable[EdgeT].- root
The node where subsequent graph traversals start.
- parameters
The properties controlling subsequent traversals.
- subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
- subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
- ordering
If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.
- Definition Classes
- GraphTraversal
-
abstract
def
innerElemTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphLike.this)#NodeFilter = anyNode, subgraphEdges: (GraphLike.this)#EdgeFilter = anyEdge, ordering: (GraphLike.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphLike.this)#Weight] = None): (GraphLike.this)#InnerElemTraverser
Creates a InnerElemTraverser based on
scala.collection.Traversable[InnerElem].Creates a InnerElemTraverser based on
scala.collection.Traversable[InnerElem].- root
The node where subsequent graph traversals start.
- parameters
The properties controlling subsequent traversals.
- subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
- subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
- ordering
If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
- Definition Classes
- GraphTraversal
-
abstract
def
innerNodeDownUpTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphLike.this)#NodeFilter = anyNode, subgraphEdges: (GraphLike.this)#EdgeFilter = anyEdge, ordering: (GraphLike.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphLike.this)#Weight] = None): (GraphLike.this)#InnerNodeDownUpTraverser
Creates a InnerNodeDownUpTraverser based on
scala.collection.Traversable[(Boolean, NodeT)]where theBooleanparameter istrueif the traversal takes place in downward andfalseif it takes place in upward direction.Creates a InnerNodeDownUpTraverser based on
scala.collection.Traversable[(Boolean, NodeT)]where theBooleanparameter istrueif the traversal takes place in downward andfalseif it takes place in upward direction.- root
The node where subsequent graph traversals start.
- parameters
The properties controlling subsequent traversals. A
kinddifferent fromDepthFirstwill be ignored.- subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
- subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
- ordering
If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
- Definition Classes
- GraphTraversal
-
abstract
def
innerNodeTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphLike.this)#NodeFilter = anyNode, subgraphEdges: (GraphLike.this)#EdgeFilter = anyEdge, ordering: (GraphLike.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphLike.this)#Weight] = None): (GraphLike.this)#InnerNodeTraverser
Creates a InnerNodeTraverser based on
scala.collection.Traversable[NodeT].Creates a InnerNodeTraverser based on
scala.collection.Traversable[NodeT].- root
The node where subsequent graph traversals start.
- parameters
The properties controlling subsequent traversals.
- subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
- subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
- ordering
If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
- Definition Classes
- GraphTraversal
-
abstract
def
newEdge(innerEdge: E[(GraphLike.this)#NodeT]): (GraphLike.this)#EdgeT
- Attributes
- protected
- Definition Classes
- GraphBase
-
abstract
def
newNode(n: N): (GraphLike.this)#NodeT
- Attributes
- protected
- Definition Classes
- GraphBase
-
abstract
def
newPathBuilder(start: (GraphLike.this)#NodeT)(implicit sizeHint: Int = defaultPathSize, edgeSelector: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) ⇒ Option[(GraphLike.this)#EdgeT] = anyEdgeSelector): (GraphLike.this)#PathBuilder
Instantiates a PathBuilder for this graph.
Instantiates a PathBuilder for this graph.
- start
The node this path starts at.
- sizeHint
Expected maximum number of nodes on this path.
- edgeSelector
Determines the edge to be selected between neighbor nodes if an edge is not supplied explicitly. This is only relevant in case of multigraphs.
- Definition Classes
- GraphTraversal
-
abstract
def
newWalkBuilder(start: (GraphLike.this)#NodeT)(implicit sizeHint: Int = defaultPathSize, edgeSelector: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) ⇒ Option[(GraphLike.this)#EdgeT] = anyEdgeSelector): (GraphLike.this)#WalkBuilder
Instantiates a WalkBuilder for this graph.
Instantiates a WalkBuilder for this graph.
- start
The node this walk starts at.
- sizeHint
Expected maximum number of nodes on this walk.
- edgeSelector
Determines the edge to be selected between neighbor nodes if an edge is not supplied explicitly. This is only relevant in case of multigraphs.
- Definition Classes
- GraphTraversal
-
abstract
def
nodes: (GraphLike.this)#NodeSetT
The node (vertex) set of this
Graphcommonly referred to as V(G).The node (vertex) set of this
Graphcommonly referred to as V(G).- returns
Set of all contained nodes.
- Definition Classes
- GraphBase
-
abstract
def
outerEdgeTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphLike.this)#NodeFilter = anyNode, subgraphEdges: (GraphLike.this)#EdgeFilter = anyEdge, ordering: (GraphLike.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphLike.this)#Weight] = None): (GraphLike.this)#OuterEdgeTraverser
Creates a OuterEdgeTraverser based on
scala.collection.Traversable[E[N]].Creates a OuterEdgeTraverser based on
scala.collection.Traversable[E[N]].- root
The node where subsequent graph traversals start.
- parameters
The properties controlling subsequent traversals.
- subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
- subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
- ordering
If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
- Definition Classes
- GraphTraversal
-
abstract
def
outerElemTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphLike.this)#NodeFilter = anyNode, subgraphEdges: (GraphLike.this)#EdgeFilter = anyEdge, ordering: (GraphLike.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphLike.this)#Weight] = None): (GraphLike.this)#OuterElemTraverser
Creates a OuterElemTraverser based on
scala.collection.Traversable[OuterElem].Creates a OuterElemTraverser based on
scala.collection.Traversable[OuterElem].- root
The node where subsequent graph traversals start.
- parameters
The properties controlling subsequent traversals.
- subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
- subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
- ordering
If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
- Definition Classes
- GraphTraversal
-
abstract
def
outerNodeDownUpTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphLike.this)#NodeFilter = anyNode, subgraphEdges: (GraphLike.this)#EdgeFilter = anyEdge, ordering: (GraphLike.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphLike.this)#Weight] = None): (GraphLike.this)#OuterNodeDownUpTraverser
Creates a OuterNodeDownUpTraverser based on
scala.collection.Traversable[(Boolean, N)]where theBooleanparameter istrueif the traversal takes place in downward andfalseif it takes place in upward direction.Creates a OuterNodeDownUpTraverser based on
scala.collection.Traversable[(Boolean, N)]where theBooleanparameter istrueif the traversal takes place in downward andfalseif it takes place in upward direction.- root
The node where subsequent graph traversals start.
- parameters
The properties controlling subsequent traversals. A
kinddifferent fromDepthFirstwill be ignored.- subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
- subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
- ordering
If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.
- Definition Classes
- GraphTraversal
-
abstract
def
outerNodeTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphLike.this)#NodeFilter = anyNode, subgraphEdges: (GraphLike.this)#EdgeFilter = anyEdge, ordering: (GraphLike.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphLike.this)#Weight] = None): (GraphLike.this)#OuterNodeTraverser
Creates a OuterNodeTraverser based on
scala.collection.Traversable[N].Creates a OuterNodeTraverser based on
scala.collection.Traversable[N].- root
The node where subsequent graph traversals start.
- parameters
The properties controlling subsequent traversals.
- subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
- subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
- ordering
If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
- Definition Classes
- GraphTraversal
-
abstract
def
seq: Set[Param[N, E]]
- Definition Classes
- GenSetLike → Parallelizable → GenTraversableOnce
-
abstract
def
strongComponentTraverser(parameters: Parameters = Parameters(), subgraphNodes: (GraphLike.this)#NodeFilter = anyNode, subgraphEdges: (GraphLike.this)#EdgeFilter = anyEdge, ordering: (GraphLike.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphLike.this)#Weight] = None): (GraphLike.this)#StrongComponentTraverser
Creates a StrongComponentTraverser.
Creates a StrongComponentTraverser.
- parameters
The properties controlling subsequent traversals.
- subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
- subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
- ordering
If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
- Definition Classes
- GraphTraversal
Concrete Value Members
-
object
Edge extends Serializable
- Definition Classes
- GraphBase
- Annotations
- @transient()
-
object
EdgeOrdering extends Serializable
Ordering for the path dependent type EdgeT.
Ordering for the path dependent type EdgeT.
- Definition Classes
- GraphBase
-
object
EdgeT
- Definition Classes
- GraphBase
- Annotations
- @transient()
-
object
InnerEdge extends Serializable
- Definition Classes
- GraphBase
- Annotations
- @transient()
-
object
InnerNode extends Serializable
- Definition Classes
- GraphBase
-
object
NoOrdering extends ElemOrdering with Serializable
The empty ElemOrdering.
The empty ElemOrdering.
- Definition Classes
- GraphBase
-
object
Node extends Serializable
- Definition Classes
- GraphBase
- Annotations
- @transient()
-
object
NodeOrdering extends Serializable
- Definition Classes
- GraphBase
-
object
Degree extends (GraphDegree.this)#DegreeFunction
- Definition Classes
- GraphDegree
-
object
DegreeOrdering extends Serializable
- Definition Classes
- GraphDegree
-
object
InDegree extends (GraphDegree.this)#DegreeFunction
- Definition Classes
- GraphDegree
-
object
IntReverseOrdering extends Ordering[Int]
Decreasing ordering of integers.
Decreasing ordering of integers.
- Definition Classes
- GraphDegree
-
object
OutDegree extends (GraphDegree.this)#DegreeFunction
- Definition Classes
- GraphDegree
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
&(that: GenSet[Param[N, E]]): This[N, E]
- Definition Classes
- GenSetLike
-
def
&~(that: GenSet[Param[N, E]]): This[N, E]
- Definition Classes
- GenSetLike
-
def
+(elem: Param[N, E]): This[N, E]
Creates a new supergraph with an additional node or edge, unless the node or edge passed is already present.
Creates a new supergraph with an additional node or edge, unless the node or edge passed is already present.
This method purely wraps
+(node: N)respectively+(edge: E[N])granting the same behavior.- elem
the wrapped node or edge to be added; ; if
elemis of type N, the wrapped object is added to the node set otherwise to the edge set.- returns
a new supergraph containing all nodes and edges of this graph plus
elem.
- Definition Classes
- GraphLike → SetLike → GenSetLike
-
def
+(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): This[N, E]
- Definition Classes
- SetLike
-
def
++(elems: GenTraversableOnce[Param[N, E]]): This[N, E]
- Definition Classes
- GraphLike → SetLike
-
def
++[B >: Param[N, E], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: Param[N, E], That](that: Traversable[B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: Param[N, E], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That
- Definition Classes
- TraversableLike
-
def
-(elem: Param[N, E]): This[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph except
elem.Creates a new subgraph consisting of all nodes and edges of this graph except
elem. Ifelemis of type N, this method maps to-(node: N). Otherwise the edge is deleted leaving the node set unchanged.- elem
node or edge to be removed.
- returns
the new subgraph of this graph after the "ripple" deletion of the passed node or the simple deletion of the passed edge.
- Definition Classes
- GraphLike → SetLike → Subtractable → GenSetLike
-
def
-(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): This[N, E]
- Definition Classes
- Subtractable
-
def
-!(elem: Param[N, E]): This[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph except
elem.Creates a new subgraph consisting of all nodes and edges of this graph except
elem. Ifelemis of type N, this method maps to-(node: N). Otherwise the edge is deleted along with those incident nodes which would become edge-less after deletion.- elem
node or edge to be removed.
- returns
a new subgraph of this graph after the "ripple" deletion of the passed node or edge.
-
def
--(elems: GenTraversableOnce[Param[N, E]]): This[N, E]
- Definition Classes
- GraphLike → Subtractable
-
def
--!(elems: GenTraversableOnce[Param[N, E]]): This[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph but the elements of
collwhich will be unconditionally removed.Creates a new subgraph consisting of all nodes and edges of this graph but the elements of
collwhich will be unconditionally removed. This operation differs from--in that edges are deleted along with those incident nodes which would become isolated after deletion.- elems
collection of nodes and/or edges to be removed; if the element type is N, it is removed from the node set otherwise from the edge set. See
-!(elem: Param[N,E]).- returns
the new subgraph containing all nodes and edges of this graph after the "ripple" deletion of nodes and the simple deletion of edges in
coll.
- def ->[B](y: B): (GraphLike[N, E, This], B)
-
def
/:[B](z: B)(op: (B, Param[N, E]) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:\[B](z: B)(op: (Param[N, E], B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
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
-
def
aggregate[B](z: ⇒ B)(seqop: (B, Param[N, E]) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
andThen[A](g: (Boolean) ⇒ A): (Param[N, E]) ⇒ A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
final
val
anyEdge: (GraphLike.this)#EdgeFilter
Default edge filter letting path all edges (non-filter).
Default edge filter letting path all edges (non-filter).
- Definition Classes
- GraphBase
-
final
def
anyEdgeSelector(from: (GraphLike.this)#NodeT, to: (GraphLike.this)#NodeT): Option[(GraphLike.this)#EdgeT]
An arbitrary edge between
fromandtothat is available most efficiently.An arbitrary edge between
fromandtothat is available most efficiently.- Definition Classes
- GraphTraversal
- Annotations
- @inline()
-
final
val
anyNode: (GraphLike.this)#NodeFilter
Default node filter letting traverse all nodes (non-filter).
Default node filter letting traverse all nodes (non-filter).
- Definition Classes
- GraphBase
-
final
lazy val
anyOrdering: AnyOrdering[N]
- Attributes
- protected
- Definition Classes
- GraphBase
-
def
apply(elem: Param[N, E]): Boolean
- Definition Classes
- GenSetLike → Function1
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
asSortedString(nodeSeparator: String = GraphBase.defaultSeparator, edgeSeparator: String = GraphBase.defaultSeparator, nodesEdgesSeparator: String = GraphBase.defaultSeparator, withNodesEdgesPrefix: Boolean = false)(implicit ordNode: (GraphLike.this)#NodeOrdering = defaultNodeOrdering, ordEdge: (GraphLike.this)#EdgeOrdering = defaultEdgeOrdering): String
Sorts all nodes of this graph by
ordNodefollowed by all edges sorted byordEdgeand concatinates their string representationnodeSeparatorandedgeSeparatorrespectively.Sorts all nodes of this graph by
ordNodefollowed by all edges sorted byordEdgeand concatinates their string representationnodeSeparatorandedgeSeparatorrespectively.- nodeSeparator
to separate nodes by.
- edgeSeparator
to separate edges by.
- nodesEdgesSeparator
to separate nodes from edges by.
- withNodesEdgesPrefix
whether the node and edge set should be prefixed.
- ordNode
the node ordering defaulting to
defaultNodeOrdering.- ordEdge
the edge ordering defaulting to
defaultEdgeOrdering.
-
final
def
bulkOp(elems: GenTraversableOnce[Param[N, E]], isPlusPlus: Boolean): This[N, E]
Prepares and calls
plusPlusorminusMinus.Prepares and calls
plusPlusorminusMinus.- Attributes
- protected
-
def
canEqual(that: Any): Boolean
- Definition Classes
- IterableLike → Equals
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
collect[B, That](pf: PartialFunction[Param[N, E], B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[Param[N, E], B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
compose[A](g: (A) ⇒ Param[N, E]): (A) ⇒ Boolean
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
contains(elem: Param[N, E]): Boolean
Checks whether a given node or edge is contained in this graph.
Checks whether a given node or edge is contained in this graph.
- elem
the node or edge the existence of which is to be checked
- returns
true if
elemis contained in this graph
- Definition Classes
- GraphLike → SetLike → GenSetLike
-
def
copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: Param[N, E]](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: Param[N, E]](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: Param[N, E]](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: (Param[N, E]) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
lazy val
defaultEdgeOrdering: (GraphLike.this)#EdgeOrdering
- Definition Classes
- GraphBase
-
final
lazy val
defaultNodeOrdering: (GraphLike.this)#NodeOrdering
- Definition Classes
- GraphBase
-
final
def
defaultPathSize: Int
- Attributes
- protected
- Definition Classes
- GraphTraversal
- Annotations
- @inline()
-
def
degreeCount(implicit nodeDegree: (GraphLike.this)#DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): SortedMap[Int, Int]
The degree set of this graph projected onto a map.
The degree set of this graph projected onto a map. The keys of the map are the degrees in decreasing order while the values are the number of inner nodes having the degree of the corresponding key.
- Definition Classes
- GraphDegree
-
def
degreeNodeSeq(implicit nodeDegree: (GraphLike.this)#DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): Seq[(GraphLike.this)#DegreeNodeSeqEntry]
The degree sequence of this graph projected onto a sequence of tuples.
The degree sequence of this graph projected onto a sequence of tuples. The first elements of the tuples are the degrees in non-increasing order while the second elements are the corresponding inner nodes.
- Definition Classes
- GraphDegree
-
def
degreeNodesMap(implicit nodeDegree: (GraphLike.this)#DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): SortedMap[Int, AnySet[(GraphLike.this)#NodeT]]
The degree set of this graph projected onto a map.
The degree set of this graph projected onto a map. The keys of the map are the degrees in decreasing order while the values are sets of the corresponding inner nodes.
- Definition Classes
- GraphDegree
-
def
degreeSeq(implicit nodeDegree: (GraphLike.this)#DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): Seq[Int]
The degree sequence of this graph, that is the non-increasing sequence of degrees over all nodes.
The degree sequence of this graph, that is the non-increasing sequence of degrees over all nodes.
- Definition Classes
- GraphDegree
-
def
degreeSet(implicit nodeDegree: (GraphLike.this)#DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): SortedSet[Int]
The degree set of this graph, that is the decreasing set of unique degrees over all nodes.
The degree set of this graph, that is the decreasing set of unique degrees over all nodes. Same as degreeSeq without duplicates.
- Definition Classes
- GraphDegree
-
def
diff(that: GenSet[Param[N, E]]): This[N, E]
- Definition Classes
- SetLike → GenSetLike
-
def
drop(n: Int): This[N, E]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
dropRight(n: Int): This[N, E]
- Definition Classes
- IterableLike
-
def
dropWhile(p: (Param[N, E]) ⇒ Boolean): This[N, E]
- Definition Classes
- TraversableLike → GenTraversableLike
-
implicit final
def
edgeToEdgeCont(e: E[N]): E[(GraphLike.this)#NodeT]
- Attributes
- protected
- Definition Classes
- GraphBase
- def ensuring(cond: (GraphLike[N, E, This]) ⇒ Boolean, msg: ⇒ Any): GraphLike[N, E, This]
- def ensuring(cond: (GraphLike[N, E, This]) ⇒ Boolean): GraphLike[N, E, This]
- def ensuring(cond: Boolean, msg: ⇒ Any): GraphLike[N, E, This]
- def ensuring(cond: Boolean): GraphLike[N, E, This]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
Graphinstances are equal if their nodes and edges turned to outer nodes and outer edges are equal.Graphinstances are equal if their nodes and edges turned to outer nodes and outer edges are equal. AnyTraversableOnceinstance may also be equal to this graph if its set representation contains equalling outer nodes and outer edges. Thus the following expressions hold:Graph(1~2, 3) == List(1~2, 3) Graph(1~2, 3) == List(1, 2, 2, 3, 2~1)
The first test is
falsebecause of the failing nodes1and2. The second is true because of duplicate elimination and undirected edge equivalence.- Definition Classes
- GraphLike → GenSetLike → Equals → AnyRef → Any
-
def
exists(p: (Param[N, E]) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
filter(p: (Param[N, E]) ⇒ Boolean): This[N, E]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: (Param[N, E]) ⇒ Boolean): This[N, E]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
find(outerEdge: E[N]): Option[(GraphLike.this)#EdgeT]
Searches for an edge node equaling to
outerEdgein this graph.Searches for an edge node equaling to
outerEdgein this graph.- outerEdge
the outer edge to search for in this graph.
- returns
Someof the inner edge found orNone.
- Annotations
- @inline()
-
final
def
find(outerNode: N): Option[(GraphLike.this)#NodeT]
Searches for an inner node equaling to
outerNodein this graph.Searches for an inner node equaling to
outerNodein this graph.- outerNode
the outer node to search for in this graph.
- returns
Someof the inner node found orNone.
- Annotations
- @inline()
-
def
find(p: (Param[N, E]) ⇒ Boolean): Option[Param[N, E]]
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
findCycle[U](implicit visitor: ((GraphLike.this)#InnerElem) ⇒ U = empty): Option[(GraphLike.this)#Cycle]
Finds a cycle in
thisgraph in any of its components and callsvisitorfor each inner element visited during the search.Finds a cycle in
thisgraph in any of its components and callsvisitorfor each inner element visited during the search. SeecomponentTraverserfor more control by means ofFluentProperties.- Definition Classes
- GraphTraversal
-
final
def
findCycleContaining[U](node: (GraphLike.this)#NodeT)(implicit visitor: ((GraphLike.this)#InnerElem) ⇒ U = empty): Option[(GraphLike.this)#Cycle]
Finds a cycle that contains
nodeand callsvisitorfor each inner element visited during the search.Finds a cycle that contains
nodeand callsvisitorfor each inner element visited during the search.- Definition Classes
- GraphTraversal
-
def
flatMap[B, That](f: (Param[N, E]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, Param[N, E]) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: (Param[N, E], B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
forall(p: (Param[N, E]) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: (Param[N, E]) ⇒ U): Unit
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
- def formatted(fmtstr: String): String
-
final
def
get(outerEdge: E[N]): (GraphLike.this)#EdgeT
Searches for an inner edge equaling to
outerEdgein this graph which must exist in this graph.Searches for an inner edge equaling to
outerEdgein this graph which must exist in this graph.- outerEdge
the outer edge to search for in this graph.
- returns
the inner edge if found. Otherwise NoSuchElementException is thrown.
- Annotations
- @inline()
-
final
def
get(outerNode: N): (GraphLike.this)#NodeT
Searches for an inner node equaling to
outerNodein this graph which must exist in this graph.Searches for an inner node equaling to
outerNodein this graph which must exist in this graph.- outerNode
the outer node to search for in this graph.
- returns
the inner node if found. Otherwise NoSuchElementException is thrown.
- Annotations
- @inline()
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
getOrElse(outerEdge: E[N], default: (GraphLike.this)#EdgeT): (GraphLike.this)#EdgeT
Searches for an inner edge equaling to
outerEdgein this graph.Searches for an inner edge equaling to
outerEdgein this graph.- outerEdge
the outer edge to search for in this graph.
- default
the inner edge to return if
outerEdgecannot be found.- returns
the inner edge looked up or
defaultif no inner edge equaling toedgecould be found.
- Annotations
- @inline()
-
final
def
getOrElse(outerNode: N, default: (GraphLike.this)#NodeT): (GraphLike.this)#NodeT
Searches for an inner node equaling to
outerNodein this graph.Searches for an inner node equaling to
outerNodein this graph.- outerNode
the outer node to search for in this graph.
- default
the inner node to return if
outerNodeis not contained.- returns
The inner node looked up or
defaultif no inner node equaling toouterNodecould be found.
- Annotations
- @inline()
-
def
graphSize: Int
The size - commonly referred to as ||G|| - of this graph equaling to the number of edges.
The size - commonly referred to as ||G|| - of this graph equaling to the number of edges.
Method
sizeis reserved for the number of nodes and edges becauseGraphis alsoSetLikewith set elements being nodes or edges.- Definition Classes
- GraphBase
-
def
groupBy[K](f: (Param[N, E]) ⇒ K): Map[K, This[N, E]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
grouped(size: Int): Iterator[This[N, E]]
- Definition Classes
- IterableLike
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
hashCode(): Int
- Definition Classes
- GenSetLike → AnyRef → Any
-
def
having(node: (GraphLike.this)#NodeFilter = _ => false, edge: (GraphLike.this)#EdgeFilter = null): PartialFunction[Param[N, E], Boolean]
Provides a shortcut for predicates involving any graph element.
Provides a shortcut for predicates involving any graph element. In order to compute a subgraph of this graph, the result of this method may be passed to any graph-level method requiring a predicate such as
count,exists,filter,filterNot,foralletc. For instanceval g = Graph(2~>3, 3~>1, 5) g filter g.having(nodes = _ >= 2) // yields Graph(2, 3, 5, 2~>3)
- node
The predicate that must hold for the nodes.
- edge
The predicate that must hold for the edges. If omitted, all edges between nodes to be included by
nodeswill also be included.- returns
A partial function combining the passed predicates.
-
def
head: Param[N, E]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
headOption: Option[Param[N, E]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
init: This[N, E]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
initialize(nodes: Traversable[N], edges: Traversable[E[N]]): Unit
Populates this graph with
nodesandedges.Populates this graph with
nodesandedges.The implementing class will typically have a constructor with the same parameters which is invoked by
fromof the companion object.- nodes
The isolated (and optionally any other) outer nodes that the node set of this graph is to be populated with.
- edges
The outer edges that the edge set of this graph is to be populated with. Nodes being the end of any of these edges will be added to the node set.
- Attributes
- protected
- Definition Classes
- GraphBase
-
def
inits: Iterator[This[N, E]]
- Definition Classes
- TraversableLike
-
def
intersect(that: GenSet[Param[N, E]]): This[N, E]
- Definition Classes
- GenSetLike
-
final
def
isAcyclic: Boolean
Whether
thisgraph has no cycle.Whether
thisgraph has no cycle.- Definition Classes
- GraphTraversal
- Annotations
- @inline()
-
def
isComplete: Boolean
Whether all nodes are pairwise adjacent.
Whether all nodes are pairwise adjacent.
- returns
trueif this graph is complete,falseif this graph contains any independent nodes.
- Definition Classes
- GraphTraversal
-
def
isConnected: Boolean
Whether
thisgraph is connected if it is undirected or weakly connected if it is directed.Whether
thisgraph is connected if it is undirected or weakly connected if it is directed.- Definition Classes
- GraphTraversal
-
final
def
isCustomEdgeFilter(f: (GraphLike.this)#EdgeFilter): Boolean
trueiffis not equivalent toanyEdge.trueiffis not equivalent toanyEdge.- Definition Classes
- GraphBase
- Annotations
- @inline()
-
final
def
isCustomNodeFilter(f: (GraphLike.this)#NodeFilter): Boolean
trueiffis not equivalent toanyNode.trueiffis not equivalent toanyNode.- Definition Classes
- GraphBase
- Annotations
- @inline()
-
final
def
isCyclic: Boolean
Whether
thisgraph has at least one cycle in any of its components.Whether
thisgraph has at least one cycle in any of its components.- Definition Classes
- GraphTraversal
- Annotations
- @inline()
-
def
isDefined: Boolean
- Implicit
- This member is added by an implicit conversion from GraphLike[N, E, This] to OuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
-
def
isDirected: Boolean
Whether all edges of this graph are directed.
-
final
val
isDirectedT: Boolean
- Attributes
- protected
-
def
isEdge: Boolean
- Implicit
- This member is added by an implicit conversion from GraphLike[N, E, This] to OuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
-
def
isEmpty: Boolean
- Definition Classes
- SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
isHyper: Boolean
Whether this graph contains at least one hyperedges.
-
final
val
isHyperT: Boolean
- Attributes
- protected
- def isIn: Boolean
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isMixed: Boolean
Whether this graph contains at least one directed and one undirected edge.
-
def
isMulti: Boolean
Whether this graph contains at least one multi-edge.
Whether this graph contains at least one multi-edge. We defnie multi-edges by
- two or more directed edges having the same source and target
- two or more undirected edges connecting the same nodes
- two or more (directed) hyperedges that, after being decomposed into (directed) edges, yield any multy-edge as stipulated above.
-
final
val
isMultiT: Boolean
- Attributes
- protected
-
def
isNode: Boolean
- Implicit
- This member is added by an implicit conversion from GraphLike[N, E, This] to OuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
- def isOut: Boolean
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
final
def
isTrivial: Boolean
trueif this graph has at most 1 node.trueif this graph has at most 1 node.- Definition Classes
- GraphBase
- Annotations
- @inline()
-
def
iterator: Iterator[Param[N, E]]
Iterates over all nodes and all edges.
Iterates over all nodes and all edges.
- returns
iterator containing all nodes and all edges
- Definition Classes
- GraphLike → GenSetLike → IterableLike → GenIterableLike
-
def
last: Param[N, E]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[Param[N, E]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
map[B, That](f: (Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[This[N, E], 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[N, E]](implicit cmp: Ordering[B]): Param[N, E]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxDegree(implicit nodeDegree: (GraphLike.this)#DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): Int
The degree of the node having the highest degree or
0if this graph is empty.The degree of the node having the highest degree or
0if this graph is empty.- Definition Classes
- GraphDegree
-
def
min[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minDegree(implicit nodeDegree: (GraphLike.this)#DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): Int
The degree of the node having the least degree or
0if this graph is empty.The degree of the node having the least degree or
0if this graph is empty.- Definition Classes
- GraphDegree
-
def
minusMinus(delNodes: Traversable[N], delEdges: Traversable[E[N]]): This[N, E]
Implements the heart of
--calling thefromfactory method of the companion object.Implements the heart of
--calling thefromfactory method of the companion object. Note that this method must be reimplemented in each module having its own factory methods such asconstraineddoes.- Attributes
- protected
-
def
minusMinusNodesEdges(delNodes: Traversable[N], delEdges: Traversable[E[N]]): (Set[N], Set[E[N]])
Calculates the
nodesandedgesarguments to be passed to a factory method when delNodes and delEdges are to be deleted by--.Calculates the
nodesandedgesarguments to be passed to a factory method when delNodes and delEdges are to be deleted by--.- Attributes
- protected
-
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
-
val
n1: GraphLike[N, E, This]
- Implicit
- This member is added by an implicit conversion from GraphLike[N, E, This] to EdgeAssoc[GraphLike[N, E, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[Param[N, E], This[N, E]]
- Attributes
- protected[this]
- Definition Classes
- SetLike → TraversableLike → HasNewBuilder
-
final
val
noNode: (GraphLike.this)#NodeFilter
Node predicate always returning
false.Node predicate always returning
false.- Definition Classes
- GraphBase
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
nonTrivial: Boolean
trueif this graph has at least 2 nodes.trueif this graph has at least 2 nodes.- 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
The order - commonly referred to as |G| - of this graph equaling to the number of nodes.
The order - commonly referred to as |G| - of this graph equaling to the number of nodes.
- Definition Classes
- GraphBase
-
def
par: ParSet[Param[N, E]]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[Param[N, E], ParSet[Param[N, E]]]
- Attributes
- protected[this]
- Definition Classes
- SetLike → TraversableLike → Parallelizable
-
final
def
partition(elems: GenTraversableOnce[Param[N, E]]): Partitions[N, E]
- Attributes
- protected
-
def
partition(p: (Param[N, E]) ⇒ Boolean): (This[N, E], This[N, E])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
plusPlus(newNodes: Traversable[N], newEdges: Traversable[E[N]]): This[N, E]
Implements the heart of
++calling thefromfactory method of the companion object.Implements the heart of
++calling thefromfactory method of the companion object. Note that this method must be reimplemented in each module having its own factory methods such asconstraineddoes.- Attributes
- protected
-
def
product[B >: Param[N, E]](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
repr: This[N, E]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
reversed: List[Param[N, E]]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
sameElements[B >: Param[N, E]](that: GenIterable[B]): Boolean
- Definition Classes
- IterableLike → GenIterableLike
-
def
scan[B >: Param[N, E], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[This[N, E], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[This[N, E], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: (Param[N, E], B) ⇒ B)(implicit bf: CanBuildFrom[This[N, E], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
- Annotations
- @migration
- Migration
(Changed in version 2.9.0) The behavior of
scanRighthas changed. The previous behavior can be reproduced with scanRight.reverse.
-
def
size: Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): This[N, E]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
sliding(size: Int, step: Int): Iterator[This[N, E]]
- Definition Classes
- IterableLike
-
def
sliding(size: Int): Iterator[This[N, E]]
- Definition Classes
- IterableLike
-
def
span(p: (Param[N, E]) ⇒ Boolean): (This[N, E], This[N, E])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (This[N, E], This[N, E])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
stringPrefix: String
- Definition Classes
- GraphLike → SetLike → TraversableLike → GenTraversableLike
-
def
subsetOf(that: GenSet[Param[N, E]]): Boolean
- Definition Classes
- GenSetLike
-
def
subsets(): Iterator[This[N, E]]
- Definition Classes
- SetLike
-
def
subsets(len: Int): Iterator[This[N, E]]
- Definition Classes
- SetLike
-
def
sum[B >: Param[N, E]](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: This[N, E]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[This[N, E]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): This[N, E]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
takeRight(n: Int): This[N, E]
- Definition Classes
- IterableLike
-
def
takeWhile(p: (Param[N, E]) ⇒ Boolean): This[N, E]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
thisCollection: Iterable[Param[N, E]]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Param[N, E], Col[Param[N, E]]]): Col[Param[N, E]]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: Param[N, E]](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[A1 >: Param[N, E]]: Buffer[A1]
- Definition Classes
- SetLike → TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: This[N, E]): Iterable[Param[N, E]]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
def
toIndexedSeq: IndexedSeq[Param[N, E]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[Param[N, E]]
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[Param[N, E]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toList: List[Param[N, E]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[Param[N, E], (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toParArray: ParArray[T]
- Implicit
- This member is added by an implicit conversion from GraphLike[N, E, This] to CollectionsHaveToParArray[GraphLike[N, E, This], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (GraphLike[N, E, This]) ⇒ GenTraversableOnce[T] is in scope.
- Definition Classes
- CollectionsHaveToParArray
-
def
toSeq: Seq[Param[N, E]]
- Definition Classes
- SetLike → TraversableOnce → GenTraversableOnce
-
def
toSet[B >: Param[N, E]]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSortedString(nodeSeparator: String = GraphBase.defaultSeparator, edgeSeparator: String = GraphBase.defaultSeparator, nodesEdgesSeparator: String = GraphBase.defaultSeparator, withNodesEdgesPrefix: Boolean = false)(implicit ordNode: (GraphLike.this)#NodeOrdering = defaultNodeOrdering, ordEdge: (GraphLike.this)#EdgeOrdering = defaultEdgeOrdering): String
Same as
asSortedStringbut additionally prefixed and parenthesized bystringPrefix. -
def
toStream: Stream[Param[N, E]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
-
def
toString(): String
Ensures sorted nodes/edges unless this
Graphhas more than 100 elements.Ensures sorted nodes/edges unless this
Graphhas more than 100 elements. See alsoasSortedStringandtoSortedString.- Definition Classes
- GraphLike → SetLike → Function1 → TraversableLike → AnyRef → Any
-
def
toTraversable: Traversable[Param[N, E]]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[Param[N, E]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
topologicalSort[U](implicit visitor: ((GraphLike.this)#InnerElem) ⇒ U = empty): (GraphLike.this)#CycleNodeOrTopologicalOrder
Sorts this graph topologically.
Sorts this graph topologically.
- visitor
called for each inner node or inner edge visited during the sort. See
componentTraverserfor more control by means ofFluentProperties.
- Definition Classes
- GraphTraversal
-
final
def
topologicalSortByComponent[U](implicit visitor: ((GraphLike.this)#InnerElem) ⇒ U = empty): Traversable[(GraphLike.this)#CycleNodeOrTopologicalOrder]
Sorts every isolated component of this graph topologically.
Sorts every isolated component of this graph topologically.
- visitor
called for each inner node or inner edge visited during the sort. See
componentTraverserfor more control by means ofFluentProperties.
- Definition Classes
- GraphTraversal
-
def
totalDegree(implicit nodeDegree: (GraphLike.this)#DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): Int
The total degree of this graph equaling to the sum of the degrees over all nodes or
0if this graph is empty.The total degree of this graph equaling to the sum of the degrees over all nodes or
0if this graph is empty.- nodeDegree
the degree function to apply to the nodes defaulting to
Degree. Non-default predefined degree functions areInDegreeandOutDegree.- degreeFilter
selects nodes to be included by their degree.
- Definition Classes
- GraphDegree
-
def
totalWeight: Double
- Definition Classes
- GraphBase
-
def
union(that: GenSet[Param[N, E]]): This[N, E]
- Definition Classes
- SetLike → GenSetLike
- val value: GraphLike[N, E, This]
-
def
view(from: Int, until: Int): IterableView[Param[N, E], This[N, E]]
- Definition Classes
- IterableLike → TraversableLike
-
def
view: IterableView[Param[N, E], This[N, E]]
- 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
- @native() @throws( ... )
-
def
withFilter(p: (Param[N, E]) ⇒ Boolean): FilterMonadic[Param[N, E], This[N, E]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
zip[A1 >: Param[N, E], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[This[N, E], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipAll[B, A1 >: Param[N, E], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[This[N, E], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipWithIndex[A1 >: Param[N, E], That](implicit bf: CanBuildFrom[This[N, E], (A1, Int), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
|(that: GenSet[Param[N, E]]): This[N, E]
- Definition Classes
- GenSetLike
-
def
~[N >: N1](n2: N): UnDiEdge[N]
- Implicit
- This member is added by an implicit conversion from GraphLike[N, E, This] to EdgeAssoc[GraphLike[N, E, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
-
def
~>[N >: N1](n2: N): DiEdge[N]
- Implicit
- This member is added by an implicit conversion from GraphLike[N, E, This] to EdgeAssoc[GraphLike[N, E, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
- def →[B](y: B): (GraphLike[N, E, This], B)
-
object
Cycle
- Definition Classes
- GraphTraversal
-
object
ExtendedNodeVisitor
- Definition Classes
- GraphTraversal
-
object
Informer
- Definition Classes
- GraphTraversal
-
object
Path extends Serializable
- Definition Classes
- GraphTraversal
-
object
SubgraphProperties
- Attributes
- protected
- Definition Classes
- GraphTraversal
-
object
TraverserInnerNode extends Serializable
- Definition Classes
- GraphTraversal
- Annotations
- @transient()
-
object
Walk
- Definition Classes
- GraphTraversal
-
object
Weight
- Definition Classes
- GraphTraversal
Shadowed Implicit Value Members
-
def
+(other: String): String
- Implicit
- This member is added by an implicit conversion from GraphLike[N, E, This] to any2stringadd[GraphLike[N, E, This]] performed by method any2stringadd in scala.Predef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLike: any2stringadd[GraphLike[N, E, This]]).+(other)
- Definition Classes
- any2stringadd
-
def
andThen[A](g: (Boolean) ⇒ A): (Param[Param[N, E], EI]) ⇒ A
- Implicit
- This member is added by an implicit conversion from GraphLike[N, E, This] to (Param[Param[N, E], EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLike: (Param[Param[N, E], EI]) ⇒ Boolean).andThen(g)
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
apply(v1: Param[Param[N, E], EI]): Boolean
- Implicit
- This member is added by an implicit conversion from GraphLike[N, E, This] to (Param[Param[N, E], EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLike: (Param[Param[N, E], EI]) ⇒ Boolean).apply(v1)
- Definition Classes
- Function1
-
def
compose[A](g: (A) ⇒ Param[Param[N, E], EI]): (A) ⇒ Boolean
- Implicit
- This member is added by an implicit conversion from GraphLike[N, E, This] to (Param[Param[N, E], EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLike: (Param[Param[N, E], EI]) ⇒ Boolean).compose(g)
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
filter(p: (Param[N, E]) ⇒ Boolean): TraversableOnce[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from GraphLike[N, E, This] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLike: MonadOps[Param[N, E]]).filter(p)
- Definition Classes
- MonadOps
-
def
flatMap[B](f: (Param[N, E]) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from GraphLike[N, E, This] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLike: MonadOps[Param[N, E]]).flatMap(f)
- Definition Classes
- MonadOps
-
def
map[B](f: (Param[N, E]) ⇒ B): TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from GraphLike[N, E, This] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLike: MonadOps[Param[N, E]]).map(f)
- Definition Classes
- MonadOps
-
def
stringPrefix: String
- Implicit
- This member is added by an implicit conversion from GraphLike[N, E, This] to OuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLike: OuterNode[GraphLike[N, E, This]]).stringPrefix
- Definition Classes
- NodeParam
-
def
toString(): String
- Implicit
- This member is added by an implicit conversion from GraphLike[N, E, This] to OuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLike: OuterNode[GraphLike[N, E, This]]).toString()
- Definition Classes
- NodeParam → AnyRef → Any
-
def
toString(): String
- Implicit
- This member is added by an implicit conversion from GraphLike[N, E, This] to (Param[Param[N, E], EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLike: (Param[Param[N, E], EI]) ⇒ Boolean).toString()
- Definition Classes
- Function1 → AnyRef → Any
-
def
withFilter(p: (Param[N, E]) ⇒ Boolean): Iterator[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from GraphLike[N, E, This] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graphLike: MonadOps[Param[N, E]]).withFilter(p)
- Definition Classes
- MonadOps
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.