trait Graph[N, E[X] <: EdgeLikeIn[X]] extends collection.Graph[N, E] with GraphLike[N, E, Graph]
The main trait for mutable graphs bundling the functionality of traits concerned with specific aspects.
 N
the type of the nodes (vertices) in this graph.
 E
the kind of the edges in this graph.
 Alphabetic
 By Inheritance
 Graph
 GraphLike
 Mutable
 EdgeOps
 Cloneable
 Cloneable
 Cloneable
 Shrinkable
 Growable
 Clearable
 Graph
 GraphLike
 GraphDegree
 GraphTraversal
 GraphBase
 Serializable
 Serializable
 Set
 SetLike
 Subtractable
 GenSet
 GenericSetTemplate
 GenSetLike
 Iterable
 IterableLike
 Equals
 GenIterable
 GenIterableLike
 Traversable
 GenTraversable
 GenericTraversableTemplate
 TraversableLike
 GenTraversableLike
 Parallelizable
 TraversableOnce
 GenTraversableOnce
 FilterMonadic
 HasNewBuilder
 Function1
 AnyRef
 Any
 by anyToNode
 by CollectionsHaveToParArray
 by MonadOps
 by EdgeAssoc
 by predicateToNodePredicate
 by any2stringadd
 by StringFormat
 by Ensuring
 by ArrowAssoc
 by alternateImplicit
 Hide All
 Show All
 Public
 All
Type Members

trait
Edge
extends Serializable
 Definition Classes
 GraphBase

class
EdgeBase
extends InnerEdgeParam[N, E, NodeT, E] with InnerEdge
 Definition Classes
 GraphBase

sealed
trait
EdgeOrdering
extends Ordering[EdgeT] with ElemOrdering
 Definition Classes
 GraphBase

sealed
trait
ElemOrdering
extends AnyRef
Base trait for graph
Ordering
s.Base trait for graph
Ordering
s. Attributes
 protected
 Definition Classes
 GraphBase

trait
InnerEdge
extends Iterable[NodeT] with InnerEdgeParam[N, E, NodeT, E] with Edge with InnerElem
 Definition Classes
 GraphBase

sealed
trait
InnerElem
extends AnyRef
 Definition Classes
 GraphBase

trait
Node
extends Serializable
 Definition Classes
 GraphBase

sealed
trait
NodeOrdering
extends Ordering[NodeT] with ElemOrdering
Ordering for the path dependent type NodeT.
Ordering for the path dependent type NodeT.
 Definition Classes
 GraphBase

trait
DegreeFunction
extends ((GraphDegree.this)#NodeT) ⇒ Int
 Definition Classes
 GraphDegree

final
class
DegreeOrdering
extends Ordering[(GraphDegree.this)#NodeT]
Decreasing ordering of nodes with respect to their degree.
Decreasing ordering of nodes with respect to their degree.
 Definition Classes
 GraphDegree

trait
Filter
[T] extends (T) ⇒ Boolean
 Definition Classes
 GraphDegree

abstract
class
NodeBase
extends This.NodeBase with InnerNodeParam[N] with This.InnerNode
 Attributes
 protected
 Definition Classes
 GraphLike

sealed abstract
class
AbstractTopologicalOrder
[+A, +T] extends AbstractTraversable[T]
Topologically ordered nodes or layers of a topological order of a graph or of an isolated graph component.
Topologically ordered nodes or layers of a topological order of a graph or of an isolated graph component.
 A
one of
NodeT
,N
 T
one of
A
or(Int, Iterable[A])
 Definition Classes
 GraphTraversal

abstract
class
Component
extends Properties
Represents a component of
this
graph.Represents a component of
this
graph. Edges and bridges are computed lazily. Components will be instantiated by componentTraverser or strongComponentTraverser. Definition Classes
 GraphTraversal

abstract
class
ComponentTraverser
extends FluentProperties[ComponentTraverser] with Properties with Traversable[Component]
Controls the properties of graph traversals with no specific root and allows you to produce the (weekly) connected components by a traversal or call methods like
findCycle
that work componentwise.Controls the properties of graph traversals with no specific root and allows you to produce the (weekly) connected components by a traversal or call methods like
findCycle
that work componentwise. 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 ::= startendnode { edge node } edge startendnode
All nodes and edges on the path are distinct except the start and end nodes that are equal. A cycle contains at least a start node followed by any number of consecutive pairs of an edge and a node and the end node equaling to the start node. The first element is the start node, the second is an edge with its tail being the start node and its head being the third element etc.
 Definition Classes
 GraphTraversal

trait
ExtendedNodeVisitor
[U] extends (NodeT) ⇒ U with (NodeT, Int, Int, ⇒ NodeInformer) ⇒ U
Template for extended node visitors.
Template for extended node visitors. While the default node visitor of the type
NodeT => U
passes 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 fluentinterface manner.
Properties and methods for creating modified properties in a fluentinterface manner.
 Attributes
 protected
 Definition Classes
 GraphTraversal

abstract
class
InnerEdgeTraverser
extends TraverserMethods[EdgeT, InnerEdgeTraverser] with Traverser[EdgeT, InnerEdgeTraverser]
Controls the properties of inneredge graph traversals.
Controls the properties of inneredge graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.
 Definition Classes
 GraphTraversal

abstract
class
InnerElemTraverser
extends TraverserMethods[InnerElem, InnerElemTraverser] with Traverser[InnerElem, InnerElemTraverser]
Controls the properties of innerelement graph traversals.
Controls the properties of innerelement graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.
 Attributes
 protected
 Definition Classes
 GraphTraversal

abstract
class
InnerNodeDownUpTraverser
extends TraverserMethods[(Boolean, NodeT), InnerNodeDownUpTraverser] with Traverser[(Boolean, NodeT), InnerNodeDownUpTraverser]
Controls the properties of innernode downup graph traversals.
Controls the properties of innernode downup graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.
 Definition Classes
 GraphTraversal

abstract
class
InnerNodeTraverser
extends TraverserMethods[NodeT, InnerNodeTraverser] with Traverser[NodeT, InnerNodeTraverser]
Controls the properties of innernode graph traversals.
Controls the properties of innernode graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.
 Definition Classes
 GraphTraversal

case class
Layer
(index: Int, nodes: IndexedSeq[NodeT]) extends Product with Serializable
Represents a topological sort layer.
Represents a topological sort layer.
 Definition Classes
 GraphTraversal

final
class
LayeredTopologicalOrder
[+A] extends AbstractTopologicalOrder[A, (Int, Iterable[A])]
Layers of a topological order of a graph or of an isolated graph component.
Layers of a topological order of a graph or of an isolated graph component. The layers of a topological sort can roughly be defined as follows:
 layer 0 contains all nodes having no predecessors,
 layer n contains those nodes that have only predecessors in anchestor layers with at least one of them contained in layer n  1
 A
one of
NodeT
,N
 Definition Classes
 GraphTraversal

abstract
class
OuterEdgeTraverser
extends TraverserMethods[E[N], OuterEdgeTraverser] with Traverser[E[N], OuterEdgeTraverser]
Controls the properties of outeredge graph traversals.
Controls the properties of outeredge graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.
 Definition Classes
 GraphTraversal

trait
OuterElemTraverser
extends TraverserMethods[OuterElem[N, E], OuterElemTraverser] with Traverser[OuterElem[N, E], OuterElemTraverser]
Controls the properties of outerelement graph traversals.
Controls the properties of outerelement graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.
 Definition Classes
 GraphTraversal

abstract
class
OuterNodeDownUpTraverser
extends TraverserMethods[(Boolean, N), OuterNodeDownUpTraverser] with Traverser[(Boolean, N), OuterNodeDownUpTraverser]
Controls the properties of outernode downup graph traversals.
Controls the properties of outernode downup graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.
 Definition Classes
 GraphTraversal

abstract
class
OuterNodeTraverser
extends TraverserMethods[N, OuterNodeTraverser] with Traverser[N, OuterNodeTraverser]
Controls the properties of outernode graph traversals.
Controls the properties of outernode graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.
 Definition Classes
 GraphTraversal

trait
Path
extends Walk
Represents a path in this graph where
Represents a path in this graph where
path
::= node { edge node }
Nodes and edges on the path are distinct. A walk/path contains at least one node followed by any number of consecutive pairs of an edge and a node. The first element is the start node, the second is an edge with its source being the start node and its target being the third element etc.
 Definition Classes
 GraphTraversal

trait
PathBuilder
extends WalkBuilder with Builder[InnerElem, Path]
A
Builder
for valid paths in this graph.A
Builder
for 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
add
instead of+=
to track failed additions. Definition Classes
 GraphTraversal

trait
Properties
extends SubgraphProperties
Properties controlling traversals.
Properties controlling traversals.
 Attributes
 protected
 Definition Classes
 GraphTraversal

abstract
class
StrongComponentTraverser
extends FluentProperties[StrongComponentTraverser] with Properties with Traversable[Component]
Controls the properties of graph traversals with no specific root and allows you to produce the strongly connected components by a traversal.
Controls the properties of graph traversals with no specific root and allows you to produce the strongly connected components by a traversal.
 Definition Classes
 GraphTraversal

trait
SubgraphProperties
extends AnyRef
Properties controlling the scope of traversals.
Properties controlling the scope of traversals.
 Attributes
 protected
 Definition Classes
 GraphTraversal

final
class
TopologicalOrder
[+A] extends AbstractTopologicalOrder[A, A]
A traversable topological order of nodes of a graph or of an isolated graph component.
A traversable topological order of nodes of a graph or of an isolated graph component.
 A
one of
NodeT
,N
 Definition Classes
 GraphTraversal

trait
Traverser
[A, +This <: Traverser[A, This]] extends TraverserMethods[A, This] with Properties with Traversable[A]
Controls the properties of consecutive graph traversals starting at a root node.
Controls the properties of consecutive graph traversals starting at a root node. Provides methods to refine the properties and to invoke traversals. Instances will be created by innerNodeTraverser etc.
 Definition Classes
 GraphTraversal

trait
TraverserInnerNode
extends InnerNode
 Definition Classes
 GraphTraversal

abstract
class
TraverserMethods
[A, +This <: TraverserMethods[A, This]] extends FluentProperties[This]
The
root
related methods Traverser will inherit.The
root
related methods Traverser will inherit. Attributes
 protected
 Definition Classes
 GraphTraversal

trait
Walk
extends Traversable[InnerElem]
Represents a walk in this graph where
walk
::= node { edge node }
A walk/path contains at least one node followed by any number of consecutive pairs of an edge and a node.Represents a walk in this graph where
walk
::= node { edge node }
A walk/path contains at least one node followed by any number of consecutive pairs of an edge and a node. The first element is the start node, the second is an edge with its source being the start node and its target being the third element etc. Definition Classes
 GraphTraversal

trait
WalkBuilder
extends Builder[InnerElem, Walk]
A
Builder
for valid walks in this graph.A
Builder
for 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
add
instead of+=
to track failed additions. Definition Classes
 GraphTraversal

class
Weight
extends AnyRef
Stores a value and an edge weight function for use in weightbased traversals that may be defined by
withMaxWeight
.Stores a value and an edge weight function for use in weightbased traversals that may be defined by
withMaxWeight
. Definition Classes
 GraphTraversal

trait
InnerNodeOps
extends AnyRef
 Definition Classes
 EdgeOps

abstract
type
Config <: GraphConfig
 Attributes
 protected
 Definition Classes
 GraphLike

type
CycleNodeOrTopologicalOrder = Either[NodeT, TopologicalOrder[NodeT]]
Either a
Right
containing a valid topological order or aLeft
containing a node on a cycle.Either a
Right
containing a valid topological order or aLeft
containing a node on a cycle. Definition Classes
 GraphTraversal

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
 Definition Classes
 GraphBase

type
Layers = Traversable[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 → GraphLike → GraphTraversal → GraphBase

type
Self = Graph[N, E]
 Attributes
 protected[this]
 Definition Classes
 TraversableLike

type
ThisGraph = Graph.this.type
 Attributes
 protected
 Definition Classes
 GraphLike

class
WithFilter extends FilterMonadic[A, Repr]
 Definition Classes
 TraversableLike

trait
EdgeSet
extends Set[This.EdgeT] with This.EdgeSet
 Definition Classes
 GraphLike

trait
InnerNode
extends This.InnerNode with This.InnerNodeOps
 Definition Classes
 GraphLike

trait
NodeSet
extends Set[This.NodeT] with This.NodeSet
 Definition Classes
 GraphLike
Abstract Value Members

abstract
def
+=#(edge: E[N]): Graph.this.type
 Attributes
 protected
 Definition Classes
 GraphLike

abstract
def
add(edge: E[N]): Boolean
 Definition Classes
 GraphLike

abstract
def
add(node: N): Boolean
Adds a node to this graph.
Adds a node to this graph.
 returns
true
if the node was not yet present in the graph,false
otherwise.
 Definition Classes
 GraphLike

abstract
def
clear(): Unit
 Definition Classes
 Growable → Clearable

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 (weekly) connected components of this possibly disconnected graph.
Creates a ComponentTraverser responsible for invoking graph traversal methods in all (weekly) 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
NodeOrdering
orEdgeOrdering
different fromNoOrdering
is 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
Graph
commonly referred to as E(G).The edge set of this
Graph
commonly referred to as E(G). returns
Set of all contained edges.
 Definition Classes
 GraphBase

abstract
val
graphCompanion: GraphCompanion[Graph]
The companion object of
This
.The companion object of
This
. Definition Classes
 GraphLike

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.Traversable[EdgeT]
.Creates a InnerEdgeTraverser based on
scala.collection.Traversable[EdgeT]
. root
The node where subsequent graph traversals start.
 parameters
The properties controlling subsequent traversals.
 subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
 subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
 ordering
If a
NodeOrdering
orEdgeOrdering
different fromNoOrdering
is 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.Traversable[InnerElem]
.Creates a InnerElemTraverser based on
scala.collection.Traversable[InnerElem]
. root
The node where subsequent graph traversals start.
 parameters
The properties controlling subsequent traversals.
 subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
 subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
 ordering
If a
NodeOrdering
orEdgeOrdering
different fromNoOrdering
is 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.Traversable[(Boolean, NodeT)]
where theBoolean
parameter istrue
if the traversal takes place in downward andfalse
if it takes place in upward direction.Creates a InnerNodeDownUpTraverser based on
scala.collection.Traversable[(Boolean, NodeT)]
where theBoolean
parameter istrue
if the traversal takes place in downward andfalse
if it takes place in upward direction. root
The node where subsequent graph traversals start.
 parameters
The properties controlling subsequent traversals. A
kind
different fromDepthFirst
will 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
NodeOrdering
orEdgeOrdering
different fromNoOrdering
is 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.Traversable[NodeT]
.Creates a InnerNodeTraverser based on
scala.collection.Traversable[NodeT]
. root
The node where subsequent graph traversals start.
 parameters
The properties controlling subsequent traversals.
 subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
 subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
 ordering
If a
NodeOrdering
orEdgeOrdering
different fromNoOrdering
is 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
Graph
commonly referred to as V(G).The node (vertex) set of this
Graph
commonly 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.Traversable[E[N]]
.Creates a OuterEdgeTraverser based on
scala.collection.Traversable[E[N]]
. root
The node where subsequent graph traversals start.
 parameters
The properties controlling subsequent traversals.
 subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
 subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
 ordering
If a
NodeOrdering
orEdgeOrdering
different fromNoOrdering
is 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.Traversable[OuterElem]
.Creates a OuterElemTraverser based on
scala.collection.Traversable[OuterElem]
. root
The node where subsequent graph traversals start.
 parameters
The properties controlling subsequent traversals.
 subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
 subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
 ordering
If a
NodeOrdering
orEdgeOrdering
different fromNoOrdering
is 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.Traversable[(Boolean, N)]
where theBoolean
parameter istrue
if the traversal takes place in downward andfalse
if it takes place in upward direction.Creates a OuterNodeDownUpTraverser based on
scala.collection.Traversable[(Boolean, N)]
where theBoolean
parameter istrue
if the traversal takes place in downward andfalse
if it takes place in upward direction. root
The node where subsequent graph traversals start.
 parameters
The properties controlling subsequent traversals. A
kind
different fromDepthFirst
will 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
NodeOrdering
orEdgeOrdering
different fromNoOrdering
is 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.Traversable[N]
.Creates a OuterNodeTraverser based on
scala.collection.Traversable[N]
. root
The node where subsequent graph traversals start.
 parameters
The properties controlling subsequent traversals.
 subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
 subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
 ordering
If a
NodeOrdering
orEdgeOrdering
different fromNoOrdering
is 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
NodeOrdering
orEdgeOrdering
different fromNoOrdering
is 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
upsert(edge: E[N]): Boolean
If an inner edge equaling to
edge
is present in this graph, it is replaced byedge
, otherwiseedge
will be inserted.If an inner edge equaling to
edge
is present in this graph, it is replaced byedge
, otherwiseedge
will be inserted. Such an update may be useful whenever nonkey parts of an immutable edge are to be modified. edge
The edge to add to this graph.
 returns
true
ifedge
has been inserted.
 Definition Classes
 GraphLike
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
ExtendedNodeVisitor
 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

def
&(that: GenSet[Param[N, E]]): Graph[N, E]
 Definition Classes
 GenSetLike

def
&=(coll: Iterable[Param[N, E]]): Graph.this.type
Shrinks this graph to its intersection with
coll
.Shrinks this graph to its intersection with
coll
. coll
Collection of nodes and/or edges to intersect with;
 returns
this graph shrinked by the nodes and edges not contained in
coll
.
 Definition Classes
 GraphLike

def
&~(that: GenSet[Param[N, E]]): Graph[N, E]
 Definition Classes
 GenSetLike

def
+(node: N): Graph[N, E]
Creates a new supergraph with an additional node, unless the node passed is already present.

def
+(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
elem
is of type N, the wrapped object is added to the node set otherwise to the edge set. returns
a new supergraph containing all nodes and edges of this graph plus
elem
.
 Definition Classes
 GraphLike → SetLike → GenSetLike

def
+(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): Graph[N, E]
 Definition Classes
 SetLike

final
def
+#(edge: E[N]): Graph[N, E]
Creates a new supergraph with an additional edge, unless the edge passed is already present.

def
++(elems: GenTraversableOnce[Param[N, E]]): Graph[N, E]
 Definition Classes
 GraphLike → SetLike

def
++[B >: Param[N, E], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Graph[N, E], B, That]): That
 Definition Classes
 TraversableLike → GenTraversableLike

def
++:[B >: Param[N, E], That](that: Traversable[B])(implicit bf: CanBuildFrom[Graph[N, E], B, That]): That
 Definition Classes
 TraversableLike

def
++:[B >: Param[N, E], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Graph[N, E], B, That]): That
 Definition Classes
 TraversableLike

def
++=(xs: TraversableOnce[Param[N, E]]): Graph.this.type
 Definition Classes
 GraphLike → Growable

def
+=(elem: Param[N, E]): Graph.this.type
 Definition Classes
 GraphLike → Growable

final
def
+=(node: N): Graph.this.type
 Definition Classes
 GraphLike
 Annotations
 @inline()

def
+=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): Graph.this.type
 Definition Classes
 Growable

final
def
+~%+=[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): Graph.this.type
Same as
addWLEdge(node_1, node_2, nodes)(weight, label)
except for the returned result.Same as
addWLEdge(node_1, node_2, nodes)(weight, label)
except for the returned result. returns
This mutable graph containing the hyperedge that has been created or found. to be created
equals
to an already existing hyperedge.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
+~%+=[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: N, node_2: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): Graph.this.type
Same as
addWLEdge(node_1, node_2)(weight, label)
except for the returned result.Same as
addWLEdge(node_1, node_2)(weight, label)
except for the returned result. returns
This mutable graph containing the edge that has been created or found.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
+~%=[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: N, node_2: N, nodes: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): Graph.this.type
Same as
addWEdge(node_1, node_2, nodes)(weight)
except for the returned result.Same as
addWEdge(node_1, node_2, nodes)(weight)
except for the returned result. returns
This mutable graph containing the hyperedge that has been created or found. to be created
equals
to an already existing hyperedge.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
+~%=[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): Graph.this.type
Same as
addWEdge(node_1, node_2)(weight)
except for the returned result.Same as
addWEdge(node_1, node_2)(weight)
except for the returned result. returns
This mutable graph containing the edge that has been created or found.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
+~+=[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): Graph.this.type
Same as
addLEdge(node_1, node_2, nodes)(label)
except for the returned result.Same as
addLEdge(node_1, node_2, nodes)(label)
except for the returned result. returns
This mutable graph containing the hyperedge that has been created or found. to be created
equals
to an already existing hyperedge.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
+~+=[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): Graph.this.type
Same as
addLEdge(node_1, node_2)(label)
except for the returned result.Same as
addLEdge(node_1, node_2)(label)
except for the returned result. returns
This mutable graph containing the edge that has been created or found.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
+~=(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): Graph.this.type
Same as
addEdge(node_1, node_2, nodes)
except for the returned result.Same as
addEdge(node_1, node_2, nodes)
except for the returned result. returns
This mutable graph containing the hyperedge that has been created or found. to be created
equals
to an already existing hyperedge.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
+~=(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): Graph.this.type
Same as
addEdge(node_1, node_2)
except for the returned result.Same as
addEdge(node_1, node_2)
except for the returned result. returns
This mutable graph containing the edge that has been created or found.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
(edge: E[N]): Graph[N, E]
 Definition Classes
 GraphLike
 Annotations
 @inline()

final
def
(node: N): Graph[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph except
node
and those edges whichnode
is incident with. 
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
. Ifelem
is of type N, this method maps to(node: N)
. Otherwise the edge is deleted leaving the node set unchanged. elem
node or edge to be removed.
 returns
the new subgraph of this graph after the "ripple" deletion of the passed node or the simple deletion of the passed edge.
 Definition Classes
 GraphLike → SetLike → Subtractable → GenSetLike

def
(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): Graph[N, E]
 Definition Classes
 Subtractable

final
def
!(edge: E[N]): Graph[N, E]
 Definition Classes
 GraphLike
 Annotations
 @inline()

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
. Ifelem
is of type N, this method maps to(node: N)
. Otherwise the edge is deleted along with those incident nodes which would become edgeless 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

final
def
!#(edge: E[N]): Graph[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph except
edge
and those nodes which are incident withedge
and would become edgeless after deletion.Creates a new subgraph consisting of all nodes and edges of this graph except
edge
and those nodes which are incident withedge
and would become edgeless after deletion. edge
the edge to be removed.
 returns
a new subgraph of this graph after the "ripple" deletion of
edge
from this graph.

def
!=(elem: Param[N, E]): Graph.this.type
 Definition Classes
 GraphLike

final
def
!=#(edge: E[N]): Graph.this.type
 Attributes
 protected
 Definition Classes
 GraphLike
 Annotations
 @inline()

final
def
#(edge: E[N]): Graph[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph but
edge
.Creates a new subgraph consisting of all nodes and edges of this graph but
edge
. The node set remains unchanged. edge
the edge to be removed.
 returns
a new subgraph of this graph that contains all nodes and edges of this graph except of
edge
.

def
(elems: GenTraversableOnce[Param[N, E]]): Graph[N, E]
 Definition Classes
 GraphLike → Subtractable

def
!(elems: GenTraversableOnce[Param[N, E]]): Graph[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph but the elements of
coll
which will be unconditionally removed.Creates a new subgraph consisting of all nodes and edges of this graph but the elements of
coll
which will be unconditionally removed. This operation differs from
in that edges are deleted along with those incident nodes which would become isolated after deletion. 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

final
def
!=(coll: Iterable[Param[N, E]]): Graph[N, E]
Removes all elements of
coll
from this graph.Removes all elements of
coll
from this graph. Edges will be ripple removed. coll
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.
 returns
this graph shrinked by the nodes and edges contained in
coll
.
 Definition Classes
 GraphLike
 Annotations
 @inline()

def
=(xs: TraversableOnce[Param[N, E]]): Graph.this.type
 Definition Classes
 Shrinkable

def
=(elem: Param[N, E]): Graph.this.type
 Definition Classes
 GraphLike → Shrinkable

final
def
=(node: N): Graph.this.type
 Definition Classes
 GraphLike
 Annotations
 @inline()

def
=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): Graph.this.type
 Definition Classes
 Shrinkable

final
def
=#(edge: E[N]): Graph.this.type
 Attributes
 protected
 Definition Classes
 GraphLike
 Annotations
 @inline()
 def >[B](y: B): (Graph[N, E], B)

final
def
?(node: N): Graph[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph but
node
which is conditionally removed from this graph.Creates a new subgraph consisting of all nodes and edges of this graph but
node
which 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
. Ifnode
could not be deleted, the new graph is a copy of this graph.

final
def
?=(node: N): Graph.this.type
 Definition Classes
 GraphLike
 Annotations
 @inline()

def
/:[B](z: B)(op: (B, Param[N, E]) ⇒ B): B
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
:\[B](z: B)(op: (Param[N, E], B) ⇒ B): B
 Definition Classes
 TraversableOnce → GenTraversableOnce

final
def
==(arg0: Any): Boolean
 Definition Classes
 AnyRef → Any

final
def
addAndGet(edge: E[N]): EdgeT
Adds the given edge if not yet present and returns it as an inner edge.
Adds the given edge if not yet present and returns it as an inner edge.
 edge
the edge to add.
 returns
the inner edge containing the added edge.
 Definition Classes
 GraphLike
 Annotations
 @inline()

final
def
addAndGet(node: N): NodeT
Adds the given node if not yet present and returns it as an inner node.
Adds the given node if not yet present and returns it as an inner node.
 node
the node to add.
 returns
inner node containing the added node.
 Definition Classes
 GraphLike
 Annotations
 @inline()

def
addAndGetEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): EdgeT
Same as
addEdge(node_1, node_2, nodes)
except for the returned result.Same as
addEdge(node_1, node_2, nodes)
except for the returned result. returns
The new hyperedge or the corresponding contained hyperedge if the hyperedge to be created
equals
to an already existing hyperedge.
 Definition Classes
 EdgeOps

final
def
addAndGetEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): EdgeT
Same as
addEdge(node_1, node_2)
except for the returned result.Same as
addEdge(node_1, node_2)
except for the returned result. returns
The new edge or the corresponding contained edge if the edge to be created
equals
to an already existing edge.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

def
addAndGetLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): EdgeT
Same as
addLEdge(node_1, node_2, nodes)(label)
except for the returned result.Same as
addLEdge(node_1, node_2, nodes)(label)
except for the returned result. returns
The new hyperedge or the corresponding contained hyperedge if the hyperedge to be created
equals
to an already existing hyperedge.
 Definition Classes
 EdgeOps

final
def
addAndGetLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): EdgeT
Same as
addLEdge(node_1, node_2)(label)
except for the returned result.Same as
addLEdge(node_1, node_2)(label)
except for the returned result. returns
The new edge or the corresponding contained edge if the edge to be created
equals
to an already existing edge.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

def
addAndGetWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: N, node_2: N, nodes: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): EdgeT
Same as
addWEdge(node_1, node_2, nodes)(weight)
except for the returned result.Same as
addWEdge(node_1, node_2, nodes)(weight)
except for the returned result. returns
The new hyperedge or the corresponding contained hyperedge if the hyperedge to be created
equals
to an already existing hyperedge.
 Definition Classes
 EdgeOps

final
def
addAndGetWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): EdgeT
Same as
addWEdge(node_1, node_2)(weight)
except for the returned result.Same as
addWEdge(node_1, node_2)(weight)
except for the returned result. returns
The new edge or the corresponding contained edge if the edge to be created
equals
to an already existing edge.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

def
addAndGetWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): EdgeT
Same as
addWLEdge(node_1, node_2, nodes)(weight, label)
except for the returned result.Same as
addWLEdge(node_1, node_2, nodes)(weight, label)
except for the returned result. returns
The new hyperedge or the corresponding contained hyperedge if the hyperedge to be created
equals
to an already existing hyperedge.
 Definition Classes
 EdgeOps

final
def
addAndGetWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: N, node_2: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): EdgeT
Same as
addWLEdge(node_1, node_2)(weight, label)
except for the returned result.Same as
addWLEdge(node_1, node_2)(weight, label)
except for the returned result. returns
The new edge or the corresponding contained edge if the edge to be created
equals
to an already existing edge.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
addEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): Boolean
Creates a new inner hyperedge between
node_1
,node_2
andnodes
usingedgeFactory
and adds it to the edge set of this graph.Creates a new inner hyperedge between
node_1
,node_2
andnodes
usingedgeFactory
and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. node_1
The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.
 node_2
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
 nodes
The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.
 edgeFactory
An edge companion who's
from
is to serve as the edge factory. returns
true
if a new hyperedge has been created.false
if no new hyperedge could be created because there exists a corresponding equaling hyperedge.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
addEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): Boolean
Creates a new inner edge between
node_1
andnode_2
usingedgeFactory
and adds it to the edge set of this graph.Creates a new inner edge between
node_1
andnode_2
usingedgeFactory
and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. node_1
The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.
 node_2
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
 edgeFactory
An edge companion who's
from
is to serve as the edge factory. returns
true
if a new edge has been created.false
if no new edge could be created because there exists a corresponding equaling edge.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
addLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): Boolean
Creates a new weighted and labeled inner hyperedge between
node_1
,node_2
andnodes
usingedgeFactory
and adds it to the edge set of this graph.Creates a new weighted and labeled inner hyperedge between
node_1
,node_2
andnodes
usingedgeFactory
and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. node_1
The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.
 node_2
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
 nodes
The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.
 label
The value the labeled edge to be created should have as its label.
 edgeFactory
An edge companion who's
from
is to serve as the edge factory. returns
true
if a new hyperedge has been created.false
if no new hyperedge could be created because there exists a corresponding equaling hyperedge.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
addLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): Boolean
Creates a new labeled inner edge between
node_1
andnode_2
usingedgeFactory
and adds it to the edge set of this graph.Creates a new labeled inner edge between
node_1
andnode_2
usingedgeFactory
and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. node_1
The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.
 node_2
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
 label
The value the labeled edge to be created should have as its label.
 edgeFactory
An edge companion who's
from
is to serve as the edge factory. returns
true
if a new edge has been created.false
if no new edge could be created because there exists a corresponding equaling edge.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

def
addString(b: StringBuilder): StringBuilder
 Definition Classes
 TraversableOnce

def
addString(b: StringBuilder, sep: String): StringBuilder
 Definition Classes
 TraversableOnce

def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
 Definition Classes
 TraversableOnce

final
def
addWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: N, node_2: N, nodes: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): Boolean
Creates a new weighted inner hyperedge between
node_1
,node_2
andnodes
usingedgeFactory
and adds it to the edge set of this graph.Creates a new weighted inner hyperedge between
node_1
,node_2
andnodes
usingedgeFactory
and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. node_1
The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.
 node_2
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
 nodes
The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.
 weight
The number the weighted edge to be created should have as its weight.
 edgeFactory
An edge companion who's
from
is to serve as the edge factory. returns
true
if a new hyperedge has been created.false
if no new hyperedge could be created because there exists a corresponding equaling hyperedge.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
addWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): Boolean
Creates a new weighted inner edge between
node_1
andnode_2
usingedgeFactory
and adds it to the edge set of this graph.Creates a new weighted inner edge between
node_1
andnode_2
usingedgeFactory
and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. node_1
The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.
 node_2
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
 weight
The number the weighted edge to be created should have as its weight.
 edgeFactory
An edge companion who's
from
is to serve as the edge factory. returns
true
if a new edge has been created.false
if no new edge could be created because there exists a corresponding equaling edge.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
addWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): Boolean
Creates a new weighted and labeled inner hyperedge between
node_1
,node_2
andnodes
usingedgeFactory
and adds it to the edge set of this graph.Creates a new weighted and labeled inner hyperedge between
node_1
,node_2
andnodes
usingedgeFactory
and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. node_1
The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.
 node_2
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
 nodes
The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.
 weight
The number the weighted edge to be created should have as its weight.
 label
The value the labeled edge to be created should have as its label.
 edgeFactory
An edge companion who's
from
is to serve as the edge factory. returns
true
if a new hyperedge has been created.false
if no new hyperedge could be created because there exists a corresponding equaling hyperedge.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
addWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: N, node_2: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): Boolean
Creates a new weighted and labeled inner edge between
node_1
andnode_2
usingedgeFactory
and adds it to the edge set of this graph.Creates a new weighted and labeled inner edge between
node_1
andnode_2
usingedgeFactory
and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. node_1
The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.
 node_2
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
 weight
The number the weighted edge to be created should have as its weight.
 label
The value the labeled edge to be created should have as its label.
 edgeFactory
An edge companion who's
from
is to serve as the edge factory. returns
true
if a new edge has been created.false
if no new edge could be created because there exists a corresponding equaling edge.
 Definition Classes
 EdgeOps
 Annotations
 @inline()

def
aggregate[B](z: ⇒ B)(seqop: (B, Param[N, E]) ⇒ B, combop: (B, B) ⇒ B): B
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
andThen[A](g: (Boolean) ⇒ A): (Param[N, E]) ⇒ A
 Definition Classes
 Function1
 Annotations
 @unspecialized()

final
val
anyEdge: EdgeFilter
Default edge filter letting path all edges (nonfilter).
Default edge filter letting path all edges (nonfilter).
 Definition Classes
 GraphBase

final
def
anyEdgeSelector(from: NodeT, to: NodeT): Option[EdgeT]
An arbitrary edge between
from
andto
that is available most efficiently.An arbitrary edge between
from
andto
that is available most efficiently. Definition Classes
 GraphTraversal
 Annotations
 @inline()

final
val
anyNode: NodeFilter
Default node filter letting traverse all nodes (nonfilter).
Default node filter letting traverse all nodes (nonfilter).
 Definition Classes
 GraphBase

final
lazy val
anyOrdering: AnyOrdering[N]
 Attributes
 protected
 Definition Classes
 GraphBase

def
apply(elem: Param[N, E]): Boolean
 Definition Classes
 GenSetLike → Function1

final
def
asInstanceOf[T0]: T0
 Definition Classes
 Any

def
asSortedString(nodeSeparator: String = GraphBase.defaultSeparator, edgeSeparator: String = GraphBase.defaultSeparator, nodesEdgesSeparator: String = GraphBase.defaultSeparator, withNodesEdgesPrefix: Boolean = false)(implicit ordNode: NodeOrdering = defaultNodeOrdering, ordEdge: EdgeOrdering = defaultEdgeOrdering): String
Sorts all nodes of this graph by
ordNode
followed by all edges sorted byordEdge
and concatinates their string representationnodeSeparator
andedgeSeparator
respectively.Sorts all nodes of this graph by
ordNode
followed by all edges sorted byordEdge
and concatinates their string representationnodeSeparator
andedgeSeparator
respectively. 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: GenTraversableOnce[Param[N, E]], isPlusPlus: Boolean): Graph[N, E]
Prepares and calls
plusPlus
orminusMinus
.Prepares and calls
plusPlus
orminusMinus
. Attributes
 protected
 Definition Classes
 GraphLike

def
canEqual(that: Any): Boolean
 Definition Classes
 IterableLike → Equals

def
clone(): Graph[N, E]
 Definition Classes
 GraphLike → Cloneable → AnyRef

def
collect[B, That](pf: PartialFunction[Param[N, E], B])(implicit bf: CanBuildFrom[Graph[N, E], B, That]): That
 Definition Classes
 TraversableLike → GenTraversableLike

def
collectFirst[B](pf: PartialFunction[Param[N, E], B]): Option[B]
 Definition Classes
 TraversableOnce

def
companion: GenericCompanion[Set]
 Definition Classes
 Set → GenSet → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

def
compose[A](g: (A) ⇒ Param[N, E]): (A) ⇒ Boolean
 Definition Classes
 Function1
 Annotations
 @unspecialized()

def
contains(elem: Param[N, E]): Boolean
Checks whether a given node or edge is contained in this graph.
Checks whether a given node or edge is contained in this graph.
 elem
the node or edge the existence of which is to be checked
 returns
true if
elem
is contained in this graph
 Definition Classes
 GraphLike → SetLike → GenSetLike

def
copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Unit
 Definition Classes
 IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

def
copyToArray[B >: Param[N, E]](xs: Array[B]): Unit
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
copyToArray[B >: Param[N, E]](xs: Array[B], start: Int): Unit
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
copyToBuffer[B >: Param[N, E]](dest: Buffer[B]): Unit
 Definition Classes
 TraversableOnce

def
count(p: (Param[N, E]) ⇒ Boolean): Int
 Definition Classes
 TraversableOnce → GenTraversableOnce

final
lazy val
defaultEdgeOrdering: 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 nonincreasing 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 nonincreasing sequence of degrees over all nodes.
The degree sequence of this graph, that is the nonincreasing 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: GenSet[Param[N, E]]): Graph[N, E]
 Definition Classes
 SetLike → GenSetLike

def
drop(n: Int): Graph[N, E]
 Definition Classes
 IterableLike → TraversableLike → GenTraversableLike

def
dropRight(n: Int): Graph[N, E]
 Definition Classes
 IterableLike

def
dropWhile(p: (Param[N, E]) ⇒ Boolean): Graph[N, E]
 Definition Classes
 TraversableLike → GenTraversableLike

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
Graph
instances are equal if their nodes and edges turned to outer nodes and outer edges are equal.Graph
instances are equal if their nodes and edges turned to outer nodes and outer edges are equal. AnyTraversableOnce
instance 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
false
because of the failing nodes1
and2
. The second is true because of duplicate elimination and undirected edge equivalence. Definition Classes
 GraphLike → GenSetLike → Equals → AnyRef → Any

def
exists(p: (Param[N, E]) ⇒ Boolean): Boolean
 Definition Classes
 IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

def
filter(p: (Param[N, E]) ⇒ Boolean): Graph[N, E]
 Definition Classes
 TraversableLike → GenTraversableLike

def
filterNot(p: (Param[N, E]) ⇒ Boolean): Graph[N, E]
 Definition Classes
 TraversableLike → GenTraversableLike

def
finalize(): Unit
 Attributes
 protected[java.lang]
 Definition Classes
 AnyRef
 Annotations
 @throws( classOf[java.lang.Throwable] )

final
def
find(outerEdge: E[N]): Option[EdgeT]
Searches for an edge node equaling to
outerEdge
in this graph.Searches for an edge node equaling to
outerEdge
in this graph. outerEdge
the outer edge to search for in this graph.
 returns
Some
of the inner edge found orNone
.
 Definition Classes
 GraphLike
 Annotations
 @inline()

final
def
find(outerNode: N): Option[NodeT]
Searches for an inner node equaling to
outerNode
in this graph.Searches for an inner node equaling to
outerNode
in this graph. returns
Some
of the inner node found orNone
.
 Definition Classes
 GraphLike
 Annotations
 @inline()

def
find(p: (Param[N, E]) ⇒ Boolean): Option[Param[N, E]]
 Definition Classes
 IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

final
def
findCycle[U](implicit visitor: (InnerElem) ⇒ U = empty): Option[Cycle]
Finds a cycle in
this
graph in any of its components and callsvisitor
for each inner element visited during the search.Finds a cycle in
this
graph in any of its components and callsvisitor
for each inner element visited during the search. SeecomponentTraverser
for more control by means ofFluentProperties
. Definition Classes
 GraphTraversal

def
flatMap[B, That](f: (Param[N, E]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Graph[N, E], B, That]): That
 Definition Classes
 TraversableLike → GenTraversableLike → FilterMonadic

def
flatten[B](implicit asTraversable: (Param[N, E]) ⇒ GenTraversableOnce[B]): Set[B]
 Definition Classes
 GenericTraversableTemplate

def
fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
foldLeft[B](z: B)(op: (B, Param[N, E]) ⇒ B): B
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
foldRight[B](z: B)(op: (Param[N, E], B) ⇒ B): B
 Definition Classes
 IterableLike → TraversableOnce → GenTraversableOnce

def
forall(p: (Param[N, E]) ⇒ Boolean): Boolean
 Definition Classes
 IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

def
foreach[U](f: (Param[N, E]) ⇒ U): Unit
 Definition Classes
 IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
 def formatted(fmtstr: String): String

def
genericBuilder[B]: Builder[B, Set[B]]
 Definition Classes
 GenericTraversableTemplate

final
def
get(outerEdge: E[N]): EdgeT
Searches for an inner edge equaling to
outerEdge
in this graph which must exist in this graph.Searches for an inner edge equaling to
outerEdge
in 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
outerNode
in this graph which must exist in this graph.Searches for an inner node equaling to
outerNode
in 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[_]
 Definition Classes
 AnyRef → Any

final
def
getOrElse(outerEdge: E[N], default: EdgeT): EdgeT
Searches for an inner edge equaling to
outerEdge
in this graph.Searches for an inner edge equaling to
outerEdge
in this graph. outerEdge
the outer edge to search for in this graph.
 default
the inner edge to return if
outerEdge
cannot be found. returns
the inner edge looked up or
default
if no inner edge equaling toedge
could be found.
 Definition Classes
 GraphLike
 Annotations
 @inline()

final
def
getOrElse(outerNode: N, default: NodeT): NodeT
Searches for an inner node equaling to
outerNode
in this graph.Searches for an inner node equaling to
outerNode
in this graph. outerNode
the outer node to search for in this graph.
 default
the inner node to return if
outerNode
is not contained. returns
The inner node looked up or
default
if no inner node equaling toouterNode
could 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
size
is reserved for the number of nodes and edges becauseGraph
is alsoSetLike
with set elements being nodes or edges. Definition Classes
 GraphBase

def
groupBy[K](f: (Param[N, E]) ⇒ K): Map[K, Graph[N, E]]
 Definition Classes
 TraversableLike → GenTraversableLike

def
grouped(size: Int): Iterator[Graph[N, E]]
 Definition Classes
 IterableLike

def
hasDefiniteSize: Boolean
 Definition Classes
 TraversableLike → TraversableOnce → GenTraversableOnce

def
hashCode(): Int
 Definition Classes
 GenSetLike → 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 graphlevel method requiring a predicate such as
count
,exists
,filter
,filterNot
,forall
etc. 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
nodes
will also be included. returns
A partial function combining the passed predicates.
 Definition Classes
 GraphLike

def
head: Param[N, E]
 Definition Classes
 IterableLike → TraversableLike → GenTraversableLike

def
headOption: Option[Param[N, E]]
 Definition Classes
 TraversableLike → GenTraversableLike

def
init: Graph[N, E]
 Definition Classes
 TraversableLike → GenTraversableLike

def
initialize(nodes: Traversable[N], edges: Traversable[E[N]]): Unit
Populates this graph with
nodes
andedges
.Populates this graph with
nodes
andedges
.The implementing class will typically have a constructor with the same parameters which is invoked by
from
of 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
 TraversableLike

def
intersect(that: GenSet[Param[N, E]]): Graph[N, E]
 Definition Classes
 GenSetLike

final
def
isAcyclic: Boolean
Whether
this
graph has no cycle.Whether
this
graph has no cycle. Definition Classes
 GraphTraversal
 Annotations
 @inline()

def
isComplete: Boolean
Whether all nodes are pairwise adjacent.
Whether all nodes are pairwise adjacent.
 returns
true
if this graph is complete,false
if this graph contains any independent nodes.
 Definition Classes
 GraphTraversal

def
isConnected: Boolean
Whether
this
graph is connected if it is undirected or weakly connected if it is directed.Whether
this
graph is connected if it is undirected or weakly connected if it is directed. Definition Classes
 GraphTraversal

final
def
isCustomEdgeFilter(f: EdgeFilter): Boolean
true
iff
is not equivalent toanyEdge
.true
iff
is not equivalent toanyEdge
. Definition Classes
 GraphBase
 Annotations
 @inline()

final
def
isCustomNodeFilter(f: NodeFilter): Boolean
true
iff
is not equivalent toanyNode
.true
iff
is not equivalent toanyNode
. Definition Classes
 GraphBase
 Annotations
 @inline()

final
def
isCyclic: Boolean
Whether
this
graph has at least one cycle in any of its components.Whether
this
graph 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] to OuterNode[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

def
isEdge: Boolean
 Implicit
 This member is added by an implicit conversion from Graph[N, E] to OuterNode[Graph[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
 Definition Classes
 NodeParam

def
isEmpty: Boolean
 Definition Classes
 SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

def
isHyper: Boolean
Whether this graph contains at least one hyperedges.

final
val
isHyperT: Boolean
 Attributes
 protected
 Definition Classes
 GraphLike
 def isIn: Boolean

final
def
isInstanceOf[T0]: Boolean
 Definition Classes
 Any

def
isMulti: Boolean
Whether this graph contains at least one multiedge.
Whether this graph contains at least one multiedge. We defnie multiedges 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 multyedge 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] to OuterNode[Graph[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
 Definition Classes
 NodeParam
 def isOut: Boolean

final
def
isTraversableAgain: Boolean
 Definition Classes
 TraversableLike → GenTraversableLike → GenTraversableOnce

final
def
isTrivial: Boolean
true
if this graph has at most 1 node.true
if this graph has at most 1 node. Definition Classes
 GraphBase
 Annotations
 @inline()

def
iterator: Iterator[OutParam[N, E] with Serializable with InnerElem]
Iterates over all nodes and all edges.
Iterates over all nodes and all edges.
 returns
iterator containing all nodes and all edges
 Definition Classes
 GraphLike → GenSetLike → IterableLike → GenIterableLike

def
last: Param[N, E]
 Definition Classes
 TraversableLike → GenTraversableLike

def
lastOption: Option[Param[N, E]]
 Definition Classes
 TraversableLike → GenTraversableLike

def
map[B, That](f: (Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[Graph[N, E], B, That]): That
 Definition Classes
 SetLike → TraversableLike → GenTraversableLike → FilterMonadic
 Annotations
 @migration
 Migration
(Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.

def
max[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
maxBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
maxDegree(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): Int
The degree of the node having the highest degree or
0
if this graph is empty.The degree of the node having the highest degree or
0
if this graph is empty. Definition Classes
 GraphDegree

def
min[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
minBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
minDegree(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): Int
The degree of the node having the least degree or
0
if this graph is empty.The degree of the node having the least degree or
0
if this graph is empty. Definition Classes
 GraphDegree

def
minusMinus(delNodes: Traversable[N], delEdges: Traversable[E[N]]): Graph[N, E]
Implements the heart of

calling thefrom
factory method of the companion object.Implements the heart of

calling thefrom
factory method of the companion object. Note that this method must be reimplemented in each module having its own factory methods such asconstrained
does. Attributes
 protected
 Definition Classes
 GraphLike

def
minusMinusNodesEdges(delNodes: Traversable[N], delEdges: Traversable[E[N]]): (Set[N], Set[E[N]])
Calculates the
nodes
andedges
arguments to be passed to a factory method when delNodes and delEdges are to be deleted by
.Calculates the
nodes
andedges
arguments to be passed to a factory method when delNodes and delEdges are to be deleted by
. Attributes
 protected
 Definition Classes
 GraphLike

def
mkString: String
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
mkString(sep: String): String
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
mkString(start: String, sep: String, end: String): String
 Definition Classes
 TraversableOnce → GenTraversableOnce

val
n1: Graph[N, E]
 Implicit
 This member is added by an implicit conversion from Graph[N, E] to EdgeAssoc[Graph[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
 Definition Classes
 EdgeAssoc

final
def
ne(arg0: AnyRef): Boolean
 Definition Classes
 AnyRef

def
newBuilder: Builder[Param[N, E], Graph[N, E]]
 Attributes
 protected[this]
 Definition Classes
 SetLike → TraversableLike → HasNewBuilder

final
val
noNode: NodeFilter
Node predicate always returning
false
.Node predicate always returning
false
. Definition Classes
 GraphBase

def
nodesToCEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with CHyperEdgeBound[_, EE]](factory: CHyperEdgeCompanion[EE], attrib: Product, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]
Creates a new custom inner hyperedge without modifying the node or edge set .
Creates a new custom inner hyperedge without modifying the node or edge set .
 Attributes
 protected[scalax.collection]
 Definition Classes
 EdgeOps

def
nodesToCEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with CEdgeBound[_, EE]](factory: CEdgeCompanion[EE], attrib: Product, node_1: N, node_2: N): E[NodeT]
Creates a new custom inner edge without modifying the node or edge set .
Creates a new custom inner edge without modifying the node or edge set .
 Attributes
 protected[scalax.collection]
 Definition Classes
 EdgeOps

final
def
nodesToEdge(edgeFactory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit endpointsKind: CollectionKind): EdgeT
 Attributes
 protected
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
nodesToEdge(edgeFactory: EdgeCompanion[E], node_1: N, node_2: N): EdgeT
 Attributes
 protected
 Definition Classes
 EdgeOps
 Annotations
 @inline()

def
nodesToEdgeCont(factory: EdgeCompanion[E], node_1: N, node_2: N): E[NodeT]
Creates a new simple inner edge without modifying the node or edge set .
Creates a new simple inner edge without modifying the node or edge set .
 Attributes
 protected[scalax.collection]
 Definition Classes
 EdgeOps

def
nodesToEdgeCont(factory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]
Creates a new simple inner hyperedge without modifying the node or edge set .
Creates a new simple inner hyperedge without modifying the node or edge set .
 Attributes
 protected[scalax.collection]
 Definition Classes
 EdgeOps

final
def
nodesToLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](edgeFactory: LHyperEdgeCompanion[EE], label: L, node_1: N, node_2: N, nodes: N*): EdgeT
 Attributes
 protected
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
nodesToLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](edgeFactory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): EdgeT
 Attributes
 protected
 Definition Classes
 EdgeOps
 Annotations
 @inline()

def
nodesToLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](factory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): E[NodeT]
Creates a new labeled inner edge without modifying the node or edge set .
Creates a new labeled inner edge without modifying the node or edge set .
 Attributes
 protected[scalax.collection]
 Definition Classes
 EdgeOps

def
nodesToLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](factory: LHyperEdgeCompanion[EE], label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind = Bag): E[NodeT]
Creates a new labeled inner hyperedge without modifying the node or edge set .
Creates a new labeled inner hyperedge without modifying the node or edge set .
 Attributes
 protected[scalax.collection]
 Definition Classes
 EdgeOps

final
def
nodesToWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](edgeFactory: WHyperEdgeCompanion[EE], weight: Double, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): EdgeT
 Attributes
 protected
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
nodesToWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](edgeFactory: WEdgeCompanion[EE], weight: Double, node_1: N, node_2: N): EdgeT
 Attributes
 protected
 Definition Classes
 EdgeOps
 Annotations
 @inline()

def
nodesToWEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](factory: WEdgeCompanion[EE], weight: Double, node_1: N, node_2: N): E[NodeT]
Creates a new weighted inner edge without modifying the node or edge set .
Creates a new weighted inner edge without modifying the node or edge set .
 Attributes
 protected[scalax.collection]
 Definition Classes
 EdgeOps

def
nodesToWEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](factory: WHyperEdgeCompanion[EE], weight: Double, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]
Creates a new weighted inner hyperedge without modifying the node or edge set .
Creates a new weighted inner hyperedge without modifying the node or edge set .
 Attributes
 protected[scalax.collection]
 Definition Classes
 EdgeOps

final
def
nodesToWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](edgeFactory: WLHyperEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): EdgeT
 Attributes
 protected
 Definition Classes
 EdgeOps
 Annotations
 @inline()

final
def
nodesToWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](edgeFactory: WLEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N): EdgeT
 Attributes
 protected
 Definition Classes
 EdgeOps
 Annotations
 @inline()

def
nodesToWLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](factory: WLEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N): E[NodeT]
Creates a new weighted and labeled inner edge without modifying the node or edge set .
Creates a new weighted and labeled inner edge without modifying the node or edge set .
 Attributes
 protected[scalax.collection]
 Definition Classes
 EdgeOps

def
nodesToWLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](factory: WLHyperEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]
Creates a new weighted and labeled inner hyperedge without modifying the node or edge set .
Creates a new weighted and labeled inner hyperedge without modifying the node or edge set .
 Attributes
 protected[scalax.collection]
 Definition Classes
 EdgeOps

def
nonEmpty: Boolean
 Definition Classes
 TraversableOnce → GenTraversableOnce

final
def
nonTrivial: Boolean
true
if this graph has at least 2 nodes.true
if this graph has at least 2 nodes. Definition Classes
 GraphBase
 Annotations
 @inline()

final
def
notify(): Unit
 Definition Classes
 AnyRef

final
def
notifyAll(): Unit
 Definition Classes
 AnyRef

def
order: Int
The order  commonly referred to as G  of this graph equaling to the number of nodes.
The order  commonly referred to as G  of this graph equaling to the number of nodes.
 Definition Classes
 GraphBase

def
par: ParSet[Param[N, E]]
 Definition Classes
 Parallelizable

def
parCombiner: Combiner[Param[N, E], ParSet[Param[N, E]]]
 Attributes
 protected[this]
 Definition Classes
 SetLike → TraversableLike → Parallelizable

final
def
partition(elems: GenTraversableOnce[Param[N, E]]): Partitions[N, E]
 Attributes
 protected
 Definition Classes
 GraphLike

def
partition(p: (Param[N, E]) ⇒ Boolean): (Graph[N, E], Graph[N, E])
 Definition Classes
 TraversableLike → GenTraversableLike

def
plusPlus(newNodes: Traversable[N], newEdges: Traversable[E[N]]): Graph[N, E]
Implements the heart of
++
calling thefrom
factory method of the companion object.Implements the heart of
++
calling thefrom
factory method of the companion object. Note that this method must be reimplemented in each module having its own factory methods such asconstrained
does. Attributes
 protected
 Definition Classes
 GraphLike

def
product[B >: Param[N, E]](implicit num: Numeric[B]): B
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
reduce[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): A1
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
reduceLeft[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): B
 Definition Classes
 TraversableOnce

def
reduceLeftOption[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): Option[B]
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
reduceOption[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): Option[A1]
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
reduceRight[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): B
 Definition Classes
 IterableLike → TraversableOnce → GenTraversableOnce

def
reduceRightOption[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): Option[B]
 Definition Classes
 TraversableOnce → GenTraversableOnce

final
def
remove(edge: E[N]): Boolean
 Definition Classes
 GraphLike
 Annotations
 @inline()

final
def
remove(node: N): Boolean
 Definition Classes
 GraphLike
 Annotations
 @inline()

final
def
removeGently(node: N): Boolean
 Definition Classes
 GraphLike

final
def
removeWithNodes(edge: E[N]): Boolean
 Definition Classes
 GraphLike
 Annotations
 @inline()

def
repr: Graph[N, E]
 Definition Classes
 TraversableLike → GenTraversableLike

def
reversed: List[Param[N, E]]
 Attributes
 protected[this]
 Definition Classes
 TraversableOnce

def
sameElements[B >: Param[N, E]](that: GenIterable[B]): Boolean
 Definition Classes
 IterableLike → GenIterableLike

def
scan[B >: Param[N, E], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Graph[N, E], B, That]): That
 Definition Classes
 TraversableLike → GenTraversableLike

def
scanLeft[B, That](z: B)(op: (B, Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[Graph[N, E], B, That]): That
 Definition Classes
 TraversableLike → GenTraversableLike

def
scanRight[B, That](z: B)(op: (Param[N, E], B) ⇒ B)(implicit bf: CanBuildFrom[Graph[N, E], B, That]): That
 Definition Classes
 TraversableLike → GenTraversableLike
 Annotations
 @migration
 Migration
(Changed in version 2.9.0) The behavior of
scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.

def
seq: Set[Param[N, E]]
 Definition Classes
 Set → GenSet → GenSetLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

def
size: Int
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
sizeHintIfCheap: Int
 Attributes
 protected[scala.collection]
 Definition Classes
 GenTraversableOnce

def
slice(from: Int, until: Int): Graph[N, E]
 Definition Classes
 IterableLike → TraversableLike → GenTraversableLike

def
sliding(size: Int, step: Int): Iterator[Graph[N, E]]
 Definition Classes
 IterableLike

def
sliding(size: Int): Iterator[Graph[N, E]]
 Definition Classes
 IterableLike

def
span(p: (Param[N, E]) ⇒ Boolean): (Graph[N, E], Graph[N, E])
 Definition Classes
 TraversableLike → GenTraversableLike

def
splitAt(n: Int): (Graph[N, E], Graph[N, E])
 Definition Classes
 TraversableLike → GenTraversableLike

def
stringPrefix: String
 Definition Classes
 GraphLike → SetLike → TraversableLike → GenTraversableLike

def
subsetOf(that: GenSet[Param[N, E]]): Boolean
 Definition Classes
 GenSetLike

def
subsets(): Iterator[Graph[N, E]]
 Definition Classes
 SetLike

def
subsets(len: Int): Iterator[Graph[N, E]]
 Definition Classes
 SetLike

def
sum[B >: Param[N, E]](implicit num: Numeric[B]): B
 Definition Classes
 TraversableOnce → GenTraversableOnce

final
def
synchronized[T0](arg0: ⇒ T0): T0
 Definition Classes
 AnyRef

def
tail: Graph[N, E]
 Definition Classes
 TraversableLike → GenTraversableLike

def
tails: Iterator[Graph[N, E]]
 Definition Classes
 TraversableLike

def
take(n: Int): Graph[N, E]
 Definition Classes
 IterableLike → TraversableLike → GenTraversableLike

def
takeRight(n: Int): Graph[N, E]
 Definition Classes
 IterableLike

def
takeWhile(p: (Param[N, E]) ⇒ Boolean): Graph[N, E]
 Definition Classes
 IterableLike → TraversableLike → GenTraversableLike

def
thisCollection: Iterable[Param[N, E]]
 Attributes
 protected[this]
 Definition Classes
 IterableLike → TraversableLike

def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Param[N, E], Col[Param[N, E]]]): Col[Param[N, E]]
 Definition Classes
 TraversableLike → TraversableOnce → GenTraversableOnce

def
toArray[B >: Param[N, E]](implicit arg0: ClassTag[B]): Array[B]
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
toBuffer[A1 >: Param[N, E]]: Buffer[A1]
 Definition Classes
 SetLike → TraversableOnce → GenTraversableOnce

def
toCollection(repr: Graph[N, E]): Iterable[Param[N, E]]
 Attributes
 protected[this]
 Definition Classes
 IterableLike → TraversableLike

def
toIndexedSeq: IndexedSeq[Param[N, E]]
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
toIterable: Iterable[Param[N, E]]
 Definition Classes
 IterableLike → TraversableOnce → GenTraversableOnce

def
toIterator: Iterator[Param[N, E]]
 Definition Classes
 IterableLike → TraversableLike → GenTraversableOnce
 Annotations
 @deprecatedOverriding( ... , "2.11.0" )

def
toList: List[Param[N, E]]
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
toMap[T, U](implicit ev: <:<[Param[N, E], (T, U)]): Map[T, U]
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
toParArray: ParArray[T]
 Implicit
 This member is added by an implicit conversion from Graph[N, E] to CollectionsHaveToParArray[Graph[N, E], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (Graph[N, E]) ⇒ GenTraversableOnce[T] is in scope.
 Definition Classes
 CollectionsHaveToParArray

def
toSeq: Seq[Param[N, E]]
 Definition Classes
 SetLike → TraversableOnce → GenTraversableOnce

def
toSet[B >: Param[N, E]]: Set[B]
 Definition Classes
 TraversableOnce → GenTraversableOnce

def
toSortedString(nodeSeparator: String = GraphBase.defaultSeparator, edgeSeparator: String = GraphBase.defaultSeparator, nodesEdgesSeparator: String = GraphBase.defaultSeparator, withNodesEdgesPrefix: Boolean = false)(implicit ordNode: NodeOrdering = defaultNodeOrdering, ordEdge: EdgeOrdering = defaultEdgeOrdering): String
Same as
asSortedString
but additionally prefixed and parenthesized bystringPrefix
.Same as
asSortedString
but additionally prefixed and parenthesized bystringPrefix
. Definition Classes
 GraphLike

def
toStream: Stream[Param[N, E]]
 Definition Classes
 IterableLike → TraversableLike → GenTraversableOnce

def
toString(): String
Ensures sorted nodes/edges unless this
Graph
has more than 100 elements.Ensures sorted nodes/edges unless this
Graph
has more than 100 elements. See alsoasSortedString
andtoSortedString
. Definition Classes
 GraphLike → SetLike → Function1 → TraversableLike → AnyRef → Any

def
toTraversable: Traversable[Param[N, E]]
 Definition Classes
 TraversableLike → TraversableOnce → GenTraversableOnce
 Annotations
 @deprecatedOverriding( ... , "2.11.0" )

def
toVector: Vector[Param[N, E]]
 Definition Classes
 TraversableOnce → GenTraversableOnce

final
def
topologicalSort[U](implicit visitor: (InnerElem) ⇒ U = empty): CycleNodeOrTopologicalOrder
Sorts this graph topologically.
Sorts this graph topologically.
 visitor
called for each inner node or inner edge visited during the sort. See
componentTraverser
for more control by means ofFluentProperties
.
 Definition Classes
 GraphTraversal

final
def
topologicalSortByComponent[U](implicit visitor: (InnerElem) ⇒ U = empty): Traversable[CycleNodeOrTopologicalOrder]
Sorts every isolated component of this graph topologically.
Sorts every isolated component of this graph topologically.
 visitor
called for each inner node or inner edge visited during the sort. See
componentTraverser
for 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
0
if this graph is empty.The total degree of this graph equaling to the sum of the degrees over all nodes or
0
if this graph is empty. nodeDegree
the degree function to apply to the nodes defaulting to
Degree
. Nondefault predefined degree functions areInDegree
andOutDegree
. degreeFilter
selects nodes to be included by their degree.
 Definition Classes
 GraphDegree

def
totalWeight: Double
 Definition Classes
 GraphBase

def
transpose[B](implicit asTraversable: (Param[N, E]) ⇒ GenTraversableOnce[B]): Set[Set[B]]
 Definition Classes
 GenericTraversableTemplate
 Annotations
 @migration
 Migration
(Changed in version 2.9.0)
transpose
throws anIllegalArgumentException
if collections are not uniformly sized.

def
union(that: GenSet[Param[N, E]]): Graph[N, E]
 Definition Classes
 SetLike → GenSetLike

def
unzip[A1, A2](implicit asPair: (Param[N, E]) ⇒ (A1, A2)): (Set[A1], Set[A2])
 Definition Classes
 GenericTraversableTemplate

def
unzip3[A1, A2, A3](implicit asTriple: (Param[N, E]) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
 Definition Classes
 GenericTraversableTemplate
 val value: Graph[N, E]

def
view(from: Int, until: Int): IterableView[Param[N, E], Graph[N, E]]
 Definition Classes
 IterableLike → TraversableLike

def
view: IterableView[Param[N, E], Graph[N, E]]
 Definition Classes
 IterableLike → TraversableLike

final
def
wait(): Unit
 Definition Classes
 AnyRef
 Annotations
 @throws( ... )

final
def
wait(arg0: Long, arg1: Int): Unit
 Definition Classes
 AnyRef
 Annotations
 @throws( ... )

final
def
wait(arg0: Long): Unit
 Definition Classes
 AnyRef
 Annotations
 @throws( ... )

def
withFilter(p: (Param[N, E]) ⇒ Boolean): FilterMonadic[Param[N, E], Graph[N, E]]
 Definition Classes
 TraversableLike → FilterMonadic

def
zip[A1 >: Param[N, E], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Graph[N, E], (A1, B), That]): That
 Definition Classes
 IterableLike → GenIterableLike

def
zipAll[B, A1 >: Param[N, E], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Graph[N, E], (A1, B), That]): That
 Definition Classes
 IterableLike → GenIterableLike

def
zipWithIndex[A1 >: Param[N, E], That](implicit bf: CanBuildFrom[Graph[N, E], (A1, Int), That]): That
 Definition Classes
 IterableLike → GenIterableLike

def
(that: GenSet[Param[N, E]]): Graph[N, E]
 Definition Classes
 GenSetLike

def
~[N >: N1](n2: N): UnDiEdge[N]
 Implicit
 This member is added by an implicit conversion from Graph[N, E] to EdgeAssoc[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] to EdgeAssoc[Graph[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
 Definition Classes
 EdgeAssoc
 Annotations
 @inline()
 def →[B](y: B): (Graph[N, E], B)
Shadowed Implicit Value Members

def
+(other: String): String
 Implicit
 This member is added by an implicit conversion from Graph[N, E] to any2stringadd[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
filter(p: (Param[N, E]) ⇒ Boolean): TraversableOnce[Param[N, E]]
 Implicit
 This member is added by an implicit conversion from Graph[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
 Shadowing
 This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graph: MonadOps[Param[N, E]]).filter(p)
 Definition Classes
 MonadOps

def
flatMap[B](f: (Param[N, E]) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
 Implicit
 This member is added by an implicit conversion from Graph[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
 Shadowing
 This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graph: MonadOps[Param[N, E]]).flatMap(f)
 Definition Classes
 MonadOps

def
map[B](f: (Param[N, E]) ⇒ B): TraversableOnce[B]
 Implicit
 This member is added by an implicit conversion from Graph[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
 Shadowing
 This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graph: MonadOps[Param[N, E]]).map(f)
 Definition Classes
 MonadOps

def
stringPrefix: String
 Implicit
 This member is added by an implicit conversion from Graph[N, E] to OuterNode[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 OuterNode[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

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
withFilter(p: (Param[N, E]) ⇒ Boolean): Iterator[Param[N, E]]
 Implicit
 This member is added by an implicit conversion from Graph[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
 Shadowing
 This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(graph: MonadOps[Param[N, E]]).withFilter(p)
 Definition Classes
 MonadOps
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graph
mutable.Graph
and its inner nodes.GraphEdge
objectedge
packageGraphPredef
object andImplicits
object.GraphTraversal
andTraverserInnerNode
.RandomGraph
.GraphGen
.