class DefaultGraphImpl[N, E[X] <: EdgeLikeIn[X]] extends Graph[N, E] with AdjacencyListGraph[N, E, DefaultGraphImpl] with GraphTraversalImpl[N, E]
- Annotations
- @SerialVersionUID()
- Alphabetic
- By Inheritance
- DefaultGraphImpl
- GraphTraversalImpl
- State
- TraverserImpl
- AdjacencyListGraph
- AdjacencyListBase
- Graph
- GraphLike
- Mutable
- EdgeOps
- Cloneable
- Cloneable
- Cloneable
- Shrinkable
- Growable
- Clearable
- Graph
- GraphLike
- GraphDegree
- GraphTraversal
- GraphBase
- Serializable
- Serializable
- Set
- SetLike
- Subtractable
- GenSet
- GenericSetTemplate
- GenSetLike
- Iterable
- IterableLike
- Equals
- GenIterable
- GenIterableLike
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- Function1
- AnyRef
- Any
- 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
Instance Constructors
- new DefaultGraphImpl(iniNodes: Traversable[N] = Set[N](), iniEdges: Traversable[E[N]] = Set[E[N]]())(implicit edgeT: ClassTag[E[N]], config: DefaultGraphImpl.Config with AdjacencyListArrayConfig)
Type Members
-
trait
Edge extends Serializable
- Definition Classes
- GraphBase
-
sealed
trait
EdgeOrdering extends Ordering[EdgeT] with ElemOrdering
- Definition Classes
- GraphBase
-
sealed
trait
ElemOrdering extends AnyRef
Base trait for graph
Orderings.Base trait for graph
Orderings.- Attributes
- protected
- Definition Classes
- GraphBase
-
sealed
trait
InnerElem extends AnyRef
- Definition Classes
- GraphBase
-
trait
Node extends Serializable
- Definition Classes
- GraphBase
-
sealed
trait
NodeOrdering extends Ordering[NodeT] with ElemOrdering
Ordering for the path dependent type NodeT.
Ordering for the path dependent type NodeT.
- Definition Classes
- GraphBase
-
trait
DegreeFunction extends ((GraphDegree.this)#NodeT) ⇒ Int
- Definition Classes
- GraphDegree
-
final
class
DegreeOrdering extends Ordering[(GraphDegree.this)#NodeT]
Decreasing ordering of nodes with respect to their degree.
Decreasing ordering of nodes with respect to their degree.
- Definition Classes
- GraphDegree
-
trait
Filter[T] extends (T) ⇒ Boolean
- Definition Classes
- GraphDegree
-
class
EdgeBase extends InnerEdgeParam[N, E, (GraphLike.this)#NodeT, E] with (GraphLike.this)#InnerEdge
- Definition Classes
- GraphLike
-
trait
InnerEdge extends (GraphLike.this)#InnerEdge
- 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
Aor(Int, Iterable[A])
- Definition Classes
- GraphTraversal
-
abstract
class
Component extends Properties
Represents a component of
thisgraph.Represents a component of
thisgraph. Edges and bridges are computed lazily. Components will be instantiated by componentTraverser or strongComponentTraverser.- Definition Classes
- GraphTraversal
-
trait
Cycle extends Path
Represents a cycle in this graph listing the nodes and connecting edges on it with the following syntax:
Represents a cycle in this graph listing the nodes and connecting edges on it with the following syntax:
cycle ::= start-end-node { edge node } edge start-end-nodeAll nodes and edges on the path are distinct except the start and end nodes that are equal. A cycle contains at least a start node followed by any number of consecutive pairs of an edge and a node and the end node equaling to the start node. The first element is the start node, the second is an edge with its tail being the start node and its head being the third element etc.
- Definition Classes
- GraphTraversal
-
trait
ExtendedNodeVisitor[U] extends (NodeT) ⇒ U with (NodeT, Int, Int, ⇒ NodeInformer) ⇒ U
Template for extended node visitors.
Template for extended node visitors. While the default node visitor of the type
NodeT => Upasses solely the inner node being visited, extended node visitors pass the following traversal state information:- the inner node currently visited as with a standard node visitor
- the number of nodes visited so far and
- the current depth in terms of the underlying algorithm and
- a reference to a specific informer that may be pattern matched to collect even further data specific to the implementation.
- Definition Classes
- GraphTraversal
-
abstract
class
FluentProperties[+This <: FluentProperties[This]] extends AnyRef
Properties and methods for creating modified properties in a fluent-interface manner.
Properties and methods for creating modified properties in a fluent-interface manner.
- Attributes
- protected
- Definition Classes
- GraphTraversal
-
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
-
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
Properties extends SubgraphProperties
Properties controlling traversals.
Properties controlling traversals.
- Attributes
- protected
- 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
-
class
Weight extends AnyRef
Stores a value and an edge weight function for use in weight-based traversals that may be defined by
withMaxWeight.Stores a value and an edge weight function for use in weight-based traversals that may be defined by
withMaxWeight.- Definition Classes
- GraphTraversal
-
class
AnyEdgeLazyCycle extends (GraphTraversalImpl.this)#AnyEdgeLazyPath with (GraphTraversalImpl.this)#Cycle
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
class
AnyEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath
LazyPathwhere edges are selected by taking the first one fitting.LazyPathwhere edges are selected by taking the first one fitting.- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
case class
ComponentTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters, subgraphNodes: (GraphTraversalImpl.this)#NodeFilter, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter, ordering: (GraphTraversalImpl.this)#ElemOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight]) extends (GraphTraversalImpl.this)#ComponentTraverser with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
trait
DownUpTraverser[A, +This <: (GraphTraversalImpl.this)#DownUpTraverser[A, This]] extends (GraphTraversalImpl.this)#TraverserMethods[A, This] with (GraphTraversalImpl.this)#Impl[A, This]
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
case class
InnerEdgeTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#InnerEdgeTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#EdgeT, (GraphTraversalImpl.this)#InnerEdgeTraverser] with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
case class
InnerElemTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#InnerElemTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#InnerElem, (GraphTraversalImpl.this)#InnerElemTraverser] with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
case class
InnerNodeDownUpTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#InnerNodeDownUpTraverser with (GraphTraversalImpl.this)#DownUpTraverser[(Boolean, (GraphTraversalImpl.this)#NodeT), (GraphTraversalImpl.this)#InnerNodeDownUpTraverser] with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
trait
InnerNodeTraversalImpl extends (GraphTraversalImpl.this)#TraverserInnerNode with (GraphTraversalImpl.this)#InnerNodeState
- Definition Classes
- GraphTraversalImpl
-
case class
InnerNodeTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#InnerNodeTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#NodeT, (GraphTraversalImpl.this)#InnerNodeTraverser] with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
abstract
class
LazyPath extends (GraphTraversalImpl.this)#Path
Path based on the passed collection of nodes with lazy evaluation of edges.
Path based on the passed collection of nodes with lazy evaluation of edges.
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
final
class
MapPathTraversable[T] extends Traversable[T]
Enables lazy traversing of a
Mapwithkey = source, value = target.Enables lazy traversing of a
Mapwithkey = source, value = target.- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
class
MinWeightEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath
LazyPathwith edges selected by minimal weight.LazyPathwith edges selected by minimal weight.- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
class
MultiEdgeLazyCycle extends (GraphTraversalImpl.this)#MultiEdgeLazyPath with (GraphTraversalImpl.this)#Cycle
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
class
MultiEdgeLazyPath extends (GraphTraversalImpl.this)#LazyPath
LazyPathwith edge selection such that there exists no duplicate edge in the path.LazyPathwith edge selection such that there exists no duplicate edge in the path.- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
case class
OuterEdgeTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#OuterEdgeTraverser with (GraphTraversalImpl.this)#Impl[E[N], (GraphTraversalImpl.this)#OuterEdgeTraverser] with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
case class
OuterElemTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#TraverserMethods[OuterElem[N, E], (GraphTraversalImpl.this)#OuterElemTraverser] with (GraphTraversalImpl.this)#OuterElemTraverser with (GraphTraversalImpl.this)#Impl[OuterElem[N, E], (GraphTraversalImpl.this)#OuterElemTraverser] with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
case class
OuterNodeDownUpTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#OuterNodeDownUpTraverser with (GraphTraversalImpl.this)#DownUpTraverser[(Boolean, N), (GraphTraversalImpl.this)#OuterNodeDownUpTraverser] with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
case class
OuterNodeTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#OuterNodeTraverser with (GraphTraversalImpl.this)#Impl[N, (GraphTraversalImpl.this)#OuterNodeTraverser] with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
class
PathBuilder extends (GraphTraversalImpl.this)#WalkBuilder with (GraphTraversalImpl.this)#PathBuilder
- Definition Classes
- GraphTraversalImpl
-
final
class
ReverseStackTraversable[S <: NodeElement] extends Traversable[(GraphTraversalImpl.this)#NodeT]
Efficient reverse
foreachovercomingArrayStack's deficiency not to overwritereverseIterator.Efficient reverse
foreachovercomingArrayStack's deficiency not to overwritereverseIterator.- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
abstract
class
SimpleLazyPath extends (GraphTraversalImpl.this)#LazyPath
LazyPathwith deferred edges selection.LazyPathwith deferred edges selection.- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
class
StrongComponentImpl extends (GraphTraversalImpl.this)#Component
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
case class
StrongComponentTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters, subgraphNodes: (GraphTraversalImpl.this)#NodeFilter, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter, ordering: (GraphTraversalImpl.this)#ElemOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight]) extends (GraphTraversalImpl.this)#StrongComponentTraverser with Product with Serializable
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
class
WalkBuilder extends (GraphTraversalImpl.this)#WalkBuilder
- Definition Classes
- GraphTraversalImpl
-
class
WeakComponentImpl extends (GraphTraversalImpl.this)#Component
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
trait
InnerNodeState extends AnyRef
- Definition Classes
- State
-
trait
Impl[A, +This <: GraphTraversalImpl.Traverser[A, This] with GraphTraversalImpl.Impl[A, This]] extends GraphTraversalImpl.TraverserMethods[A, This] with GraphTraversalImpl.Traverser[A, This]
- Attributes
- protected[scalax.collection]
- Definition Classes
- TraverserImpl
-
trait
InnerNode extends (AdjacencyListBase.this)#InnerNode
- Definition Classes
- AdjacencyListBase
-
class
EdgeImpl extends This.EdgeBase
- Definition Classes
- AdjacencyListGraph
- Annotations
- @SerialVersionUID()
-
class
EdgeSet extends This.EdgeSet with This.EdgeSet
- Definition Classes
- AdjacencyListGraph
-
abstract
class
InnerNodeImpl extends This.NodeBase with This.InnerNode with This.InnerNode
- Definition Classes
- AdjacencyListGraph
-
class
NodeSet extends This.NodeSet with This.NodeSet
- Definition Classes
- AdjacencyListGraph
-
type
Config = CoreConfig
- Attributes
- protected
- Definition Classes
- DefaultGraphImpl → AdjacencyListBase → GraphLike
-
type
CycleNodeOrTopologicalOrder = Either[NodeT, TopologicalOrder[NodeT]]
Either a
Rightcontaining a valid topological order or aLeftcontaining a node on a cycle.Either a
Rightcontaining a valid topological order or aLeftcontaining a node on a cycle.- Definition Classes
- GraphTraversal
-
type
DegreeNodeSeqEntry = (Int, 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
-
type
EdgeSetT = EdgeSet
- Definition Classes
- AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphBase
-
type
EdgeT = EdgeImpl
- Definition Classes
- AdjacencyListGraph → GraphLike → 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
-
final
class
NodeBase extends InnerNodeImpl with InnerNodeTraversalImpl
- Attributes
- protected
- Annotations
- @SerialVersionUID()
-
type
NodeFilter = (NodeT) ⇒ Boolean
- Definition Classes
- GraphBase
-
type
NodeSetT = NodeSet
- Definition Classes
- AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphBase
-
type
NodeT = NodeBase
- Definition Classes
- DefaultGraphImpl → GraphTraversalImpl → AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphTraversal → GraphBase
-
type
Self = DefaultGraphImpl[N, E]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
type
ThisGraph = DefaultGraphImpl.this.type
- Attributes
- protected
- Definition Classes
- GraphLike
-
type
TopoSortSetup = (Buffer[NodeT], Map[NodeT, Int], Option[NodeT])
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
class
WithFilter extends FilterMonadic[A, Repr]
- Definition Classes
- TraversableLike
-
trait
InnerNodeOps extends AnyRef
- Definition Classes
- EdgeOps
Value Members
-
object
Edge extends Serializable
- Definition Classes
- GraphBase
- Annotations
- @transient()
-
object
EdgeOrdering extends Serializable
Ordering for the path dependent type EdgeT.
Ordering for the path dependent type EdgeT.
- Definition Classes
- GraphBase
-
object
EdgeT
- Definition Classes
- GraphBase
- Annotations
- @transient()
-
object
InnerEdge extends Serializable
- Definition Classes
- GraphBase
- Annotations
- @transient()
-
object
InnerNode extends Serializable
- Definition Classes
- GraphBase
-
object
NoOrdering extends ElemOrdering with Serializable
The empty ElemOrdering.
The empty ElemOrdering.
- Definition Classes
- GraphBase
-
object
Node extends Serializable
- Definition Classes
- GraphBase
- Annotations
- @transient()
-
object
NodeOrdering extends Serializable
- Definition Classes
- GraphBase
-
object
Degree extends (GraphDegree.this)#DegreeFunction
- Definition Classes
- GraphDegree
-
object
DegreeOrdering extends Serializable
- Definition Classes
- GraphDegree
-
object
InDegree extends (GraphDegree.this)#DegreeFunction
- Definition Classes
- GraphDegree
-
object
IntReverseOrdering extends Ordering[Int]
Decreasing ordering of integers.
Decreasing ordering of integers.
- Definition Classes
- GraphDegree
-
object
OutDegree extends (GraphDegree.this)#DegreeFunction
- Definition Classes
- GraphDegree
-
object
Cycle
- Definition Classes
- GraphTraversal
-
object
ExtendedNodeVisitor
- Definition Classes
- GraphTraversal
-
object
Informer
- Definition Classes
- GraphTraversal
-
object
Path extends Serializable
- Definition Classes
- GraphTraversal
-
object
SubgraphProperties
- Attributes
- protected
- Definition Classes
- GraphTraversal
-
object
TraverserInnerNode extends Serializable
- Definition Classes
- GraphTraversal
- Annotations
- @transient()
-
object
Walk
- Definition Classes
- GraphTraversal
-
object
Weight
- Definition Classes
- GraphTraversal
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
&(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
- Definition Classes
- GenSetLike
-
def
&=(coll: Iterable[Param[N, E]]): DefaultGraphImpl.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]]): DefaultGraphImpl[N, E]
- Definition Classes
- GenSetLike
-
def
+(node: N): DefaultGraphImpl[N, E]
Creates a new supergraph with an additional node, unless the node passed is already present.
-
def
+(elem: Param[N, E]): DefaultGraphImpl[N, E]
Creates a new supergraph with an additional node or edge, unless the node or edge passed is already present.
Creates a new supergraph with an additional node or edge, unless the node or edge passed is already present.
This method purely wraps
+(node: N)respectively+(edge: E[N])granting the same behavior.- elem
the wrapped node or edge to be added; ; if
elemis of type N, the wrapped object is added to the node set otherwise to the edge set.- returns
a new supergraph containing all nodes and edges of this graph plus
elem.
- Definition Classes
- GraphLike → SetLike → GenSetLike
-
def
+(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl[N, E]
- Definition Classes
- SetLike
-
final
def
+#(edge: E[N]): DefaultGraphImpl[N, E]
Creates a new supergraph with an additional edge, unless the edge passed is already present.
-
def
++(elems: GenTraversableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
- Definition Classes
- GraphLike → SetLike
-
def
++[B >: Param[N, E], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: Param[N, E], That](that: Traversable[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: Param[N, E], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
- Definition Classes
- TraversableLike
-
def
++=(xs: TraversableOnce[Param[N, E]]): DefaultGraphImpl.this.type
- Definition Classes
- GraphLike → Growable
-
def
+=(elem: Param[N, E]): DefaultGraphImpl.this.type
- Definition Classes
- GraphLike → Growable
-
final
def
+=(node: N): DefaultGraphImpl.this.type
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
def
+=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl.this.type
- Definition Classes
- Growable
-
final
def
+=#(edge: E[N]): DefaultGraphImpl.this.type
- Attributes
- protected
- Definition Classes
- AdjacencyListGraph → GraphLike
- Annotations
- @inline()
-
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): DefaultGraphImpl.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
equalsto 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]): DefaultGraphImpl.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): DefaultGraphImpl.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
equalsto 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]): DefaultGraphImpl.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]): DefaultGraphImpl.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
equalsto 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]): DefaultGraphImpl.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): DefaultGraphImpl.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
equalsto an already existing hyperedge.
- Definition Classes
- EdgeOps
- Annotations
- @inline()
-
final
def
+~=(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): DefaultGraphImpl.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]): DefaultGraphImpl[N, E]
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
def
-(node: N): DefaultGraphImpl[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph except
nodeand those edges whichnodeis incident with. -
def
-(elem: Param[N, E]): DefaultGraphImpl[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph except
elem.Creates a new subgraph consisting of all nodes and edges of this graph except
elem. Ifelemis of type N, this method maps to-(node: N). Otherwise the edge is deleted leaving the node set unchanged.- elem
node or edge to be removed.
- returns
the new subgraph of this graph after the "ripple" deletion of the passed node or the simple deletion of the passed edge.
- Definition Classes
- GraphLike → SetLike → Subtractable → GenSetLike
-
def
-(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl[N, E]
- Definition Classes
- Subtractable
-
final
def
-!(edge: E[N]): DefaultGraphImpl[N, E]
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
def
-!(elem: Param[N, E]): DefaultGraphImpl[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph except
elem.Creates a new subgraph consisting of all nodes and edges of this graph except
elem. Ifelemis of type N, this method maps to-(node: N). Otherwise the edge is deleted along with those incident nodes which would become edge-less after deletion.- elem
node or edge to be removed.
- returns
a new subgraph of this graph after the "ripple" deletion of the passed node or edge.
- Definition Classes
- GraphLike
-
final
def
-!#(edge: E[N]): DefaultGraphImpl[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph except
edgeand those nodes which are incident withedgeand would become edge-less after deletion.Creates a new subgraph consisting of all nodes and edges of this graph except
edgeand those nodes which are incident withedgeand would become edge-less after deletion.- edge
the edge to be removed.
- returns
a new subgraph of this graph after the "ripple" deletion of
edgefrom this graph.
-
def
-!=(elem: Param[N, E]): DefaultGraphImpl.this.type
- Definition Classes
- GraphLike
-
final
def
-!=#(edge: E[N]): DefaultGraphImpl.this.type
- Attributes
- protected
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
def
-#(edge: E[N]): DefaultGraphImpl[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]]): DefaultGraphImpl[N, E]
- Definition Classes
- GraphLike → Subtractable
-
def
--!(elems: GenTraversableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph but the elements of
collwhich will be unconditionally removed.Creates a new subgraph consisting of all nodes and edges of this graph but the elements of
collwhich will be unconditionally removed. This operation differs from--in that edges are deleted along with those incident nodes which would become isolated after deletion.- elems
collection of nodes and/or edges to be removed; if the element type is N, it is removed from the node set otherwise from the edge set. See
-!(elem: Param[N,E]).- returns
the new subgraph containing all nodes and edges of this graph after the "ripple" deletion of nodes and the simple deletion of edges in
coll.
- Definition Classes
- GraphLike
-
final
def
--!=(coll: Iterable[Param[N, E]]): DefaultGraphImpl[N, E]
Removes all elements of
collfrom this graph.Removes all elements of
collfrom 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]]): DefaultGraphImpl.this.type
- Definition Classes
- Shrinkable
-
def
-=(elem: Param[N, E]): DefaultGraphImpl.this.type
- Definition Classes
- GraphLike → Shrinkable
-
final
def
-=(node: N): DefaultGraphImpl.this.type
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
def
-=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl.this.type
- Definition Classes
- Shrinkable
-
final
def
-=#(edge: E[N]): DefaultGraphImpl.this.type
- Attributes
- protected
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
def
->[B](y: B): (DefaultGraphImpl[N, E], B)
- Implicit
- This member is added by an implicit conversion from DefaultGraphImpl[N, E] to ArrowAssoc[DefaultGraphImpl[N, E]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
-
final
def
-?(node: N): DefaultGraphImpl[N, E]
Creates a new subgraph consisting of all nodes and edges of this graph but
nodewhich is conditionally removed from this graph.Creates a new subgraph consisting of all nodes and edges of this graph but
nodewhich is conditionally removed from this graph. The removal only succeeds if the node is not incident with any edges or it is only incident with hooks.- node
the node to be gently removed.
- returns
the new subgraph of this graph after the "gentle" deletion of
node. Ifnodecould not be deleted, the new graph is a copy of this graph.
-
final
def
-?=(node: N): DefaultGraphImpl.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
add(edge: E[N]): Boolean
- Definition Classes
- AdjacencyListGraph → GraphLike
- Annotations
- @inline()
-
final
def
add(node: N): Boolean
Adds a node to this graph.
Adds a node to this graph.
- node
the node to be added
- returns
trueif the node was not yet present in the graph,falseotherwise.
- Definition Classes
- AdjacencyListGraph → GraphLike
- Annotations
- @inline()
-
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
equalsto 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
equalsto 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
equalsto 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
equalsto 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
equalsto 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
equalsto 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
equalsto 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
equalsto 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_2andnodesusingedgeFactoryand adds it to the edge set of this graph.Creates a new inner hyperedge between
node_1,node_2andnodesusingedgeFactoryand 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
fromis to serve as the edge factory.- returns
trueif a new hyperedge has been created.falseif 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_1andnode_2usingedgeFactoryand adds it to the edge set of this graph.Creates a new inner edge between
node_1andnode_2usingedgeFactoryand 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
fromis to serve as the edge factory.- returns
trueif a new edge has been created.falseif 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_2andnodesusingedgeFactoryand adds it to the edge set of this graph.Creates a new weighted and labeled inner hyperedge between
node_1,node_2andnodesusingedgeFactoryand 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
fromis to serve as the edge factory.- returns
trueif a new hyperedge has been created.falseif 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_1andnode_2usingedgeFactoryand adds it to the edge set of this graph.Creates a new labeled inner edge between
node_1andnode_2usingedgeFactoryand 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
fromis to serve as the edge factory.- returns
trueif a new edge has been created.falseif 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_2andnodesusingedgeFactoryand adds it to the edge set of this graph.Creates a new weighted inner hyperedge between
node_1,node_2andnodesusingedgeFactoryand 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
fromis to serve as the edge factory.- returns
trueif a new hyperedge has been created.falseif 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_1andnode_2usingedgeFactoryand adds it to the edge set of this graph.Creates a new weighted inner edge between
node_1andnode_2usingedgeFactoryand 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
fromis to serve as the edge factory.- returns
trueif a new edge has been created.falseif 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_2andnodesusingedgeFactoryand adds it to the edge set of this graph.Creates a new weighted and labeled inner hyperedge between
node_1,node_2andnodesusingedgeFactoryand 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
fromis to serve as the edge factory.- returns
trueif a new hyperedge has been created.falseif 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_1andnode_2usingedgeFactoryand adds it to the edge set of this graph.Creates a new weighted and labeled inner edge between
node_1andnode_2usingedgeFactoryand 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
fromis to serve as the edge factory.- returns
trueif a new edge has been created.falseif 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 (non-filter).
Default edge filter letting path all edges (non-filter).
- Definition Classes
- GraphBase
-
final
def
anyEdgeSelector(from: NodeT, to: NodeT): Option[EdgeT]
An arbitrary edge between
fromandtothat is available most efficiently.An arbitrary edge between
fromandtothat is available most efficiently.- Definition Classes
- GraphTraversal
- Annotations
- @inline()
-
final
val
anyNode: NodeFilter
Default node filter letting traverse all nodes (non-filter).
Default node filter letting traverse all nodes (non-filter).
- Definition Classes
- GraphBase
-
final
lazy val
anyOrdering: AnyOrdering[N]
- Attributes
- protected
- Definition Classes
- GraphBase
-
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
ordNodefollowed by all edges sorted byordEdgeand concatinates their string representationnodeSeparatorandedgeSeparatorrespectively.Sorts all nodes of this graph by
ordNodefollowed by all edges sorted byordEdgeand concatinates their string representationnodeSeparatorandedgeSeparatorrespectively.- nodeSeparator
to separate nodes by.
- edgeSeparator
to separate edges by.
- nodesEdgesSeparator
to separate nodes from edges by.
- withNodesEdgesPrefix
whether the node and edge set should be prefixed.
- ordNode
the node ordering defaulting to
defaultNodeOrdering.- ordEdge
the edge ordering defaulting to
defaultEdgeOrdering.
- Definition Classes
- GraphLike
-
final
def
bulkOp(elems: GenTraversableOnce[Param[N, E]], isPlusPlus: Boolean): DefaultGraphImpl[N, E]
Prepares and calls
plusPlusorminusMinus.Prepares and calls
plusPlusorminusMinus.- Attributes
- protected
- Definition Classes
- GraphLike
-
def
canEqual(that: Any): Boolean
- Definition Classes
- IterableLike → Equals
-
final
def
clear(): Unit
- Definition Classes
- AdjacencyListGraph → Growable → Clearable
- Annotations
- @inline()
-
def
clearNodeStates(flags: FlagWord, flagsExt: ExtBitSet): Unit
- Attributes
- protected
- Definition Classes
- State
-
final
def
clone(): DefaultGraphImpl.this.type
- Definition Classes
- DefaultGraphImpl → GraphLike → Cloneable → AnyRef
-
def
collect[B, That](pf: PartialFunction[Param[N, E], B])(implicit bf: CanBuildFrom[DefaultGraphImpl[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
componentTraverser(parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): ComponentTraverser
Creates a ComponentTraverser responsible for invoking graph traversal methods in all (weakly) connected components of this possibly disconnected graph.
Creates a ComponentTraverser responsible for invoking graph traversal methods in all (weakly) connected components of this possibly disconnected graph.
- parameters
The properties controlling subsequent traversals.
- subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
- subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
- ordering
If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
def
compose[A](g: (A) ⇒ Param[N, E]): (A) ⇒ Boolean
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
implicit
val
config: DefaultGraphImpl.Config with AdjacencyListArrayConfig
- Definition Classes
- DefaultGraphImpl → GraphLike
-
def
contains(elem: Param[N, E]): Boolean
Checks whether a given node or edge is contained in this graph.
Checks whether a given node or edge is contained in this graph.
- elem
the node or edge the existence of which is to be checked
- returns
true if
elemis contained in this graph
- Definition Classes
- GraphLike → SetLike → GenSetLike
-
def
copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: Param[N, E]](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: Param[N, E]](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: Param[N, E]](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: (Param[N, E]) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
cycle(results: Option[(NodeT, ArrayStack[CycleStackElem])], edgeFilter: EdgeFilter): Option[Cycle]
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
final
def
cycle(maybeStart: Option[NodeT], stack: ArrayStack[Element], edgeFilter: EdgeFilter): Option[Cycle]
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
final
lazy val
defaultEdgeOrdering: EdgeOrdering
- Definition Classes
- GraphBase
-
final
lazy val
defaultNodeOrdering: NodeOrdering
- Definition Classes
- GraphBase
-
final
def
defaultPathSize: Int
- Attributes
- protected
- Definition Classes
- GraphTraversal
- Annotations
- @inline()
-
def
degreeCount(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): SortedMap[Int, Int]
The degree set of this graph projected onto a map.
The degree set of this graph projected onto a map. The keys of the map are the degrees in decreasing order while the values are the number of inner nodes having the degree of the corresponding key.
- Definition Classes
- GraphDegree
-
def
degreeNodeSeq(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): Seq[DegreeNodeSeqEntry]
The degree sequence of this graph projected onto a sequence of tuples.
The degree sequence of this graph projected onto a sequence of tuples. The first elements of the tuples are the degrees in non-increasing order while the second elements are the corresponding inner nodes.
- Definition Classes
- GraphDegree
-
def
degreeNodesMap(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): SortedMap[Int, AnySet[NodeT]]
The degree set of this graph projected onto a map.
The degree set of this graph projected onto a map. The keys of the map are the degrees in decreasing order while the values are sets of the corresponding inner nodes.
- Definition Classes
- GraphDegree
-
def
degreeSeq(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): Seq[Int]
The degree sequence of this graph, that is the non-increasing sequence of degrees over all nodes.
The degree sequence of this graph, that is the non-increasing sequence of degrees over all nodes.
- Definition Classes
- GraphDegree
-
def
degreeSet(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): SortedSet[Int]
The degree set of this graph, that is the decreasing set of unique degrees over all nodes.
The degree set of this graph, that is the decreasing set of unique degrees over all nodes. Same as degreeSeq without duplicates.
- Definition Classes
- GraphDegree
-
def
diff(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
- Definition Classes
- SetLike → GenSetLike
-
def
drop(n: Int): DefaultGraphImpl[N, E]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
dropRight(n: Int): DefaultGraphImpl[N, E]
- Definition Classes
- IterableLike
-
def
dropWhile(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
dump(store: FlagStore): ExtBitSet
- Attributes
- protected
- Definition Classes
- State
-
def
dumpDirty: ExtBitSet
Returns a copy of the current
dirty-flags for dump purposes.Returns a copy of the current
dirty-flags for dump purposes.- Definition Classes
- State
-
def
dumpInUse: ExtBitSet
Returns a copy of the current
inUse-flags for dump purposes.Returns a copy of the current
inUse-flags for dump purposes.- Definition Classes
- State
-
def
edgeIterator: GroupIterator[EdgeT] { ... /* 2 definitions in type refinement */ }
- Definition Classes
- AdjacencyListBase
-
implicit
val
edgeT: ClassTag[E[N]]
- Definition Classes
- DefaultGraphImpl → GraphLike
-
implicit final
def
edgeToEdgeCont(e: E[N]): E[NodeT]
- Attributes
- protected
- Definition Classes
- GraphBase
-
final
def
edges: EdgeSetT
The edge set of this
Graphcommonly referred to as E(G).The edge set of this
Graphcommonly referred to as E(G).- returns
Set of all contained edges.
- Definition Classes
- DefaultGraphImpl → AdjacencyListGraph → GraphBase
- Annotations
- @inline()
-
final
def
empty: DefaultGraphImpl[N, E]
- Definition Classes
- DefaultGraphImpl → Graph → Graph → SetLike → GenericSetTemplate
-
def
ensuring(cond: (DefaultGraphImpl[N, E]) ⇒ Boolean, msg: ⇒ Any): DefaultGraphImpl[N, E]
- Implicit
- This member is added by an implicit conversion from DefaultGraphImpl[N, E] to Ensuring[DefaultGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: (DefaultGraphImpl[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]
- Implicit
- This member is added by an implicit conversion from DefaultGraphImpl[N, E] to Ensuring[DefaultGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean, msg: ⇒ Any): DefaultGraphImpl[N, E]
- Implicit
- This member is added by an implicit conversion from DefaultGraphImpl[N, E] to Ensuring[DefaultGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean): DefaultGraphImpl[N, E]
- Implicit
- This member is added by an implicit conversion from DefaultGraphImpl[N, E] to Ensuring[DefaultGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
Graphinstances are equal if their nodes and edges turned to outer nodes and outer edges are equal.Graphinstances are equal if their nodes and edges turned to outer nodes and outer edges are equal. AnyTraversableOnceinstance may also be equal to this graph if its set representation contains equalling outer nodes and outer edges. Thus the following expressions hold:Graph(1~2, 3) == List(1~2, 3) Graph(1~2, 3) == List(1, 2, 2, 3, 2~1)
The first test is
falsebecause of the failing nodes1and2. The second is true because of duplicate elimination and undirected edge equivalence.- Definition Classes
- GraphLike → GenSetLike → Equals → AnyRef → Any
-
def
exists(p: (Param[N, E]) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
expectedMaxNodes(divisor: Int, min: Int = 128): Int
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
def
filter(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[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
outerEdgein this graph.Searches for an edge node equaling to
outerEdgein this graph.- outerEdge
the outer edge to search for in this graph.
- returns
Someof the inner edge found orNone.
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
def
find(outerNode: N): Option[NodeT]
Searches for an inner node equaling to
outerNodein this graph.Searches for an inner node equaling to
outerNodein this graph.- outerNode
the outer node to search for in this graph.
- returns
Someof the inner node found orNone.
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
def
find(p: (Param[N, E]) ⇒ Boolean): Option[Param[N, E]]
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
findCycle[U](implicit visitor: (InnerElem) ⇒ U = empty): Option[Cycle]
Finds a cycle in
thisgraph in any of its components and callsvisitorfor each inner element visited during the search.Finds a cycle in
thisgraph in any of its components and callsvisitorfor each inner element visited during the search. SeecomponentTraverserfor more control by means ofFluentProperties.- Definition Classes
- GraphTraversal
-
final
def
findCycleContaining[U](node: NodeT)(implicit visitor: (InnerElem) ⇒ U = empty): Option[Cycle]
Finds a cycle that contains
nodeand callsvisitorfor each inner element visited during the search.Finds a cycle that contains
nodeand callsvisitorfor each inner element visited during the search.- Definition Classes
- GraphTraversal
-
def
flatMap[B, That](f: (Param[N, E]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[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
-
final
def
forInDegrees(traversable: Traversable[NodeT] with SubgraphProperties, maybeHandle: Option[Handle] = None, includeAnyway: Option[NodeT] = None, includeInDegree: NodeFilter = anyNode, fillInDegrees: Boolean = true): TopoSortSetup
Calculates in-degrees of nodes spanned by
traversable.Calculates in-degrees of nodes spanned by
traversable.- traversable
supplies the nodes for which the degree is to be calculated
- maybeHandle
to be used to mark visited nodes
- includeAnyway
include this node in the resulting list of nodes without predecessors irrespective of its in degree
- includeInDegree
optionally filters predecessor nodes when calculating the in degree
- returns
triple of
- nodes without predecessors in the component spanned by
traverser - map of visited nodes to their in degrees
- size of
traversable
- nodes without predecessors in the component spanned by
- Attributes
- protected
- Definition Classes
- GraphTraversalImpl
-
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
- Implicit
- This member is added by an implicit conversion from DefaultGraphImpl[N, E] to StringFormat[DefaultGraphImpl[N, E]] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
-
def
genericBuilder[B]: Builder[B, Set[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
get(outerEdge: E[N]): EdgeT
Searches for an inner edge equaling to
outerEdgein this graph which must exist in this graph.Searches for an inner edge equaling to
outerEdgein this graph which must exist in this graph.- outerEdge
the outer edge to search for in this graph.
- returns
the inner edge if found. Otherwise NoSuchElementException is thrown.
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
def
get(outerNode: N): NodeT
Searches for an inner node equaling to
outerNodein this graph which must exist in this graph.Searches for an inner node equaling to
outerNodein this graph which must exist in this graph.- outerNode
the outer node to search for in this graph.
- returns
the inner node if found. Otherwise NoSuchElementException is thrown.
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
getOrElse(outerEdge: E[N], default: EdgeT): EdgeT
Searches for an inner edge equaling to
outerEdgein this graph.Searches for an inner edge equaling to
outerEdgein this graph.- outerEdge
the outer edge to search for in this graph.
- default
the inner edge to return if
outerEdgecannot be found.- returns
the inner edge looked up or
defaultif no inner edge equaling toedgecould be found.
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
def
getOrElse(outerNode: N, default: NodeT): NodeT
Searches for an inner node equaling to
outerNodein this graph.Searches for an inner node equaling to
outerNodein this graph.- outerNode
the outer node to search for in this graph.
- default
the inner node to return if
outerNodeis not contained.- returns
The inner node looked up or
defaultif no inner node equaling toouterNodecould be found.
- Definition Classes
- GraphLike
- Annotations
- @inline()
-
final
val
graphCompanion: DefaultGraphImpl.type
The companion object of
This.The companion object of
This.- Definition Classes
- DefaultGraphImpl → GraphLike
-
def
graphSize: Int
The size - commonly referred to as ||G|| - of this graph equaling to the number of edges.
The size - commonly referred to as ||G|| - of this graph equaling to the number of edges.
Method
sizeis reserved for the number of nodes and edges becauseGraphis alsoSetLikewith set elements being nodes or edges.- Definition Classes
- GraphBase
-
def
groupBy[K](f: (Param[N, E]) ⇒ K): Map[K, DefaultGraphImpl[N, E]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
grouped(size: Int): Iterator[DefaultGraphImpl[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 graph-level method requiring a predicate such as
count,exists,filter,filterNot,foralletc. For instanceval g = Graph(2~>3, 3~>1, 5) g filter g.having(nodes = _ >= 2) // yields Graph(2, 3, 5, 2~>3)
- node
The predicate that must hold for the nodes.
- edge
The predicate that must hold for the edges. If omitted, all edges between nodes to be included by
nodeswill also be included.- returns
A partial function combining the passed predicates.
- Definition Classes
- GraphLike
-
def
head: Param[N, E]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
headOption: Option[Param[N, E]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
init: DefaultGraphImpl[N, E]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
initialize(nodes: Traversable[N], edges: Traversable[E[N]]): Unit
Populates this graph with
nodesandedges.Populates this graph with
nodesandedges.The implementing class will typically have a constructor with the same parameters which is invoked by
fromof the companion object.- nodes
The isolated (and optionally any other) outer nodes that the node set of this graph is to be populated with.
- edges
The outer edges that the edge set of this graph is to be populated with. Nodes being the end of any of these edges will be added to the node set.
- Attributes
- protected
- Definition Classes
- GraphBase
-
def
initializeFrom(in: ObjectInputStream, nodes: NodeSetT, edges: EdgeSetT): Unit
- Attributes
- protected
- Definition Classes
- AdjacencyListBase
-
def
inits: Iterator[DefaultGraphImpl[N, E]]
- Definition Classes
- TraversableLike
-
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
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
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
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
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 theBooleanparameter istrueif the traversal takes place in downward andfalseif it takes place in upward direction.Creates a InnerNodeDownUpTraverser based on
scala.collection.Traversable[(Boolean, NodeT)]where theBooleanparameter istrueif the traversal takes place in downward andfalseif it takes place in upward direction.- root
The node where subsequent graph traversals start.
- parameters
The properties controlling subsequent traversals. A
kinddifferent fromDepthFirstwill be ignored.- subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
- subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
- ordering
If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
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
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
def
intersect(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
- Definition Classes
- GenSetLike
-
final
def
isAcyclic: Boolean
Whether
thisgraph has no cycle.Whether
thisgraph has no cycle.- Definition Classes
- GraphTraversal
- Annotations
- @inline()
-
def
isComplete: Boolean
Whether all nodes are pairwise adjacent.
Whether all nodes are pairwise adjacent.
- returns
trueif this graph is complete,falseif this graph contains any independent nodes.
- Definition Classes
- GraphTraversal
-
def
isConnected: Boolean
Whether
thisgraph is connected if it is undirected or weakly connected if it is directed.Whether
thisgraph is connected if it is undirected or weakly connected if it is directed.- Definition Classes
- GraphTraversal
-
final
def
isCustomEdgeFilter(f: EdgeFilter): Boolean
trueiffis not equivalent toanyEdge.trueiffis not equivalent toanyEdge.- Definition Classes
- GraphBase
- Annotations
- @inline()
-
final
def
isCustomNodeFilter(f: NodeFilter): Boolean
trueiffis not equivalent toanyNode.trueiffis not equivalent toanyNode.- Definition Classes
- GraphBase
- Annotations
- @inline()
-
final
def
isCyclic: Boolean
Whether
thisgraph has at least one cycle in any of its components.Whether
thisgraph has at least one cycle in any of its components.- Definition Classes
- GraphTraversal
- Annotations
- @inline()
-
def
isDefined: Boolean
- Implicit
- This member is added by an implicit conversion from DefaultGraphImpl[N, E] to OuterNode[DefaultGraphImpl[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 DefaultGraphImpl[N, E] to OuterNode[DefaultGraphImpl[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
- Implicit
- This member is added by an implicit conversion from DefaultGraphImpl[N, E] to OuterNode[DefaultGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- InParam → Param
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isMixed: Boolean
Whether this graph contains at least one directed and one undirected edge.
-
def
isMulti: Boolean
Whether this graph contains at least one multi-edge.
Whether this graph contains at least one multi-edge. We defnie multi-edges by
- two or more directed edges having the same source and target
- two or more undirected edges connecting the same nodes
- two or more (directed) hyperedges that, after being decomposed into (directed) edges, yield any multy-edge as stipulated above.
-
final
val
isMultiT: Boolean
- Attributes
- protected
- Definition Classes
- GraphLike
-
def
isNode: Boolean
- Implicit
- This member is added by an implicit conversion from DefaultGraphImpl[N, E] to OuterNode[DefaultGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
-
def
isOut: Boolean
- Implicit
- This member is added by an implicit conversion from DefaultGraphImpl[N, E] to OuterNode[DefaultGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- InParam → Param
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
final
def
isTrivial: Boolean
trueif this graph has at most 1 node.trueif this graph has at most 1 node.- Definition Classes
- GraphBase
- Annotations
- @inline()
-
def
iterator: Iterator[Param[N, E]]
Iterates over all nodes and all edges.
Iterates over all nodes and all edges.
- returns
iterator containing all nodes and all edges
- Definition Classes
- GraphLike → GenSetLike → IterableLike → GenIterableLike
-
def
last: Param[N, E]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[Param[N, E]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
map[B, That](f: (Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[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
0if this graph is empty.The degree of the node having the highest degree or
0if this graph is empty.- Definition Classes
- GraphDegree
-
def
min[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minDegree(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): Int
The degree of the node having the least degree or
0if this graph is empty.The degree of the node having the least degree or
0if this graph is empty.- Definition Classes
- GraphDegree
-
def
minusMinus(delNodes: Traversable[N], delEdges: Traversable[E[N]]): DefaultGraphImpl[N, E]
Implements the heart of
--calling thefromfactory method of the companion object.Implements the heart of
--calling thefromfactory method of the companion object. Note that this method must be reimplemented in each module having its own factory methods such asconstraineddoes.- Attributes
- protected
- Definition Classes
- GraphLike
-
def
minusMinusNodesEdges(delNodes: Traversable[N], delEdges: Traversable[E[N]]): (Set[N], Set[E[N]])
Calculates the
nodesandedgesarguments to be passed to a factory method when delNodes and delEdges are to be deleted by--.Calculates the
nodesandedgesarguments to be passed to a factory method when delNodes and delEdges are to be deleted by--.- Attributes
- protected
- 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: DefaultGraphImpl[N, E]
- Implicit
- This member is added by an implicit conversion from DefaultGraphImpl[N, E] to EdgeAssoc[DefaultGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: GraphBuilder[N, E, DefaultGraphImpl]
- Attributes
- protected[this]
- Definition Classes
- DefaultGraphImpl → SetLike → GenericTraversableTemplate → TraversableLike → HasNewBuilder
-
final
def
newEdge(innerEdge: E[NodeT]): EdgeT
- Attributes
- protected
- Definition Classes
- AdjacencyListGraph → GraphBase
- Annotations
- @inline()
-
final
def
newEdgeTArray(size: Int): Array[EdgeT]
- Definition Classes
- AdjacencyListGraph → AdjacencyListBase
- Annotations
- @inline()
-
final
def
newNode(n: N): NodeT
- Attributes
- protected
- Definition Classes
- AdjacencyListBase → GraphBase
- Annotations
- @inline()
-
final
def
newNodeSet: NodeSetT
- Attributes
- protected
- Definition Classes
- DefaultGraphImpl → AdjacencyListBase
- Annotations
- @inline()
-
final
def
newNodeWithHints(n: N, h: Hints): NodeBase
- Attributes
- protected
- Definition Classes
- DefaultGraphImpl → AdjacencyListBase
- Annotations
- @inline()
-
def
newPathBuilder(start: NodeT)(implicit sizeHint: Int = defaultPathSize, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): 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
- GraphTraversalImpl → GraphTraversal
-
def
newWalkBuilder(start: NodeT)(implicit sizeHint: Int = defaultPathSize, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): 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
- GraphTraversalImpl → GraphTraversal
-
def
nextHandle: Handle
Avoid calling this directly, prefer
withHandleinstead.Avoid calling this directly, prefer
withHandleinstead.- Attributes
- protected
- Definition Classes
- State
-
final
val
noNode: NodeFilter
Node predicate always returning
false.Node predicate always returning
false.- Definition Classes
- GraphBase
-
final
def
nodes: NodeSetT
The node (vertex) set of this
Graphcommonly referred to as V(G).The node (vertex) set of this
Graphcommonly referred to as V(G).- returns
Set of all contained nodes.
- Definition Classes
- DefaultGraphImpl → AdjacencyListGraph → GraphBase
- Annotations
- @inline()
-
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
trueif this graph has at least 2 nodes.trueif this graph has at least 2 nodes.- Definition Classes
- GraphBase
- Annotations
- @inline()
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
order: Int
The order - commonly referred to as |G| - of this graph equaling to the number of nodes.
The order - commonly referred to as |G| - of this graph equaling to the number of nodes.
- Definition Classes
- GraphBase
-
def
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
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
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
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
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 theBooleanparameter istrueif the traversal takes place in downward andfalseif it takes place in upward direction.Creates a OuterNodeDownUpTraverser based on
scala.collection.Traversable[(Boolean, N)]where theBooleanparameter istrueif the traversal takes place in downward andfalseif it takes place in upward direction.- root
The node where subsequent graph traversals start.
- parameters
The properties controlling subsequent traversals. A
kinddifferent fromDepthFirstwill be ignored.- subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
- subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
- ordering
If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
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
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
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): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
plusPlus(newNodes: Traversable[N], newEdges: Traversable[E[N]]): DefaultGraphImpl[N, E]
Implements the heart of
++calling thefromfactory method of the companion object.Implements the heart of
++calling thefromfactory method of the companion object. Note that this method must be reimplemented in each module having its own factory methods such asconstraineddoes.- Attributes
- protected
- Definition Classes
- GraphLike
-
def
product[B >: Param[N, E]](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
releaseHandle(handle: Handle): Unit
Avoid calling this directly, prefer
withHandleinstead.Avoid calling this directly, prefer
withHandleinstead.- Attributes
- protected
- Definition Classes
- State
-
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: DefaultGraphImpl[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[DefaultGraphImpl[N, E], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: (Param[N, E], B) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
- Annotations
- @migration
- Migration
(Changed in version 2.9.0) The behavior of
scanRighthas changed. The previous behavior can be reproduced with scanRight.reverse.
-
def
seq: Set[Param[N, E]]
- Definition Classes
- Set → GenSet → GenSetLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
final
def
serializeTo(out: ObjectOutputStream): Unit
- Attributes
- protected
- Definition Classes
- AdjacencyListBase
-
def
size: Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): DefaultGraphImpl[N, E]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
sliding(size: Int, step: Int): Iterator[DefaultGraphImpl[N, E]]
- Definition Classes
- IterableLike
-
def
sliding(size: Int): Iterator[DefaultGraphImpl[N, E]]
- Definition Classes
- IterableLike
-
def
span(p: (Param[N, E]) ⇒ Boolean): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
stringPrefix: String
- Definition Classes
- GraphLike → SetLike → TraversableLike → GenTraversableLike
-
def
strongComponentTraverser(parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): StrongComponentTraverser
Creates a StrongComponentTraverser.
Creates a StrongComponentTraverser.
- parameters
The properties controlling subsequent traversals.
- subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
- subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
- ordering
If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
- Definition Classes
- GraphTraversalImpl → GraphTraversal
-
def
subsetOf(that: GenSet[Param[N, E]]): Boolean
- Definition Classes
- GenSetLike
-
def
subsets(): Iterator[DefaultGraphImpl[N, E]]
- Definition Classes
- SetLike
-
def
subsets(len: Int): Iterator[DefaultGraphImpl[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: DefaultGraphImpl[N, E]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[DefaultGraphImpl[N, E]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): DefaultGraphImpl[N, E]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
takeRight(n: Int): DefaultGraphImpl[N, E]
- Definition Classes
- IterableLike
-
def
takeWhile(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[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: DefaultGraphImpl[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 DefaultGraphImpl[N, E] to CollectionsHaveToParArray[DefaultGraphImpl[N, E], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (DefaultGraphImpl[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
asSortedStringbut additionally prefixed and parenthesized bystringPrefix.Same as
asSortedStringbut 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
Graphhas more than 100 elements.Ensures sorted nodes/edges unless this
Graphhas more than 100 elements. See alsoasSortedStringandtoSortedString.- Definition Classes
- GraphLike → SetLike → Function1 → TraversableLike → AnyRef → Any
-
def
toTraversable: Traversable[Param[N, E]]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[Param[N, E]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
topologicalSort[U](implicit visitor: (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
componentTraverserfor 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
componentTraverserfor more control by means ofFluentProperties.
- Definition Classes
- GraphTraversal
-
def
totalDegree(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): Int
The total degree of this graph equaling to the sum of the degrees over all nodes or
0if this graph is empty.The total degree of this graph equaling to the sum of the degrees over all nodes or
0if this graph is empty.- nodeDegree
the degree function to apply to the nodes defaulting to
Degree. Non-default predefined degree functions areInDegreeandOutDegree.- degreeFilter
selects nodes to be included by their degree.
- Definition Classes
- GraphDegree
-
def
totalWeight: Double
- Definition Classes
- GraphBase
-
def
transpose[B](implicit asTraversable: (Param[N, E]) ⇒ GenTraversableOnce[B]): Set[Set[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transposethrows anIllegalArgumentExceptionif collections are not uniformly sized.
-
def
union(that: GenSet[Param[N, E]]): DefaultGraphImpl[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
-
final
def
upsert(edge: E[N]): Boolean
If an inner edge equaling to
edgeis present in this graph, it is replaced byedge, otherwiseedgewill be inserted.If an inner edge equaling to
edgeis present in this graph, it is replaced byedge, otherwiseedgewill be inserted. Such an update may be useful whenever non-key parts of an immutable edge are to be modified.- edge
The edge to add to this graph.
- returns
trueifedgehas been inserted.
- Definition Classes
- AdjacencyListGraph → GraphLike
- Annotations
- @inline()
-
val
value: DefaultGraphImpl[N, E]
- Implicit
- This member is added by an implicit conversion from DefaultGraphImpl[N, E] to OuterNode[DefaultGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- OuterNode → NodeParam
-
def
view(from: Int, until: Int): IterableView[Param[N, E], DefaultGraphImpl[N, E]]
- Definition Classes
- IterableLike → TraversableLike
-
def
view: IterableView[Param[N, E], DefaultGraphImpl[N, E]]
- Definition Classes
- IterableLike → TraversableLike
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
withFilter(p: (Param[N, E]) ⇒ Boolean): FilterMonadic[Param[N, E], DefaultGraphImpl[N, E]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
withHandle[T](reuse: Option[Handle] = None)(block: (Handle) ⇒ T): T
Executes a code block in the context of a new or reused state handler.
Executes a code block in the context of a new or reused state handler.
- returns
The result of the code block executed.
- Attributes
- protected
- Definition Classes
- State
-
def
withHandles[T](nr: Int, reuse: Array[Handle] = Array.empty[Handle])(block: (Array[Handle]) ⇒ T): T
Executes a code block in the context
nrnew state handlers or alternatively in the context of the state handlersreuse.Executes a code block in the context
nrnew state handlers or alternatively in the context of the state handlersreuse.- returns
The result of the code block executed.
- Attributes
- protected
- Definition Classes
- State
-
def
zip[A1 >: Param[N, E], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[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[DefaultGraphImpl[N, E], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipWithIndex[A1 >: Param[N, E], That](implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], (A1, Int), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
|(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
- Definition Classes
- GenSetLike
-
def
~[N >: N1](n2: N): UnDiEdge[N]
- Implicit
- This member is added by an implicit conversion from DefaultGraphImpl[N, E] to EdgeAssoc[DefaultGraphImpl[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 DefaultGraphImpl[N, E] to EdgeAssoc[DefaultGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
-
def
→[B](y: B): (DefaultGraphImpl[N, E], B)
- Implicit
- This member is added by an implicit conversion from DefaultGraphImpl[N, E] to ArrowAssoc[DefaultGraphImpl[N, E]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
Shadowed Implicit Value Members
-
def
+(other: String): String
- Implicit
- This member is added by an implicit conversion from DefaultGraphImpl[N, E] to any2stringadd[DefaultGraphImpl[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:(defaultGraphImpl: any2stringadd[DefaultGraphImpl[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 DefaultGraphImpl[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:(defaultGraphImpl: (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 DefaultGraphImpl[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:(defaultGraphImpl: (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 DefaultGraphImpl[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:(defaultGraphImpl: (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 DefaultGraphImpl[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:(defaultGraphImpl: 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 DefaultGraphImpl[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:(defaultGraphImpl: 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 DefaultGraphImpl[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:(defaultGraphImpl: MonadOps[Param[N, E]]).map(f)
- Definition Classes
- MonadOps
-
def
stringPrefix: String
- Implicit
- This member is added by an implicit conversion from DefaultGraphImpl[N, E] to OuterNode[DefaultGraphImpl[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:(defaultGraphImpl: OuterNode[DefaultGraphImpl[N, E]]).stringPrefix
- Definition Classes
- NodeParam
-
def
toString(): String
- Implicit
- This member is added by an implicit conversion from DefaultGraphImpl[N, E] to OuterNode[DefaultGraphImpl[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:(defaultGraphImpl: OuterNode[DefaultGraphImpl[N, E]]).toString()
- Definition Classes
- NodeParam → AnyRef → Any
-
def
toString(): String
- Implicit
- This member is added by an implicit conversion from DefaultGraphImpl[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:(defaultGraphImpl: (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 DefaultGraphImpl[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:(defaultGraphImpl: MonadOps[Param[N, E]]).withFilter(p)
- Definition Classes
- MonadOps
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.