trait Graph[N, E[+X] <: EdgeLikeIn[X]] extends collection.Graph[N, E] with GraphLike[N, E, Graph]
The main trait for immutable graphs bundling functionality that is not specific to graph representation.
- Alphabetic
- By Inheritance
- Graph
- Graph
- GraphLike
- GraphDegree
- GraphTraversal
- GraphBase
- Serializable
- GraphAsSet
- Set
- Equals
- SetOps
- Function1
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- by iterableOnceExtensionMethods
- by EdgeAssoc
- by predicateToNodePredicate
- by TraversableEnrichments
- by anyToNode
- by ChainingOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
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
- class EdgeBase extends InnerEdgeParam[N, E, (GraphLike.this)#NodeT, E] with (GraphLike.this)#InnerEdge
- Definition Classes
- GraphLike
- trait EdgeSet extends (GraphLike.this)#EdgeSet
- Definition Classes
- GraphLike
- trait InnerEdge extends (GraphLike.this)#InnerEdge
- Definition Classes
- GraphLike
- trait InnerNode extends (GraphLike.this)#TraverserInnerNode
- Definition Classes
- GraphLike
- abstract class NodeBase extends InnerNodeParam[N] with (GraphLike.this)#InnerNode
- Attributes
- protected
- Definition Classes
- GraphLike
- trait NodeSet extends (GraphLike.this)#NodeSet
- Definition Classes
- GraphLike
- sealed abstract class AbstractTopologicalOrder[+A, +T] extends AbstractIterable[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 Iterable[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
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.Iterable 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.Iterable 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.Iterable 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.Iterable 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 ancestor 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.Iterable 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.Iterable 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.Iterable 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.Iterable 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 Iterable[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
- case class TopologicalSortFailure extends Product with Serializable
Failure result of a topological sort with a possible hint of candidate cycle nodes.
Failure result of a topological sort with a possible hint of candidate cycle nodes.
- Definition Classes
- GraphTraversal
- trait Traverser[A, +This <: Traverser[A, This]] extends TraverserMethods[A, This] with Properties with CompatTraversable[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 Iterable[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] with Growable[InnerElem]
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 type Config <: GraphConfig
- Attributes
- protected
- Definition Classes
- GraphLike
- type DegreeNodeSeqEntry = (Int, NodeT)
Type alias for entries in degree maps returned by
degreeSeqMap.Type alias for entries in degree maps returned by
degreeSeqMap.- Definition Classes
- GraphDegree
- type EdgeFilter = (EdgeT) => Boolean
- Definition Classes
- GraphBase
- abstract type EdgeSetT <: EdgeSet
- abstract type EdgeT <: InnerEdgeParam[N, E, NodeT, E] with InnerEdge with Serializable
- type Layers = Iterable[Layer]
The result of a topological sort in the layered view.
The result of a topological sort in the layered view.
- Definition Classes
- GraphTraversal
- type NodeFilter = (NodeT) => Boolean
- Definition Classes
- GraphBase
- abstract type NodeSetT <: NodeSet
- abstract type NodeT <: InnerNode
- Definition Classes
- GraphLike → GraphTraversal → GraphBase
- type ThisGraph = Graph.this.type
- Attributes
- protected
- Definition Classes
- GraphLike
- type TopologicalSort = Either[TopologicalSortFailure, TopologicalOrder[NodeT]]
- Definition Classes
- GraphTraversal
Abstract Value Members
- abstract def +(node: N): Graph[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.
- Definition Classes
- GraphLike
- abstract def +#(edge: E[N]): Graph[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
- Definition Classes
- GraphLike
- abstract def -(node: N): Graph[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.
- Definition Classes
- GraphLike
- abstract def -!#(edge: E[N]): Graph[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
- Definition Classes
- GraphLike
- abstract def -#(edge: E[N]): Graph[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph except
edge.Creates a new subgraph consisting of all nodes and edges of this graph except
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
- Definition Classes
- GraphLike
- abstract def componentTraverser(parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): 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 Config
- Definition Classes
- GraphLike
- implicit abstract val edgeT: ClassTag[E[N]]
- Definition Classes
- GraphLike
- abstract def edges: 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 val graphCompanion: GraphCompanion[[NN, EE[+XX]]Graph[NN, EE]]
The companion object of
This.The companion object of
This.- Definition Classes
- GraphAsSet
- abstract def innerEdgeTraverser(root: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): InnerEdgeTraverser
Creates a InnerEdgeTraverser based on
scala.collection.Iterable[EdgeT].Creates a InnerEdgeTraverser based on
scala.collection.Iterable[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: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): InnerElemTraverser
Creates a InnerElemTraverser based on
scala.collection.Iterable[InnerElem].Creates a InnerElemTraverser based on
scala.collection.Iterable[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: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): InnerNodeDownUpTraverser
Creates a InnerNodeDownUpTraverser based on
scala.collection.Iterable[(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.Iterable[(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: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): InnerNodeTraverser
Creates a InnerNodeTraverser based on
scala.collection.Iterable[NodeT].Creates a InnerNodeTraverser based on
scala.collection.Iterable[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[NodeT]): EdgeT
- Attributes
- protected
- Definition Classes
- GraphBase
- abstract def newNode(n: N): NodeT
- Attributes
- protected
- Definition Classes
- GraphBase
- abstract def newPathBuilder(start: NodeT)(implicit sizeHint: Int = defaultPathSize, edgeSelector: (NodeT, NodeT) => Option[EdgeT] = anyEdgeSelector): 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: NodeT)(implicit sizeHint: Int = defaultPathSize, edgeSelector: (NodeT, NodeT) => Option[EdgeT] = anyEdgeSelector): 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: 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: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): OuterEdgeTraverser
Creates a OuterEdgeTraverser based on
scala.collection.Iterable[E[N]].Creates a OuterEdgeTraverser based on
scala.collection.Iterable[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: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): OuterElemTraverser
Creates a OuterElemTraverser based on
scala.collection.Iterable[OuterElem].Creates a OuterElemTraverser based on
scala.collection.Iterable[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: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): OuterNodeDownUpTraverser
Creates a OuterNodeDownUpTraverser based on
scala.collection.Iterable[(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.Iterable[(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: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): OuterNodeTraverser
Creates a OuterNodeTraverser based on
scala.collection.Iterable[N].Creates a OuterNodeTraverser based on
scala.collection.Iterable[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 strongComponentTraverser(parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): 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
- abstract def minusIsolated(node: N): Graph[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph except
nodewhich is conditionally removed from this graph.Creates a new subgraph consisting of all nodes and edges of this graph except
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.
- Definition Classes
- GraphLike
- Annotations
- @deprecated
- Deprecated
(Since version 1.13) To remove a node conditionally, check for the prerequisites beforehand.
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
- 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
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def &(that: Set[Param[N, E]]): Graph[N, E]
- Definition Classes
- SetOps
- Annotations
- @inline()
- final def &~(that: Set[Param[N, E]]): Graph[N, E]
- Definition Classes
- SetOps
- Annotations
- @inline()
- final def ++(that: scala.collection.IterableOnce[Param[N, E]]): Graph[N, E]
- Definition Classes
- SetOps
- Annotations
- @inline()
- final def ++[B >: Param[N, E]](suffix: scala.collection.IterableOnce[B]): AnySet[B]
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def --(elems: IterableOnce[Param[N, E]]): Graph[N, E]
- Definition Classes
- GraphAsSet → SetOps
- def ->[B](y: B): (Graph[N, E], B)
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def addString(b: StringBuilder): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- IterableOnceOps
- def andThen[A](g: (Boolean) => A): (Param[N, E]) => A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- final val anyEdge: 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: NodeT, to: NodeT): Option[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: 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
- final def apply(elem: Param[N, E]): Boolean
- Definition Classes
- SetOps → Function1
- Annotations
- @inline()
- 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: NodeOrdering = defaultNodeOrdering, ordEdge: 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.
- Definition Classes
- GraphLike
- final def bulkOp(elems: IterableOnce[Param[N, E]], isPlusPlus: Boolean): Graph[N, E]
Prepares and calls
plusPlusorminusMinus.Prepares and calls
plusPlusorminusMinus.- Attributes
- protected
- Definition Classes
- GraphLike → GraphAsSet
- def canEqual(that: Any): Boolean
- Definition Classes
- Set → Equals
- def className: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def coll: Graph.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[Param[N, E], B]): AnySet[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[Param[N, E], B]): Option[B]
- Definition Classes
- IterableOnceOps
- def compose[A](g: (A) => Param[N, E]): (A) => Boolean
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def concat(elems: IterableOnce[Param[N, E]]): Graph[N, E]
- Definition Classes
- GraphAsSet → SetOps
- def concat[B >: Param[N, E]](suffix: scala.collection.IterableOnce[B]): AnySet[B]
- Definition Classes
- IterableOps
- 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 → SetOps
- def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def copyToArray[B >: Param[N, E]](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def corresponds[B](that: scala.collection.IterableOnce[B])(p: (Param[N, E], B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: (Param[N, E]) => Boolean): Int
- Definition Classes
- IterableOnceOps
- 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 = 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: DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): Seq[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: DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): SortedMap[Int, AnySet[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: 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: 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: AnySet[Param[N, E]]): Graph[N, E]
- Definition Classes
- GraphAsSet → SetOps
- def drop(n: Int): Graph[N, E]
- Definition Classes
- IterableOps → IterableOnceOps
- def dropRight(n: Int): Graph[N, E]
- Definition Classes
- IterableOps
- def dropWhile(p: (Param[N, E]) => Boolean): Graph[N, E]
- Definition Classes
- IterableOps → IterableOnceOps
- implicit final def edgeToEdgeCont(e: E[N]): E[NodeT]
- Attributes
- protected
- Definition Classes
- GraphBase
- def empty: Graph[N, E]
- def ensuring(cond: (Graph[N, E]) => Boolean, msg: => Any): Graph[N, E]
- def ensuring(cond: (Graph[N, E]) => Boolean): Graph[N, E]
- def ensuring(cond: Boolean, msg: => Any): Graph[N, E]
- def ensuring(cond: Boolean): Graph[N, E]
- 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 → Set → Equals → AnyRef → Any
- def excl(elem: Param[N, E]): Graph[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
- def exists(p: (Param[N, E]) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def filter(pred: (Param[N, E]) => Boolean): Graph[N, E]
- Definition Classes
- IterableOps → IterableOnceOps
- def filterNot(pred: (Param[N, E]) => Boolean): Graph[N, E]
- Definition Classes
- IterableOps → IterableOnceOps
- final def find(outerEdge: E[N]): Option[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.
- Definition Classes
- GraphLike
- Annotations
- @inline()
- final def find(outerNode: N): Option[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.
- Definition Classes
- GraphLike
- Annotations
- @inline()
- def find(p: (Param[N, E]) => Boolean): Option[Param[N, E]]
- Definition Classes
- IterableOnceOps
- final def findCycle[U](implicit visitor: (InnerElem) => U = empty): Option[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: NodeT)(implicit visitor: (InnerElem) => U = empty): Option[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](f: (Param[N, E]) => scala.collection.IterableOnce[B]): AnySet[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def flatten[B](implicit asIterable: (Param[N, E]) => scala.collection.IterableOnce[B]): AnySet[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, Param[N, E]) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: (Param[N, E], B) => B): B
- Definition Classes
- IterableOnceOps
- def forall(p: (Param[N, E]) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: (Param[N, E]) => U): Unit
- Definition Classes
- IterableOnceOps
- def fromSpecific(coll: IterableOnce[Param[N, E]]): Graph[N, E]
- Attributes
- protected
- Definition Classes
- GraphAsSet → IterableFactoryDefaults → IterableOps
- final def get(outerEdge: E[N]): 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.
- Definition Classes
- GraphLike
- Annotations
- @inline()
- final def get(outerNode: N): 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.
- Definition Classes
- GraphLike
- Annotations
- @inline()
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def getOrElse(outerEdge: E[N], default: EdgeT): 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.
- Definition Classes
- GraphLike
- Annotations
- @inline()
- final def getOrElse(outerNode: N, default: NodeT): 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.
- Definition Classes
- GraphLike
- 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, Graph[N, E]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: (Param[N, E]) => K)(f: (Param[N, E]) => B): Map[K, AnySet[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: (Param[N, E]) => K)(f: (Param[N, E]) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[Graph[N, E]]
- Definition Classes
- IterableOps
- def hashCode(): Int
- Definition Classes
- Set → AnyRef → Any
- def having(node: NodeFilter = _ => false, edge: 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.
- Definition Classes
- GraphLike
- def head: Param[N, E]
- Definition Classes
- IterableOps
- def headOption: Option[Param[N, E]]
- Definition Classes
- IterableOps
- def incl(elem: Param[N, E]): Graph[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
- def init: Graph[N, E]
- Definition Classes
- IterableOps
- def initialize(nodes: Iterable[N], edges: Iterable[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[Graph[N, E]]
- Definition Classes
- IterableOps
- def intersect(that: Set[Param[N, E]]): Graph[N, E]
- Definition Classes
- SetOps
- 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: EdgeFilter): Boolean
trueiffis not equivalent toanyEdge.trueiffis not equivalent toanyEdge.- Definition Classes
- GraphBase
- Annotations
- @inline()
- final def isCustomNodeFilter(f: 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 Graph[N, E] toOuterNode[Graph[N, E]] 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
- Definition Classes
- GraphLike
- final def isEdge: Boolean
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toOuterNode[Graph[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
- def isEmpty: Boolean
- Definition Classes
- IterableOnceOps
- def isHyper: Boolean
Whether this graph contains at least one hyperedges.
- final val isHyperT: Boolean
- Attributes
- protected
- Definition Classes
- GraphLike
- 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
- Definition Classes
- GraphLike
- def isNode: Boolean
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toOuterNode[Graph[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
- final def isOut: Boolean
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toOuterNode[Graph[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOps → IterableOnceOps
- 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 iterableFactory: IterableFactory[Set]
- Definition Classes
- Set → Iterable → IterableOps
- 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 → IterableOnce
- def knownSize: Int
- Definition Classes
- Graph → IterableOnce
- def last: Param[N, E]
- Definition Classes
- IterableOps
- def lastOption: Option[Param[N, E]]
- Definition Classes
- IterableOps
- def lazyZip[B](that: Iterable[B]): LazyZip2[Param[N, E], B, Graph.this.type]
- Definition Classes
- Iterable
- def map[NN, EE[+X] <: EdgeLikeIn[X]](f: (Param[N, E]) => Param[NN, EE])(implicit edgeT: ClassTag[EE[NN]]): Graph[NN, EE]
- Definition Classes
- GraphAsSet
- def map[B](f: (Param[N, E]) => B): AnySet[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def max[B >: Param[N, E]](implicit ord: Ordering[B]): Param[N, E]
- Definition Classes
- IterableOnceOps
- def maxBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Option[Param[N, E]]
- Definition Classes
- IterableOnceOps
- def maxDegree(implicit nodeDegree: 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 maxOption[B >: Param[N, E]](implicit ord: Ordering[B]): Option[Param[N, E]]
- Definition Classes
- IterableOnceOps
- def min[B >: Param[N, E]](implicit ord: Ordering[B]): Param[N, E]
- Definition Classes
- IterableOnceOps
- def minBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Option[Param[N, E]]
- Definition Classes
- IterableOnceOps
- def minDegree(implicit nodeDegree: 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 minOption[B >: Param[N, E]](implicit ord: Ordering[B]): Option[Param[N, E]]
- Definition Classes
- IterableOnceOps
- def minusMinus(delNodes: Iterable[N], delEdges: Iterable[E[N]]): Graph[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
- Definition Classes
- GraphLike
- def minusMinusNodesEdges(delNodes: Iterable[N], delEdges: Iterable[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
- Definition Classes
- GraphLike
- final def mkString: String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(start: String, sep: String, end: String): String
- Definition Classes
- IterableOnceOps
- val n1: Graph[N, E]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toEdgeAssoc[Graph[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newSpecificBuilder: Builder[Param[N, E], Graph[N, E]]
- Attributes
- protected
- Definition Classes
- GraphAsSet → IterableFactoryDefaults → IterableOps
- final val noNode: NodeFilter
Node predicate always returning
false.Node predicate always returning
false.- Definition Classes
- GraphBase
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- 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() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- 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
- final def partition(elems: IterableOnce[Param[N, E]]): Partitions[N, E]
- Attributes
- protected
- Definition Classes
- GraphLike
- def partition(p: (Param[N, E]) => Boolean): (Graph[N, E], Graph[N, E])
- Definition Classes
- IterableOps
- def partitionMap[A1, A2](f: (Param[N, E]) => Either[A1, A2]): (AnySet[A1], AnySet[A2])
- Definition Classes
- IterableOps
- def pipe[B](f: (Graph[N, E]) => B): B
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toChainingOps[Graph[N, E]] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def plusPlus(newNodes: Iterable[N], newEdges: Iterable[E[N]]): Graph[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
- Definition Classes
- GraphLike
- def product[B >: Param[N, E]](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def productElementNames: Iterator[String]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toOuterNode[Graph[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Product
- def reduce[B >: Param[N, E]](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: Param[N, E]](op: (B, Param[N, E]) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: Param[N, E]](op: (B, Param[N, E]) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: Param[N, E]](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: Param[N, E]](op: (Param[N, E], B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: Param[N, E]](op: (Param[N, E], B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reversed: Iterable[Param[N, E]]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- def scan[B >: Param[N, E]](z: B)(op: (B, B) => B): AnySet[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, Param[N, E]) => B): AnySet[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: (Param[N, E], B) => B): AnySet[B]
- Definition Classes
- IterableOps
- val self: Graph[N, E]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toChainingOps[Graph[N, E]] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def size: Int
- Definition Classes
- IterableOnceOps
- def sizeCompare(that: Iterable[_]): Int
- Definition Classes
- IterableOps
- def sizeCompare(otherSize: Int): Int
- Definition Classes
- IterableOps
- final def sizeIs: SizeCompareOps
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def slice(from: Int, until: Int): Graph[N, E]
- Definition Classes
- IterableOps → IterableOnceOps
- def sliding(size: Int, step: Int): Iterator[Graph[N, E]]
- Definition Classes
- IterableOps
- def sliding(size: Int): Iterator[Graph[N, E]]
- Definition Classes
- IterableOps
- def span(p: (Param[N, E]) => Boolean): (Graph[N, E], Graph[N, E])
- Definition Classes
- IterableOps → IterableOnceOps
- def splitAt(n: Int): (Graph[N, E], Graph[N, E])
- Definition Classes
- IterableOps → IterableOnceOps
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[Param[N, E], S]): S
- Definition Classes
- IterableOnce
- def stringPrefix: String
- Definition Classes
- GraphLike → Set → Iterable
- def subsetOf(that: Set[Param[N, E]]): Boolean
- Definition Classes
- SetOps
- def subsets(): Iterator[Graph[N, E]]
- Definition Classes
- SetOps
- def subsets(len: Int): Iterator[Graph[N, E]]
- Definition Classes
- SetOps
- def sum[B >: Param[N, E]](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- val t: Set[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toTraversableEnrichments[Param[N, E], Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
- Definition Classes
- TraversableEnrichments
- def tail: Graph[N, E]
- Definition Classes
- IterableOps
- def tails: Iterator[Graph[N, E]]
- Definition Classes
- IterableOps
- def take(n: Int): Graph[N, E]
- Definition Classes
- IterableOps → IterableOnceOps
- def takeRight(n: Int): Graph[N, E]
- Definition Classes
- IterableOps
- def takeWhile(p: (Param[N, E]) => Boolean): Graph[N, E]
- Definition Classes
- IterableOps → IterableOnceOps
- def tap[U](f: (Graph[N, E]) => U): Graph[N, E]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toChainingOps[Graph[N, E]] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def tapEach[U](f: (Param[N, E]) => U): Graph[N, E]
- Definition Classes
- IterableOps → IterableOnceOps
- def to[C1](factory: Factory[Param[N, E], C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: Param[N, E]](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: Param[N, E]]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: IndexedSeq[Param[N, E]]
- Definition Classes
- IterableOnceOps
- def toList: List[Param[N, E]]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[Param[N, E], (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- def toOuterNodes[E[+X] <: EdgeLike[X]]: Seq[InParam[Param[N, E], E]]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toTraversableEnrichments[Param[N, E], Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
- Definition Classes
- TraversableEnrichments
- def toSeq: Seq[Param[N, E]]
- Definition Classes
- IterableOnceOps
- def toSet[B >: Param[N, E]]: Set[B]
- Definition Classes
- IterableOnceOps
- def toSortedString(nodeSeparator: String = GraphBase.defaultSeparator, edgeSeparator: String = GraphBase.defaultSeparator, nodesEdgesSeparator: String = GraphBase.defaultSeparator, withNodesEdgesPrefix: Boolean = false)(implicit ordNode: NodeOrdering = defaultNodeOrdering, ordEdge: EdgeOrdering = defaultEdgeOrdering): String
Same as
asSortedStringbut additionally prefixed and parenthesized bystringPrefix.Same as
asSortedStringbut additionally prefixed and parenthesized bystringPrefix.- Definition Classes
- GraphLike
- 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 → Set → Function1 → Iterable → AnyRef → Any
- def toVector: Vector[Param[N, E]]
- Definition Classes
- IterableOnceOps
- final def topologicalSort[U](implicit visitor: (InnerElem) => U = empty): TopologicalSort
Sorts this graph topologically.
Sorts this graph topologically. Hooks are ignored.
- 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: (InnerElem) => U = empty): Iterable[TopologicalSort]
Sorts every isolated component of this graph topologically.
Sorts every isolated component of this graph topologically. Hooks are ignored.
- 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: 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 transpose[B](implicit asIterable: (Param[N, E]) => Iterable[B]): AnySet[AnySet[B]]
- Definition Classes
- IterableOps
- final def union(that: Set[Param[N, E]]): Graph[N, E]
- Definition Classes
- SetOps
- Annotations
- @inline()
- def unzip[A1, A2](implicit asPair: (Param[N, E]) => (A1, A2)): (AnySet[A1], AnySet[A2])
- Definition Classes
- IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: (Param[N, E]) => (A1, A2, A3)): (AnySet[A1], AnySet[A2], AnySet[A3])
- Definition Classes
- IterableOps
- val value: Graph[N, E]
- def view: View[Param[N, E]]
- Definition Classes
- IterableOps
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def withFilter(p: (Param[N, E]) => Boolean): WithFilter[Param[N, E], [_]AnySet[_]]
- Definition Classes
- IterableOps
- def zip[B](that: scala.collection.IterableOnce[B]): AnySet[(Param[N, E], B)]
- Definition Classes
- IterableOps
- def zipAll[A1 >: Param[N, E], B](that: Iterable[B], thisElem: A1, thatElem: B): AnySet[(A1, B)]
- Definition Classes
- IterableOps
- def zipWithIndex: AnySet[(Param[N, E], Int)]
- Definition Classes
- IterableOps → IterableOnceOps
- final def |(that: Set[Param[N, E]]): Graph[N, E]
- Definition Classes
- SetOps
- Annotations
- @inline()
- def ~[N >: N1](n2: N): UnDiEdge[N]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toEdgeAssoc[Graph[N, E]] 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 Graph[N, E] toEdgeAssoc[Graph[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
Shadowed Implicit Value Members
- def +(other: String): String
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toany2stringadd[Graph[N, E]] 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:(graph: any2stringadd[Graph[N, E]]).+(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 Graph[N, E] 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:(graph: (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 Graph[N, E] 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:(graph: (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 Graph[N, E] 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:(graph: (Param[Param[N, E], EI]) => Boolean).compose(g)
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def stringPrefix: String
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toOuterNode[Graph[N, E]] 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:(graph: OuterNode[Graph[N, E]]).stringPrefix
- Definition Classes
- NodeParam
- def toString(): String
- Implicit
- This member is added by an implicit conversion from Graph[N, E] 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:(graph: (Param[Param[N, E], EI]) => Boolean).toString()
- Definition Classes
- Function1 → AnyRef → Any
- def toString(): String
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toOuterNode[Graph[N, E]] 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:(graph: OuterNode[Graph[N, E]]).toString()
- Definition Classes
- NodeParam → AnyRef → Any
Deprecated Value Members
- def +(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): Graph[N, E]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs
- def +(elem: Param[N, E]): Graph[N, E]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Consider requiring an immutable Set or fall back to Set.union
- def ++:[B >: Param[N, E]](that: scala.collection.IterableOnce[B]): AnySet[B]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable
- def -(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): Graph[N, E]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use &- with an explicit collection argument instead of - with varargs
- def -(elem: Param[N, E]): Graph[N, E]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Consider requiring an immutable Set or fall back to Set.diff
- def -!(elem: Param[N, E]): Graph[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 isolated 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.
- Definition Classes
- GraphLike
- Annotations
- @deprecated
- Deprecated
(Since version 1.13) When deleting an edge, to get nodes deleted that become isolated, delete them beforehand.
- def --!(elems: IterableOnce[Param[N, E]]): Graph[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.
- Definition Classes
- GraphLike
- Annotations
- @deprecated
- Deprecated
(Since version 1.13) When deleting edges, to get nodes deleted that become isolated, delete them beforehand.
- def /:[B](z: B)(op: (B, Param[N, E]) => B): B
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]])./:(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldLeft instead
- final def /:[B](z: B)(op: (B, Param[N, E]) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- def :\[B](z: B)(op: (Param[N, E], B) => B): B
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).:\(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
- final def :\[B](z: B)(op: (Param[N, E], B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldRight instead of :\
- def aggregate[B](z: => B)(seqop: (B, Param[N, E]) => B, combop: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0)
aggregateis not relevant for sequential collections. UsefoldLeft(z)(seqop)instead.
- def collectFirst[B](f: PartialFunction[Param[N, E], B]): Option[B]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).collectFirst(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.collectFirst(...) instead
- def companion: IterableFactory[[_]AnySet[_]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @deprecatedOverriding() @inline()
- Deprecated
(Since version 2.13.0) Use iterableFactory instead
- def copyToBuffer(dest: Buffer[Param[N, E]]): Unit
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).copyToBuffer(dest)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.copyToBuffer(...) instead
- final def copyToBuffer[B >: Param[N, E]](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= collinstead
- def count(f: (Param[N, E]) => Boolean): Int
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).count(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.count(...) instead
- def exists(f: (Param[N, E]) => Boolean): Boolean
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).exists(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.exists(...) instead
- def filter(f: (Param[N, E]) => Boolean): Iterator[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).filter(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.filter(...) instead
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- def find(p: (Param[N, E]) => Boolean): Option[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).find(p)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.find instead
- def flatMap[B](f: (Param[N, E]) => scala.collection.IterableOnce[B]): scala.collection.IterableOnce[B]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).flatMap(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable
- def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).fold(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.fold instead
- def foldLeft[B](z: B)(op: (B, Param[N, E]) => B): B
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).foldLeft(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldLeft instead
- def foldRight[B](z: B)(op: (Param[N, E], B) => B): B
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).foldRight(z)(op)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
- def forall(f: (Param[N, E]) => Boolean): Boolean
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).forall(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.forall(...) instead
- def foreach[U](f: (Param[N, E]) => U): Unit
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).foreach(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.foreach(...) instead
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toStringFormat[Graph[N, E]] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.12.16) Use
formatString.format(value)instead ofvalue.formatted(formatString), or use thef""string interpolator. In Java 15 and later,formattedresolves to the new method in String which has reversed parameters.
- def hasDefiniteSize: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
- def isEmpty: Boolean
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).isEmpty
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.isEmpty instead
- def map[B](f: (Param[N, E]) => B): scala.collection.IterableOnce[B]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).map(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable
- def max(implicit ord: Ordering[Param[N, E]]): Param[N, E]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).max(ord)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.max instead
- def maxBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).maxBy(f)(cmp)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.maxBy(...) instead
- def min(implicit ord: Ordering[Param[N, E]]): Param[N, E]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).min(ord)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.min instead
- def minBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).minBy(f)(cmp)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.minBy(...) instead
- def mkString: String
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).mkString
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
- def mkString(sep: String): String
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).mkString(sep)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
- def mkString(start: String, sep: String, end: String): String
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).mkString(start, sep, end)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
- def nonEmpty: Boolean
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).nonEmpty
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.nonEmpty instead
- def product(implicit num: Numeric[Param[N, E]]): Param[N, E]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).product(num)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.product instead
- def reduce(f: (Param[N, E], Param[N, E]) => Param[N, E]): Param[N, E]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).reduce(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduce(...) instead
- def reduceLeft(f: (Param[N, E], Param[N, E]) => Param[N, E]): Param[N, E]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).reduceLeft(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceLeft(...) instead
- def reduceLeftOption(f: (Param[N, E], Param[N, E]) => Param[N, E]): Option[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).reduceLeftOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead
- def reduceOption(f: (Param[N, E], Param[N, E]) => Param[N, E]): Option[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).reduceOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceOption(...) instead
- def reduceRight(f: (Param[N, E], Param[N, E]) => Param[N, E]): Param[N, E]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).reduceRight(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceRight(...) instead
- def reduceRightOption(f: (Param[N, E], Param[N, E]) => Param[N, E]): Option[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).reduceRightOption(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.reduceRightOption(...) instead
- final def repr: Graph[N, E]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
- def sameElements[B >: A](that: scala.collection.IterableOnce[B]): Boolean
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.sameElements instead
- def seq: Graph.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- def size: Int
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).size
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.size instead
- def sum(implicit num: Numeric[Param[N, E]]): Param[N, E]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).sum(num)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.sum instead
- def to[C1](factory: Factory[Param[N, E], C1]): C1
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).to(factory)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(factory) instead
- def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).toArray(arg0)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.toArray
- def toBuffer[B >: A]: Buffer[B]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).toBuffer
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead
- def toIndexedSeq: IndexedSeq[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).toIndexedSeq
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.toIndexedSeq instead
- final def toIterable: Iterable[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).toIterable
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
- final def toIterable: Graph.this.type
- Definition Classes
- Iterable → IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to
toListortoSeq, but it doesn't copy non-immutable collections
- def toIterator: Iterator[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).toIterator
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead
- final def toIterator: Iterator[Param[N, E]]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- def toList: List[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).toList
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(List) instead
- def toMap[K, V](implicit ev: <:<[Param[N, E], (K, V)]): Map[K, V]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).toMap(ev)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.to(Map) instead
- def toSeq: Seq[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).toSeq
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Seq) instead
- def toSet[B >: A]: Set[B]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).toSet
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Set) instead
- def toStream: Stream[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).toStream
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(LazyList) instead
- final def toStream: Stream[Param[N, E]]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: Traversable[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).toTraversable
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
- final def toTraversable: Traversable[Param[N, E]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to
toListortoSeq, but it doesn't copy non-immutable collections
- def toVector: Vector[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).toVector
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator.to(Vector) instead
- def view(from: Int, until: Int): View[Param[N, E]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)
- def withFilter(f: (Param[N, E]) => Boolean): Iterator[Param[N, E]]
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
- 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:(graph: IterableOnceExtensionMethods[Param[N, E]]).withFilter(f)
- Definition Classes
- IterableOnceExtensionMethods
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .iterator.withFilter(...) instead
- def →[B](y: B): (Graph[N, E], B)
- Implicit
- This member is added by an implicit conversion from Graph[N, E] toArrowAssoc[Graph[N, E]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use
->instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.