GraphLike

trait GraphLike[N, E <: Edge[N], +CC[X, Y <: Edge[X]] <: GraphLike[X, Y, CC] with AnyGraph[X, Y]] extends GraphBase[N, E, [X, Y]CC[X, Y]] with GraphTraversal[N, E] with GraphDegree[N, E, [X, Y]CC[X, Y]] with ToString[N, E, [X, Y]CC[X, Y]]

A template trait for graphs.

This trait provides the common structure and operations of immutable graphs independently of their representation.

If E inherits DiHyperEdgeLike the graph is directed, otherwise it is undirected or mixed.

N: the user type of the nodes (vertices) in this graph.
E: the type of the edges in this graph.

Self Type: CC[N, E]

Linear Supertypes

ToString[N, E, CC], GraphDegree[N, E, CC], GraphTraversal[N, E], GraphBase[N, E, [X, Y]CC[X, Y]], Serializable, GraphOps[N, E, [X, Y]CC[X, Y]], OuterElems[N, E], AnyRef, Any

Known Subclasses

AnyGraph, AdjacencyListBase, AdjacencyListGraph, DefaultGraphImpl, Graph, AdjacencyListGraph, DefaultGraphImpl, Graph, GraphLike

Type Hierarchy

Ordering

Alphabetic
By Inheritance

Inherited

GraphLike
ToString
GraphDegree
GraphTraversal
GraphBase
Serializable
GraphOps
OuterElems
AnyRef
Any

Implicitly

by any2stringadd
by StringFormat
by Ensuring
by ArrowAssoc

Hide All
Show All

Visibility

Public
Protected

Type Members

trait BaseInnerEdge extends InnerEdgeLike[NodeT] with InnerEdge with Equals
Definition Classes
GraphBase
trait BaseInnerNode extends Node with InnerNode
Definition Classes
GraphBase
abstract class BaseNodeBase extends BaseInnerNode
Attributes
protected
Definition Classes
GraphBase
sealed trait EdgeOrdering extends Ordering[EdgeT] with ElemOrdering
Ordering for the path dependent type EdgeT.
Ordering for the path dependent type EdgeT.
Definition Classes
GraphBase
trait EdgeSet extends AnySet[EdgeT] with ExtSetMethods[EdgeT] with Serializable
Definition Classes
GraphBase
sealed trait ElemOrdering extends AnyRef
Base trait for graph Orderings.
Base trait for graph Orderings.
Attributes
protected
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 NodeSet extends AnySet[NodeT] with ExtSetMethods[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
type DegreeNodeSeqEntry = (Int, CC.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 EdgePredicate = (CC.EdgeT) => Boolean
Definition Classes
GraphOps
abstract type EdgeSetT <: CC.GraphEdgeSet
Definition Classes
GraphLike → GraphBase
type EdgeT = CC.GraphInnerEdge
Definition Classes
GraphLike → GraphBase → GraphOps
trait GraphEdgeSet extends CC.EdgeSet with CC.EdgeSetToString
trait GraphInnerEdge extends CC.BaseInnerEdge
trait GraphInnerNode extends CC.BaseInnerNode with CC.TraverserInnerNode
trait GraphNodeSet extends CC.NodeSet with CC.NodeSetToString
class InnerDiEdge extends DiEdge[CC.NodeT] with CC.EdgeT
Annotations
@SerialVersionUID()
class InnerDiHyperEdge extends DiHyperEdge[CC.NodeT] with CC.EdgeT
Annotations
@SerialVersionUID()
class InnerHyperEdge extends HyperEdge[CC.NodeT] with CC.EdgeT
Annotations
@SerialVersionUID()
class InnerOrderedDiHyperEdge extends OrderedDiHyperEdge[CC.NodeT] with CC.EdgeT
Annotations
@SerialVersionUID()
class InnerOrderedHyperEdge extends OrderedHyperEdge[CC.NodeT] with CC.EdgeT
Annotations
@SerialVersionUID()
class InnerUnDiEdge extends UnDiEdge[CC.NodeT] with CC.EdgeT
Annotations
@SerialVersionUID()
type Layers = Iterable[CC.Layer]
The result of a topological sort in the layered view.
The result of a topological sort in the layered view.
Definition Classes
GraphTraversal
trait NodeBase extends CC.BaseNodeBase with CC.GraphInnerNode
Attributes
protected
type NodePredicate = (CC.NodeT) => Boolean
Definition Classes
GraphOps
abstract type NodeSetT <: CC.GraphNodeSet
Definition Classes
GraphLike → GraphBase
abstract type NodeT <: CC.GraphInnerNode
Definition Classes
GraphLike → GraphTraversal → GraphBase → GraphOps
type ThisGraph = GraphLike.this.type
Attributes
protected
type TopologicalSort = Either[CC.TopologicalSortFailure, CC.TopologicalOrder[CC.NodeT]]
Definition Classes
GraphTraversal
trait InnerEdge extends InnerElem
Definition Classes
GraphOps
sealed trait InnerElem extends AnyRef
Definition Classes
GraphOps
trait InnerNode extends InnerElem
Definition Classes
GraphOps
sealed abstract class AbstractTopologicalOrder[+A, +T] extends AbstractIterable[T]
Topologically ordered nodes or layers of a topological order of a graph or of an isolated graph component.
Topologically ordered nodes or layers of a topological order of a graph or of an isolated graph component.
A
one of NodeT, N
T
one of A or (Int, Iterable[A])
Definition Classes
GraphTraversal
abstract class Component extends Properties
Represents a component of this graph.
Represents a component of this graph. Edges and bridges are computed lazily. Components will be instantiated by componentTraverser or strongComponentTraverser.
Definition Classes
GraphTraversal
abstract class ComponentTraverser extends FluentProperties[ComponentTraverser] with Properties with Iterable[Component]
Controls the properties of graph traversals with no specific root and allows you to produce the (weakly) connected components by a traversal or call methods like findCycle that work component-wise.
Controls the properties of graph traversals with no specific root and allows you to produce the (weakly) connected components by a traversal or call methods like findCycle that work component-wise.
Definition Classes
GraphTraversal
trait Cycle extends Path
Represents a cycle in this graph listing the nodes and connecting edges on it with the following syntax:
Represents a cycle in this graph listing the nodes and connecting edges on it with the following syntax:
cycle ::= start-end-node { edge node } edge start-end-node
All nodes and edges on the path are distinct except the start and end nodes that are equal. A cycle contains at least a start node followed by any number of consecutive pairs of an edge and a node and the end node equaling to the start node. The first element is the start node, the second is an edge with its tail being the start node and its head being the third element etc.
Definition Classes
GraphTraversal
trait ExtendedNodeVisitor[U] extends (NodeT) => U
Template for extended node visitors.
Template for extended node visitors. While the default node visitor of the type NodeT => U passes solely the inner node being visited, extended node visitors pass the following traversal state information:
1. the inner node currently visited as with a standard node visitor
2. the number of nodes visited so far and
3. the current depth in terms of the underlying algorithm and
4. 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[+C <: FluentProperties[C]] extends AnyRef
Properties and methods for creating modified properties in a fluent-interface manner.
Properties and methods for creating modified properties in a fluent-interface manner.
Attributes
protected
Definition Classes
GraphTraversal
abstract class InnerEdgeTraverser extends TraverserMethods[EdgeT, InnerEdgeTraverser] with Traverser[EdgeT, InnerEdgeTraverser]
Controls the properties of inner-edge graph traversals.
Controls the properties of inner-edge graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.
Definition Classes
GraphTraversal
abstract class InnerElemTraverser extends TraverserMethods[InnerElem, InnerElemTraverser] with Traverser[InnerElem, InnerElemTraverser]
Controls the properties of inner-element graph traversals.
Controls the properties of inner-element graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.
Attributes
protected
Definition Classes
GraphTraversal
abstract class InnerNodeDownUpTraverser extends TraverserMethods[(Boolean, NodeT), InnerNodeDownUpTraverser] with Traverser[(Boolean, NodeT), InnerNodeDownUpTraverser]
Controls the properties of inner-node down-up graph traversals.
Controls the properties of inner-node down-up graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.
Definition Classes
GraphTraversal
abstract class InnerNodeTraverser extends TraverserMethods[NodeT, InnerNodeTraverser] with Traverser[NodeT, InnerNodeTraverser]
Controls the properties of inner-node graph traversals.
Controls the properties of inner-node graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.
Definition Classes
GraphTraversal
case class Layer(index: Int, _nodes: IndexedSeq[NodeT]) extends Product with Serializable
Represents a topological sort layer.
Represents a topological sort layer.
Definition Classes
GraphTraversal
final class LayeredTopologicalOrder[+A] extends AbstractTopologicalOrder[A, (Int, Iterable[A])]
Layers of a topological order of a graph or of an isolated graph component.
Layers of a topological order of a graph or of an isolated graph component. The layers of a topological sort can roughly be defined as follows:
1. layer 0 contains all nodes having no predecessors,
2. layer n contains those nodes that have only predecessors in ancestor layers with at least one of them contained in layer n - 1
A
one of NodeT, N
Definition Classes
GraphTraversal
abstract class OuterEdgeTraverser extends TraverserMethods[E, OuterEdgeTraverser] with Traverser[E, OuterEdgeTraverser]
Controls the properties of outer-edge graph traversals.
Controls the properties of outer-edge graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.
Definition Classes
GraphTraversal
trait OuterElemTraverser extends TraverserMethods[OuterElem, OuterElemTraverser] with Traverser[OuterElem, OuterElemTraverser]
Controls the properties of outer-element graph traversals.
Controls the properties of outer-element graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.
Definition Classes
GraphTraversal
abstract class OuterNodeDownUpTraverser extends TraverserMethods[(Boolean, N), OuterNodeDownUpTraverser] with Traverser[(Boolean, N), OuterNodeDownUpTraverser]
Controls the properties of outer-node down-up graph traversals.
Controls the properties of outer-node down-up graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.
Definition Classes
GraphTraversal
abstract class OuterNodeTraverser extends TraverserMethods[N, OuterNodeTraverser] with Traverser[N, OuterNodeTraverser]
Controls the properties of outer-node graph traversals.
Controls the properties of outer-node graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.
Definition Classes
GraphTraversal
trait Path extends Walk
Represents a path in this graph where
Represents a path in this graph where
path ::= node { edge node }
Nodes and edges on the path are distinct. A walk/path contains at least one node followed by any number of consecutive pairs of an edge and a node. The first element is the start node, the second is an edge with its source being the start node and its target being the third element etc.
Definition Classes
GraphTraversal
trait PathBuilder extends WalkBuilder with Builder[InnerElem, Path]
A Builder for valid paths in this graph.
A Builder for valid paths in this graph.
Nodes and edges may be added either alternating or node by node respectively edge by edge. Either way, the builder ensures that the added elements build a valid path.
A node addition fails if either the node to be added is already contained or the node is not a direct successor of the previously added node or of the target node of the previously added edge. An edge addition fails if either the edge to be added is is already contained or the edge is not an outgoing edge from the previously added node or of the target node of the previously added edge.
It is recommended using add instead of += to track failed additions.
Definition Classes
GraphTraversal
trait Properties extends SubgraphProperties
Properties controlling traversals.
Properties controlling traversals.
Attributes
protected
Definition Classes
GraphTraversal
abstract class StrongComponentTraverser extends FluentProperties[StrongComponentTraverser] with Properties with Iterable[Component]
Controls the properties of graph traversals with no specific root and allows you to produce the strongly connected components by a traversal.
Controls the properties of graph traversals with no specific root and allows you to produce the strongly connected components by a traversal.
Definition Classes
GraphTraversal
trait SubgraphProperties extends AnyRef
Properties controlling the scope of traversals.
Properties controlling the scope of traversals.
Attributes
protected
Definition Classes
GraphTraversal
final class TopologicalOrder[+A] extends AbstractTopologicalOrder[A, A]
A traversable topological order of nodes of a graph or of an isolated graph component.
A traversable topological order of nodes of a graph or of an isolated graph component.
A
one of NodeT, N
Definition Classes
GraphTraversal
case class TopologicalSortFailure extends Product with Serializable
Failure result of a topological sort with a possible hint of candidate cycle nodes.
Failure result of a topological sort with a possible hint of candidate cycle nodes.
Definition Classes
GraphTraversal
trait Traverser[A, +CC <: Traverser[A, CC]] extends TraverserMethods[A, CC] with Properties with ForeachBasedDetachingIterable[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 BaseInnerNode
Definition Classes
GraphTraversal
abstract class TraverserMethods[A, +CC <: TraverserMethods[A, CC]] extends FluentProperties[CC]
The root-related methods Traverser will inherit.
The root-related methods Traverser will inherit.
Attributes
protected
Definition Classes
GraphTraversal
trait Walk extends Iterable[InnerElem]
Represents a walk in this graph where walk ::= node { edge node } A walk/path contains at least one node followed by any number of consecutive pairs of an edge and a node.
Represents a walk in this graph where walk ::= node { edge node } A walk/path contains at least one node followed by any number of consecutive pairs of an edge and a node. The first element is the start node, the second is an edge with its source being the start node and its target being the third element etc.
Definition Classes
GraphTraversal
trait WalkBuilder extends Builder[InnerElem, Walk]
A Builder for valid walks in this graph.
A Builder for valid walks in this graph.
Nodes and edges may be added either alternating or node by node respectively edge by edge. Either way, the builder ensures that the added elements build a valid walk.
A node addition fails if the node to be added is not a direct successor of the previously added node or of the target node of the previously added edge. An edge addition fails if the edge to be added is not an outgoing edge from the previously added node or of the target node of the previously added edge.
It is recommended using add instead of += to track failed additions.
Definition Classes
GraphTraversal
class Weight extends AnyRef
Stores a value and an edge weight function for use in 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
sealed case class OuterEdge(edge: E) extends OuterElem with Product with Serializable
To be mixed in by edge classes to allow passing them to Graph(...).
To be mixed in by edge classes to allow passing them to Graph(...).
Definition Classes
OuterElems
trait OuterElem extends AnyRef
Definition Classes
OuterElems
sealed case class OuterNode(node: N) extends OuterElem with Product with Serializable
Wraps any type to be accepted when calling Graph(...).
Wraps any type to be accepted when calling Graph(...).
Definition Classes
OuterElems
trait EdgeSetToString extends GraphLike.SetToString[EdgeT]
Attributes
protected
Definition Classes
ToString
trait NodeSetToString extends GraphLike.SetToString[NodeT]
Attributes
protected
Definition Classes
ToString
trait SetToString[A] extends AnySet[A]
Attributes
protected
Definition Classes
ToString

Abstract Value Members

abstract val companion: Factory[[X, Y]CC[X, Y]]
The companion object of CC.
abstract def componentTraverser(parameters: Parameters = Parameters(), subgraphNodes: CC.NodePredicate = anyNode, subgraphEdges: CC.EdgePredicate = anyEdge, ordering: CC.ElemOrdering = NoOrdering, maxWeight: Option[CC.Weight] = None): CC.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 NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.
maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
Definition Classes
GraphTraversal
abstract def concat[N2 >: N, E2 >: E <: Edge[N2]](isolatedNodes: IterableOnce[N2], edges: IterableOnce[E2])(implicit e: <:<[E2, Edge[N2]]): CC[N2, E2]
Creates a new graph by adding all edges and isolatedNodes omitting duplicates.
Creates a new graph by adding all edges and isolatedNodes omitting duplicates. The new graph is upcasted if any of the arguments is an upcast of N respectively E. Use union to concatenate all nodes and edges of another graph.
isolatedNodes
to be concatenated. Nodes that are implicitly defined by any edge in edges will be ignored.
edges
to be concatenated.
Definition Classes
GraphOps
implicit abstract def config: GraphConfig
abstract def edges: CC.EdgeSetT
The edge set of this Graph commonly referred to as E(G).
The edge set of this Graph commonly referred to as E(G).
returns
Set of all contained edges.
Definition Classes
GraphBase
abstract def empty: CC[N, E]
abstract def innerEdgeTraverser(root: CC.NodeT, parameters: Parameters = Parameters(), subgraphNodes: CC.NodePredicate = anyNode, subgraphEdges: CC.EdgePredicate = anyEdge, ordering: CC.ElemOrdering = NoOrdering, maxWeight: Option[CC.Weight] = None): CC.InnerEdgeTraverser
Creates a InnerEdgeTraverser based on scala.collection.Iterable[EdgeT].
Creates a InnerEdgeTraverser based on scala.collection.Iterable[EdgeT].
root
The node where subsequent graph traversals start.
parameters
The properties controlling subsequent traversals.
subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
ordering
If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.
Definition Classes
GraphTraversal
abstract def innerElemTraverser(root: CC.NodeT, parameters: Parameters = Parameters(), subgraphNodes: CC.NodePredicate = anyNode, subgraphEdges: CC.EdgePredicate = anyEdge, ordering: CC.ElemOrdering = NoOrdering, maxWeight: Option[CC.Weight] = None): CC.InnerElemTraverser
Creates a InnerElemTraverser based on scala.collection.Iterable[InnerElem].
Creates a InnerElemTraverser based on scala.collection.Iterable[InnerElem].
root
The node where subsequent graph traversals start.
parameters
The properties controlling subsequent traversals.
subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
ordering
If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.
maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
Definition Classes
GraphTraversal
abstract def innerNodeDownUpTraverser(root: CC.NodeT, parameters: Parameters = Parameters(), subgraphNodes: CC.NodePredicate = anyNode, subgraphEdges: CC.EdgePredicate = anyEdge, ordering: CC.ElemOrdering = NoOrdering, maxWeight: Option[CC.Weight] = None): CC.InnerNodeDownUpTraverser
Creates a InnerNodeDownUpTraverser based on scala.collection.Iterable[(Boolean, NodeT)] where the Boolean parameter is true if the traversal takes place in downward and false if it takes place in upward direction.
Creates a InnerNodeDownUpTraverser based on scala.collection.Iterable[(Boolean, NodeT)] where the Boolean parameter is true if the traversal takes place in downward and false if it takes place in upward direction.
root
The node where subsequent graph traversals start.
parameters
The properties controlling subsequent traversals. A kind different from DepthFirst will be ignored.
subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
ordering
If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.
maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
Definition Classes
GraphTraversal
abstract def innerNodeTraverser(root: CC.NodeT, parameters: Parameters = Parameters(), subgraphNodes: CC.NodePredicate = anyNode, subgraphEdges: CC.EdgePredicate = anyEdge, ordering: CC.ElemOrdering = NoOrdering, maxWeight: Option[CC.Weight] = None): CC.InnerNodeTraverser
Creates a InnerNodeTraverser based on scala.collection.Iterable[NodeT].
Creates a InnerNodeTraverser based on scala.collection.Iterable[NodeT].
root
The node where subsequent graph traversals start.
parameters
The properties controlling subsequent traversals.
subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
ordering
If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.
maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
Definition Classes
GraphTraversal
abstract def newBuilder: Builder[N, E, [X, Y]CC[X, Y]]
Attributes
protected[this]
abstract def newNode(n: N): CC.NodeT
Attributes
protected
Definition Classes
GraphBase
abstract def newPathBuilder(start: CC.NodeT)(implicit sizeHint: Int = defaultPathSize, edgeSelector: (CC.NodeT, CC.NodeT) => Option[CC.EdgeT] = anyEdgeSelector): CC.PathBuilder
Instantiates a PathBuilder for this graph.
Instantiates a PathBuilder for this graph.
start
The node this path starts at.
sizeHint
Expected maximum number of nodes on this path.
edgeSelector
Determines the edge to be selected between neighbor nodes if an edge is not supplied explicitly. This is only relevant in case of multigraphs.
Definition Classes
GraphTraversal
abstract def newWalkBuilder(start: CC.NodeT)(implicit sizeHint: Int = defaultPathSize, edgeSelector: (CC.NodeT, CC.NodeT) => Option[CC.EdgeT] = anyEdgeSelector): CC.WalkBuilder
Instantiates a WalkBuilder for this graph.
Instantiates a WalkBuilder for this graph.
start
The node this walk starts at.
sizeHint
Expected maximum number of nodes on this walk.
edgeSelector
Determines the edge to be selected between neighbor nodes if an edge is not supplied explicitly. This is only relevant in case of multigraphs.
Definition Classes
GraphTraversal
abstract def nodes: CC.NodeSetT
The node (vertex) set of this Graph commonly referred to as V(G).
The node (vertex) set of this Graph commonly referred to as V(G).
returns
Set of all contained nodes.
Definition Classes
GraphBase
abstract def outerEdgeTraverser(root: CC.NodeT, parameters: Parameters = Parameters(), subgraphNodes: CC.NodePredicate = anyNode, subgraphEdges: CC.EdgePredicate = anyEdge, ordering: CC.ElemOrdering = NoOrdering, maxWeight: Option[CC.Weight] = None): CC.OuterEdgeTraverser
Creates a OuterEdgeTraverser based on scala.collection.Iterable[E[N]].
Creates a OuterEdgeTraverser based on scala.collection.Iterable[E[N]].
root
The node where subsequent graph traversals start.
parameters
The properties controlling subsequent traversals.
subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
ordering
If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.
maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
Definition Classes
GraphTraversal
abstract def outerElemTraverser(root: CC.NodeT, parameters: Parameters = Parameters(), subgraphNodes: CC.NodePredicate = anyNode, subgraphEdges: CC.EdgePredicate = anyEdge, ordering: CC.ElemOrdering = NoOrdering, maxWeight: Option[CC.Weight] = None): CC.OuterElemTraverser
Creates a OuterElemTraverser based on scala.collection.Iterable[OuterElem].
Creates a OuterElemTraverser based on scala.collection.Iterable[OuterElem].
root
The node where subsequent graph traversals start.
parameters
The properties controlling subsequent traversals.
subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
ordering
If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.
maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
Definition Classes
GraphTraversal
abstract def outerNodeDownUpTraverser(root: CC.NodeT, parameters: Parameters = Parameters(), subgraphNodes: CC.NodePredicate = anyNode, subgraphEdges: CC.EdgePredicate = anyEdge, ordering: CC.ElemOrdering = NoOrdering, maxWeight: Option[CC.Weight] = None): CC.OuterNodeDownUpTraverser
Creates a OuterNodeDownUpTraverser based on scala.collection.Iterable[(Boolean, N)] where the Boolean parameter is true if the traversal takes place in downward and false if it takes place in upward direction.
Creates a OuterNodeDownUpTraverser based on scala.collection.Iterable[(Boolean, N)] where the Boolean parameter is true if the traversal takes place in downward and false if it takes place in upward direction.
root
The node where subsequent graph traversals start.
parameters
The properties controlling subsequent traversals. A kind different from DepthFirst will be ignored.
subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
ordering
If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.
Definition Classes
GraphTraversal
abstract def outerNodeTraverser(root: CC.NodeT, parameters: Parameters = Parameters(), subgraphNodes: CC.NodePredicate = anyNode, subgraphEdges: CC.EdgePredicate = anyEdge, ordering: CC.ElemOrdering = NoOrdering, maxWeight: Option[CC.Weight] = None): CC.OuterNodeTraverser
Creates a OuterNodeTraverser based on scala.collection.Iterable[N].
Creates a OuterNodeTraverser based on scala.collection.Iterable[N].
root
The node where subsequent graph traversals start.
parameters
The properties controlling subsequent traversals.
subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
ordering
If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.
maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
Definition Classes
GraphTraversal
abstract def removedAll(isolatedNodes: IterableOnce[N], edges: IterableOnce[E]): CC[N, E]
Attributes
protected
Definition Classes
GraphOps
abstract def strongComponentTraverser(parameters: Parameters = Parameters(), subgraphNodes: CC.NodePredicate = anyNode, subgraphEdges: CC.EdgePredicate = anyEdge, ordering: CC.ElemOrdering = NoOrdering, maxWeight: Option[CC.Weight] = None): CC.StrongComponentTraverser
Creates a StrongComponentTraverser.
Creates a StrongComponentTraverser.
parameters
The properties controlling subsequent traversals.
subgraphNodes
Restricts subsequent graph traversals to visit only nodes holding this predicate.
subgraphEdges
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
ordering
If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.
maxWeight
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
Definition Classes
GraphTraversal

Concrete Value Members

object BaseInnerEdge
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 NoOrdering extends ElemOrdering with Serializable
The empty ElemOrdering.
The empty ElemOrdering.
Definition Classes
GraphBase
object Node extends Serializable
Definition Classes
GraphBase
Annotations
@transient()
object NodeOrdering extends Serializable
Definition Classes
GraphBase
object Degree extends (GraphDegree.this)#DegreeFunction
Definition Classes
GraphDegree
object DegreeOrdering extends Serializable
Definition Classes
GraphDegree
object InDegree extends (GraphDegree.this)#DegreeFunction
Definition Classes
GraphDegree
object IntReverseOrdering extends Ordering[Int]
Decreasing ordering of integers.
Decreasing ordering of integers.
Definition Classes
GraphDegree
object OutDegree extends (GraphDegree.this)#DegreeFunction
Definition Classes
GraphDegree
final def !=(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def ##: Int
Definition Classes
AnyRef → Any
final def &(that: AnyGraph[N, E]): CC[N, E]
Alias for intersect.
Alias for intersect.
Definition Classes
GraphOps
Annotations
@inline()
final def &~(that: AnyGraph[N, E]): CC[N, E]
Alias for diff.
Alias for diff.
Definition Classes
GraphOps
Annotations
@inline()
def +(other: String): String
Implicit
This member is added by an implicit conversion from GraphLike[N, E, CC] toany2stringadd[GraphLike[N, E, CC]] performed by method any2stringadd in scala.Predef.
Definition Classes
any2stringadd
final def ++[N2 >: N, E2 >: E <: Edge[N2]](edges: IterableOnce[E2])(implicit e: <:<[E2, Edge[N2]]): CC[N2, E2]
Alias for concat(edges).
Alias for concat(edges).
Definition Classes
GraphOps
Annotations
@inline()
final def ++[N2 >: N, E2 >: E <: Edge[N2]](isolatedNodes: IterableOnce[N2], edges: IterableOnce[E2])(implicit e: <:<[E2, Edge[N2]]): CC[N2, E2]
Alias for concat(isolatedNodes, edges).
Alias for concat(isolatedNodes, edges).
Definition Classes
GraphOps
Annotations
@inline()
def ->[B](y: B): (GraphLike[N, E, CC], B)
Implicit
This member is added by an implicit conversion from GraphLike[N, E, CC] toArrowAssoc[GraphLike[N, E, CC]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
final def ==(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final val anyEdge: CC.EdgePredicate
Default edge filter letting path all edges (non-filter).
Default edge filter letting path all edges (non-filter).
Definition Classes
GraphBase → GraphOps
final def anyEdgeSelector(from: CC.NodeT, to: CC.NodeT): Option[CC.EdgeT]
An arbitrary edge between from and to that is available most efficiently.
An arbitrary edge between from and to that is available most efficiently.
Definition Classes
GraphTraversal
Annotations
@inline()
final val anyNode: CC.NodePredicate
Default node filter letting traverse all nodes (non-filter).
Default node filter letting traverse all nodes (non-filter).
Definition Classes
GraphBase → GraphOps
final lazy val anyOrdering: AnyOrdering[N]
Attributes
protected
Definition Classes
GraphBase
final def apply(edge: E): Boolean
Whether the given edge is contained in this graph.
Whether the given edge is contained in this graph.
Definition Classes
GraphOps
Annotations
@inline()
final def apply(node: N): Boolean
Whether the given node is contained in this graph.
Whether the given node is contained in this graph.
Definition Classes
GraphOps
Annotations
@inline()
final def asInstanceOf[T0]: T0
Definition Classes
Any
def className: String
Attributes
protected
Definition Classes
ToString
def clone(): AnyRef
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
def concat[N2 >: N, E2 >: E <: Edge[N2]](edges: IterableOnce[E2])(implicit e: <:<[E2, Edge[N2]]): CC[N2, E2]
Same as concat(isolatedNodes, edges) but with empty isolatedNodes.
Same as concat(isolatedNodes, edges) but with empty isolatedNodes. This method is useful if you don't need to pass any isolated node.
Definition Classes
GraphOps
final def contains(edge: E): Boolean
Whether the given outer edge is contained in this graph.
Whether the given outer edge is contained in this graph.
Definition Classes
GraphLike → GraphOps
final def contains(node: N): Boolean
Whether the given outer node is contained in this graph.
Whether the given outer node is contained in this graph.
Definition Classes
GraphLike → GraphOps
final lazy val defaultEdgeOrdering: CC.EdgeOrdering
Definition Classes
GraphBase
final lazy val defaultNodeOrdering: CC.NodeOrdering
Definition Classes
GraphBase
final def defaultPathSize: Int
Attributes
protected
Definition Classes
GraphTraversal
Annotations
@inline()
def degreeCount(implicit nodeDegree: CC.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: CC.DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): Seq[CC.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: CC.DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): SortedMap[Int, AnySet[CC.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: CC.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: CC.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
final def diff(that: AnyGraph[N, E]): CC[N, E]
Computes a new graph that is the difference of this graph and that graph.
Computes a new graph that is the difference of this graph and that graph.
Definition Classes
GraphOps
final def elementCount: Int
The number of nodes and edges.
The number of nodes and edges.
Definition Classes
GraphOps
Annotations
@inline()
def ensuring(cond: (GraphLike[N, E, CC]) => Boolean, msg: => Any): GraphLike[N, E, CC]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, CC] toEnsuring[GraphLike[N, E, CC]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: (GraphLike[N, E, CC]) => Boolean): GraphLike[N, E, CC]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, CC] toEnsuring[GraphLike[N, E, CC]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean, msg: => Any): GraphLike[N, E, CC]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, CC] toEnsuring[GraphLike[N, E, CC]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean): GraphLike[N, E, CC]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, CC] toEnsuring[GraphLike[N, E, CC]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def equals(that: Any): Boolean
Graph instances are equal if their nodes and edges turned to outer nodes and outer edges are equal.
Graph instances are equal if their nodes and edges turned to outer nodes and outer edges are equal. Any TraversableOnce instance may also be equal to this graph if its set representation contains equalling outer nodes and outer edges. Thus the following expressions hold:
```
Graph(1~2, 3) == List(1~2, 3)
Graph(1~2, 3) == List(1, 2, 2, 3, 2~1)
```
The first test is false because of the failing nodes 1 and 2. The second is true because of duplicate elimination and undirected edge equivalence.
Definition Classes
GraphLike → AnyRef → Any
final def filter(nodeP: CC.NodePredicate = anyNode, edgeP: CC.EdgePredicate = anyEdge): CC[N, E]
Computes a new graph with nodes satisfying nodeP and edges satisfying edgeP.
Computes a new graph with nodes satisfying nodeP and edges satisfying edgeP. If both nodeP and edgeP have default values the original graph is retained.
Definition Classes
GraphLike → GraphOps
def filterNot(nodeP: CC.NodePredicate = noNode, edgeP: CC.EdgePredicate = noEdge): CC[N, E]
Computes a new graph without nodes satisfying nodeP and without edges satisfying ePred.
Computes a new graph without nodes satisfying nodeP and without edges satisfying ePred. If both nodeP and ePred have default values the original graph is retained.
Definition Classes
GraphOps
final def find(edge: E): Option[CC.EdgeT]
Searches this graph for an inner edge that wraps an outer edge equalling to the given outer edge.
Searches this graph for an inner edge that wraps an outer edge equalling to the given outer edge.
Definition Classes
GraphLike → GraphOps
Annotations
@inline()
final def find(node: N): Option[CC.NodeT]
Searches this graph for an inner node that wraps an outer node equalling to the given outer node.
Searches this graph for an inner node that wraps an outer node equalling to the given outer node.
Definition Classes
GraphLike → GraphOps
Annotations
@inline()
final def findCycle[U](implicit visitor: (CC.InnerElem) => U = empty): Option[CC.Cycle]
Finds a cycle in this graph in any of its components and calls visitor for each inner element visited during the search.
Finds a cycle in this graph in any of its components and calls visitor for each inner element visited during the search. See componentTraverser for more control by means of FluentProperties.
Definition Classes
GraphTraversal
final def findCycleContaining[U](node: CC.NodeT)(implicit visitor: (CC.InnerElem) => U = empty): Option[CC.Cycle]
Finds a cycle that contains node and calls visitor for each inner element visited during the search.
Finds a cycle that contains node and calls visitor for each inner element visited during the search.
Definition Classes
GraphTraversal
final def flatMap[NN, EC[X] <: Edge[X]](fNode: (CC.NodeT) => Seq[NN], fEdge: (CC.EdgeT, Seq[NN], Seq[NN]) => Seq[EC[NN]])(implicit w: <:<[E, AnyEdge[N]]): CC[NN, EC[NN]]
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
You can call this flavor only if this graph's edge type is generic. Otherwise see flatMapBound.
NN
The node type of the resulting graph which may be unchanged or different from this graph's node type.
EC
The higher kind of the generic edge type parameter of this graph.
fNode
To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.
fEdge
To apply to all edges of this graph. This function is passed the current inner edge and its ends after being mapped by fNode. Since the inner edge is passed you can also examine its context. Call outer to get the outer edge of type E.
returns
A new graph of possibly changed node and edge types and of any new structure depending on your edge mapper(s).
Definition Classes
GraphLike → GraphOps
final def flatMap[NN, EC[X] <: Edge[X]](fNode: (CC.NodeT) => Seq[NN])(implicit w1: <:<[E, GenericMapper], w2: =:=[EC[N], E], t: ClassTag[EC[NN]]): CC[NN, EC[NN]]
Creates a new graph with nodes returned by fNode and an edge structure that remains intact where possible.
Creates a new graph with nodes returned by fNode and an edge structure that remains intact where possible.
You can call this flavor only if this graph's edge type is generic. Otherwise see flatMapBound.
If this graph also contains typed edges, the typed edge's partial map function will be called to replace the ends. If the partial function is not defined, there will be an attempt to fall back to a generic edge. If that attempt also fails the edge will be dropped. So, if you have a mixed graph with generic and typed edges, prefer mapping edges directly to avoid leaving edges out.
NN
The node type of the resulting graph which may be unchanged or different from this graph's node type.
EC
The higher kind of the generic edge type parameter of this graph.
fNode
To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node. If fNode returns several new nodes with none equaling to the original node, the first new node is accepted to be the result of the node transformation. For more flexibility pass your own edge mapper to the overload.
returns
A new graph of possibly changed node and edge types and of any new structure depending on your edge mapper(s).
Definition Classes
GraphLike → GraphOps
final def flatMap[NN, EC[X] <: Edge[X]](fNode: (CC.NodeT) => Seq[NN], fEdge: (Seq[NN], Seq[NN]) => Seq[EC[NN]])(implicit w: <:<[E, AnyEdge[N]]): CC[NN, EC[NN]]
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
See overload except the parameter
fEdge
has a simplified signature in this overload leaving out the inner edge. This comes in handy whenever you don't need to inspect inner edges.
Definition Classes
GraphOps
final def flatMapBound[NN, EC <: Edge[NN]](fNode: (CC.NodeT) => Seq[NN], fEdge: (CC.EdgeT, Seq[NN], Seq[NN]) => Seq[EC])(implicit w: <:<[E, AnyEdge[N]]): CC[NN, EC]
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
You can call this flavor only if this graph's edge type is typed. Otherwise see flatMap.
NN
The node type of the resulting graph which may be unchanged or different from this graph's node type.
EC
The edge type parameter of this graph.
fNode
To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.
fEdge
To apply to all edges of this graph. This function is passed the current inner edge and its ends after being mapped by fNode. Since the inner edge is passed you can also examine its context. Call outer to get the outer edge of type E.
returns
A new graph of possibly changed node and edge types and of any new structure depending on your edge mapper(s).
Definition Classes
GraphLike → GraphOps
final def flatMapBound(fNode: (CC.NodeT) => Seq[N])(implicit w1: <:<[E, PartialMapper]): CC[N, E]
Creates a new graph with nodes returned by fNode and an edge structure that remains intact where possible.
Creates a new graph with nodes returned by fNode and an edge structure that remains intact where possible.
You can call this flavor only if this graph's edge type is typed. Otherwise see flatMap.
fNode
To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node. If fNode returns several new nodes with none equaling to the original node, the first new node is accepted to be the result of the node transformation. For more flexibility pass your own edge mapper to the overload.
Definition Classes
GraphLike → GraphOps
final def flatMapBound[NN, EC <: Edge[NN]](fNode: (CC.NodeT) => Seq[NN], fEdge: (Seq[NN], Seq[NN]) => Seq[EC])(implicit w: <:<[E, AnyEdge[N]]): CC[NN, EC]
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
You can call this flavor only if this graph's edge type is typed. Otherwise see flatMap.
See overload except the parameter
fEdge
has a simplified signature in this overload leaving out the inner edge. This comes in handy whenever you don't need to inspect inner edges.
Definition Classes
GraphOps
final def flatMapDiHyper[NN, EC[X] <: Edge[X]](fNode: (CC.NodeT) => Seq[NN], fDiHyperEdge: (CC.EdgeT, Seq[NN], Seq[NN]) => Seq[EC[NN]], fEdge: Option[(CC.EdgeT, Seq[NN], Seq[NN]) => Seq[EC[NN]]])(implicit w: <:<[E, AnyDiHyperEdge[N]]): CC[NN, EC[NN]]
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
You can call this flavor only if this graph's edge type is generic. Otherwise see flatMapDiHyperBound.
NN
The node type of the resulting graph which may be unchanged or different from this graph's node type.
EC
The higher kind of the generic edge type parameter of this graph.
fNode
To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.
fDiHyperEdge
To apply to all directed hyperedges in this graph. This function is passed the existing inner directed hyperedge and its sources and targets after being mapped by fNode. Since the inner directed hyperedge is passed you can also examine the edge context. Call outer to get the outer directed hyperedge of type E.
fEdge
To apply to any directed or undirected edge in this possibly mixed graph. If not present simple edges will be mapped by the mandatory edge mapper you supply. You are recommended supplying Some unless you know that the graph does not contain any simple edge.
returns
A new graph of possibly changed node and edge types and of any new structure depending on your edge mapper(s).
Definition Classes
GraphLike → GraphOps
final def flatMapDiHyper[NN, EC[X] <: Edge[X]](fNode: (CC.NodeT) => Seq[NN], fDiHyperEdge: (Seq[NN], Seq[NN]) => Seq[EC[NN]], fEdge: Option[(Seq[NN], Seq[NN]) => Seq[EC[NN]]] = None)(implicit w: <:<[E, AnyDiHyperEdge[N]]): CC[NN, EC[NN]]
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
You can call this flavor only if this graph's edge type is generic. Otherwise see flatMapDiHyperBound.
See overload except the parameter
fDiHyperEdge
has a simplified signature in this overload leaving out the inner edge. This comes in handy whenever you don't need to inspect inner edges.
Definition Classes
GraphOps
final def flatMapDiHyperBound[NN, EC <: Edge[NN]](fNode: (CC.NodeT) => Seq[NN], fDiHyperEdge: (CC.EdgeT, Seq[NN], Seq[NN]) => Seq[EC], fEdge: Option[(CC.EdgeT, Seq[NN], Seq[NN]) => Seq[EC]])(implicit w: <:<[E, AnyDiHyperEdge[N]]): CC[NN, EC]
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
You can call this flavor only if this graph's edge type is typed. Otherwise see flatMapDiHyper.
NN
The node type of the resulting graph which may be unchanged or different from this graph's node type.
EC
The edge type parameter of this graph.
fNode
To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.
fDiHyperEdge
To apply to all directed hyperedges in this graph. This function is passed the existing inner directed hyperedge and its sources and targets after being mapped by fNode. Since the inner directed hyperedge is passed you can also examine the edge context. Call outer to get the outer directed hyperedge of type E.
fEdge
To apply to any directed or undirected edge in this possibly mixed graph. If not present simple edges will be mapped by the mandatory edge mapper you supply. You are recommended supplying Some unless you know that the graph does not contain any simple edge.
returns
A new graph of possibly changed node and edge types and of any new structure depending on your edge mapper(s).
Definition Classes
GraphLike → GraphOps
final def flatMapDiHyperBound[NN, EC <: Edge[NN]](fNode: (CC.NodeT) => Seq[NN], fDiHyperEdge: (Seq[NN], Seq[NN]) => Seq[EC], fEdge: Option[(Seq[NN], Seq[NN]) => Seq[EC]] = None)(implicit w: <:<[E, AnyDiHyperEdge[N]]): CC[NN, EC]
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
You can call this flavor only if this graph's edge type is typed. Otherwise see flatMapDiHyper.
See overload except the parameter
fDiHyperEdge
has a simplified signature in this overload leaving out the inner edge. This comes in handy whenever you don't need to inspect inner edges.
Definition Classes
GraphOps
final def flatMapHyper[NN, EC[X] <: Edge[X]](fNode: (CC.NodeT) => Seq[NN], fHyperEdge: (CC.EdgeT, Seq[NN]) => Seq[EC[NN]], fDiHyperEdge: Option[(CC.EdgeT, Seq[NN], Seq[NN]) => Seq[EC[NN]]], fEdge: Option[(CC.EdgeT, Seq[NN], Seq[NN]) => Seq[EC[NN]]])(implicit w: <:<[E, AnyHyperEdge[N]]): CC[NN, EC[NN]]
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
You can call this flavor only if this graph's edge type is generic. Otherwise see flatMapHyperBound.
NN
The node type of the resulting graph which may be unchanged or different from this graph's node type.
EC
The higher kind of the generic edge type parameter of this graph.
fNode
To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.
fHyperEdge
To apply to all hyperedges in this graph. This function is passed the current inner hyperedge and its ends after being mapped by fNode. Since the inner hyperedge is passed you can also examine its context. Call outer to get the outer hyperedge of type E.
fDiHyperEdge
To apply to any directed hyperedge in this possibly mixed graph. If not present directed hyperedges will be mapped by the mandatory fDiHyperEdge. You are recommended supplying Some unless you know that the graph does not contain any directed hyperedge.
fEdge
To apply to any directed or undirected edge in this possibly mixed graph. If not present simple edges will be mapped by the mandatory edge mapper you supply. You are recommended supplying Some unless you know that the graph does not contain any simple edge.
returns
A new graph of possibly changed node and edge types and of any new structure depending on your edge mapper(s).
Definition Classes
GraphLike → GraphOps
final def flatMapHyper[NN, EC[X] <: Edge[X]](fNode: (CC.NodeT) => Seq[NN], fHyperEdge: (Seq[NN]) => Seq[EC[NN]], fDiHyperEdge: Option[(Seq[NN], Seq[NN]) => Seq[EC[NN]]] = None, fEdge: Option[(Seq[NN], Seq[NN]) => Seq[EC[NN]]] = None)(implicit w: <:<[E, AnyHyperEdge[N]]): CC[NN, EC[NN]]
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
You can call this flavor only if this graph's edge type is generic. Otherwise see flatMapHyperBound.
See overload except the parameter
fHyperEdge
has a simplified signature in this overload leaving out the inner edge. This comes in handy whenever you don't need to inspect inner edges.
Definition Classes
GraphOps
final def flatMapHyperBound[NN, EC <: Edge[NN]](fNode: (CC.NodeT) => Seq[NN], fHyperEdge: (CC.EdgeT, Seq[NN]) => Seq[EC], fDiHyperEdge: Option[(CC.EdgeT, Seq[NN], Seq[NN]) => Seq[EC]], fEdge: Option[(CC.EdgeT, Seq[NN], Seq[NN]) => Seq[EC]])(implicit w: <:<[E, AnyHyperEdge[N]]): CC[NN, EC]
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
You can call this flavor only if this graph's edge type is typed. Otherwise see flatMapHyper.
NN
The node type of the resulting graph which may be unchanged or different from this graph's node type.
EC
The edge type parameter of this graph.
fNode
To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.
fHyperEdge
To apply to all hyperedges in this graph. This function is passed the current inner hyperedge and its ends after being mapped by fNode. Since the inner hyperedge is passed you can also examine its context. Call outer to get the outer hyperedge of type E.
fDiHyperEdge
To apply to any directed hyperedge in this possibly mixed graph. If not present directed hyperedges will be mapped by the mandatory fDiHyperEdge. You are recommended supplying Some unless you know that the graph does not contain any directed hyperedge.
fEdge
To apply to any directed or undirected edge in this possibly mixed graph. If not present simple edges will be mapped by the mandatory edge mapper you supply. You are recommended supplying Some unless you know that the graph does not contain any simple edge.
returns
A new graph of possibly changed node and edge types and of any new structure depending on your edge mapper(s).
Definition Classes
GraphLike → GraphOps
final def flatMapHyperBound[NN, EC <: Edge[NN]](fNode: (CC.NodeT) => Seq[NN], fHyperEdge: (Seq[NN]) => Seq[EC], fDiHyperEdge: Option[(Seq[NN], Seq[NN]) => Seq[EC]] = None, fEdge: Option[(Seq[NN], Seq[NN]) => Seq[EC]] = None)(implicit w: <:<[E, AnyHyperEdge[N]]): CC[NN, EC]
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
Creates a new graph with nodes and edges returned by fNode respectively fEdge.
You can call this flavor only if this graph's edge type is typed. Otherwise see flatMapHyper.
See overload except the parameter
fHyperEdge
has a simplified signature in this overload leaving out the inner edge. This comes in handy whenever you don't need to inspect inner edges.
Definition Classes
GraphOps
def foldLeft[B](z: B)(opNode: (B, CC.NodeT) => B, opEdge: (B, CC.EdgeT) => B): B
Applies a node-specific and an edge-specific binary operator to a cumulated value.
Applies a node-specific and an edge-specific binary operator to a cumulated value. First opNode is called for all nodes than opEdge for all edges.
B
the result type of the binary operator.
z
the start value that is passed to opNode the first time.
opNode
the binary operator that is passed the cumulated value and an inner node.
opEdge
the binary operator that is passed the cumulated value and an inner edge.
returns
the cumulated value.
Definition Classes
GraphLike → GraphOps
final def foldLeftOuter[B](z: B)(opNode: (B, N) => B, opEdge: (B, E) => B): B
Same as foldLeft except the second parameter of the binary operators.
Same as foldLeft except the second parameter of the binary operators.
opNode
the binary operator that is passed the cumulated value and an outer node.
opEdge
the binary operator that is passed the cumulated value and an outer edge.
Definition Classes
GraphOps
final def get(edge: E): CC.EdgeT
Short for find(edge).get.
Short for find(edge).get.
Definition Classes
GraphLike → GraphOps
Annotations
@inline()
Exceptions thrown
NoSuchElementException if the edge is not found.
final def get(node: N): CC.NodeT
Short for find(node).get.
Short for find(node).get.
Definition Classes
GraphLike → GraphOps
Annotations
@inline()
Exceptions thrown
NoSuchElementException if the node is not found.
final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native() @HotSpotIntrinsicCandidate()
def hashCode(): Int
Definition Classes
AnyRef → Any
Annotations
@native() @HotSpotIntrinsicCandidate()
def initialize(nodes: Iterable[N], edges: Iterable[E]): Unit
Populates this graph with nodes and edges.
Populates this graph with nodes and edges. The implementing class will typically have a constructor with the same parameters which is invoked by from of the companion object.
nodes
The isolated (and optionally any other) outer nodes that the node set of this graph is to be populated with.
edges
The outer edges that the edge set of this graph is to be populated with. Nodes being the end of any of these edges will be added to the node set.
Attributes
protected
Definition Classes
GraphBase
final def intersect(that: AnyGraph[N, E]): CC[N, E]
Computes the intersection between this graph and that graph.
Computes the intersection between this graph and that graph.
Definition Classes
GraphOps
final def isAcyclic: Boolean
Whether this graph has no cycle.
Whether this graph has no cycle.
Definition Classes
GraphTraversal
Annotations
@inline()
def isComplete: Boolean
Whether all nodes are pairwise adjacent.
Whether all nodes are pairwise adjacent.
returns
true if this graph is complete, false if this graph contains any independent nodes.
Definition Classes
GraphTraversal
def isConnected: Boolean
Whether this graph is connected if it is undirected or weakly connected if it is directed.
Whether this graph is connected if it is undirected or weakly connected if it is directed.
Definition Classes
GraphTraversal
final def isCustomEdgeFilter(f: CC.EdgePredicate): Boolean
true if f is not equivalent to anyEdge.
true if f is not equivalent to anyEdge.
Definition Classes
GraphBase
Annotations
@inline()
final def isCustomNodeFilter(f: CC.NodePredicate): Boolean
true if f is not equivalent to anyNode.
true if f is not equivalent to anyNode.
Definition Classes
GraphBase
Annotations
@inline()
final def isCyclic: Boolean
Whether this graph has at least one cycle in any of its components.
Whether this graph has at least one cycle in any of its components.
Definition Classes
GraphTraversal
Annotations
@inline()
def isDirected: Boolean
Whether all edges of this graph are directed.
Whether all edges of this graph are directed.
Definition Classes
GraphLike → GraphOps
final def isEmpty: Boolean
Whether this graph contains any node or any edge.
Whether this graph contains any node or any edge.
Definition Classes
GraphOps
Annotations
@inline()
def isHyper: Boolean
Whether this graph contains at least one hyperedge.
Whether this graph contains at least one hyperedge.
Definition Classes
GraphLike → GraphOps
final def isInstanceOf[T0]: Boolean
Definition Classes
Any
def isMixed: Boolean
Whether this graph contains at least one directed and one undirected edge.
Whether this graph contains at least one directed and one undirected edge.
Definition Classes
GraphLike → GraphOps
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
1. two or more directed edges having the same source and target
2. two or more undirected edges connecting the same nodes
3. two or more (directed) hyperedges that, after being decomposed into (directed) edges, yield any multy-edge as stipulated above.
Definition Classes
GraphLike → GraphOps
final def isTrivial: Boolean
true if this graph has at most 1 node.
true if this graph has at most 1 node.
Definition Classes
GraphOps
Annotations
@inline()
def iterator: Iterator[CC.InnerElem]
Iterator over all inner nodes and edges.
Iterator over all inner nodes and edges.
Definition Classes
GraphLike → GraphOps
final def map[NN, EC[X] <: Edge[X]](fNode: (CC.NodeT) => NN, fEdge: (CC.EdgeT, NN, NN) => EC[NN])(implicit w: <:<[E, AnyEdge[N]]): CC[NN, EC[NN]]
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
You can call this flavor only if this graph's edge type is generic. Otherwise see mapBound.
NN
The node type of the resulting graph which may be unchanged or different from this graph's node type.
EC
The higher kind of the generic edge type parameter of this graph.
fNode
To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.
fEdge
To apply to all edges of this graph. This function is passed the current inner edge and its ends after being mapped by fNode. Since the inner edge is passed you can also examine its context. Call outer to get the outer edge of type E.
returns
The mapped graph with possibly changed node and edge type parameters.
Definition Classes
GraphLike → GraphOps
final def map[NN, EC[X] <: Edge[X]](fNode: (CC.NodeT) => NN)(implicit w1: <:<[E, GenericMapper], w2: =:=[EC[N], E], t: ClassTag[EC[NN]]): CC[NN, EC[NN]]
Creates a new graph with nodes mapped by fNode and with an untouched edge structure otherwise.
Creates a new graph with nodes mapped by fNode and with an untouched edge structure otherwise.
You can call this flavor only if this graph's edge type is generic. Otherwise see mapBound.
If this graph also contains typed edges, the typed edge's partial map function will be called to replace the ends. If the partial function is not defined, there will be an attempt to fall back to a generic edge. If that attempt also fails the edge will be dropped. So, if you have a mixed graph with generic and typed edges, prefer mapping edges directly to avoid leaving edges out.
NN
The node type of the resulting graph which may be unchanged or different from this graph's node type.
EC
The higher kind of the generic edge type parameter of this graph.
fNode
To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.
returns
The mapped graph with possibly changed node and edge type parameters.
Definition Classes
GraphLike → GraphOps
final def map[NN, EC[X] <: Edge[X]](fNode: (CC.NodeT) => NN, fEdge: (NN, NN) => EC[NN])(implicit w: <:<[E, AnyEdge[N]]): CC[NN, EC[NN]]
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
See overload except the parameter
fEdge
has a simplified signature in this overload leaving out the inner edge. This comes in handy whenever you don't need to inspect inner edges.
Definition Classes
GraphOps
final def mapBound[NN, EC <: Edge[NN]](fNode: (CC.NodeT) => NN, fEdge: (CC.EdgeT, NN, NN) => EC)(implicit w: <:<[E, AnyEdge[N]]): CC[NN, EC]
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
You can call this flavor only if this graph's edge type is typed. Otherwise see map.
NN
The node type of the resulting graph which may be unchanged or different from this graph's node type.
EC
The edge type parameter of this graph.
fNode
To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.
fEdge
To apply to all edges of this graph. This function is passed the current inner edge and its ends after being mapped by fNode. Since the inner edge is passed you can also examine its context. Call outer to get the outer edge of type E.
returns
The mapped graph with possibly changed node and edge type parameters.
Definition Classes
GraphLike → GraphOps
final def mapBound(fNode: (CC.NodeT) => N)(implicit w1: <:<[E, PartialMapper]): CC[N, E]
Creates a new graph with nodes mapped by fNode and with an untouched edge structure otherwise.
Creates a new graph with nodes mapped by fNode and with an untouched edge structure otherwise.
You can call this flavor only if this graph's edge type is typed. Otherwise see map.
fNode
To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.
returns
The mapped graph with possibly changed node and edge type parameters.
Definition Classes
GraphLike → GraphOps
final def mapBound[NN, EC <: Edge[NN]](fNode: (CC.NodeT) => NN, fEdge: (NN, NN) => EC)(implicit w: <:<[E, AnyEdge[N]]): CC[NN, EC]
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
See overload except the parameter
fEdge
has a simplified signature in this overload leaving out the inner edge. This comes in handy whenever you don't need to inspect inner edges.
Definition Classes
GraphOps
def mapDiHyper[NN, EC[X] <: Edge[X]](fNode: (CC.NodeT) => NN, fDiHyperEdge: (CC.EdgeT, OneOrMore[NN], OneOrMore[NN]) => EC[NN], fEdge: Option[(CC.EdgeT, NN, NN) => EC[NN]])(implicit w: <:<[E, AnyDiHyperEdge[N]]): CC[NN, EC[NN]]
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
You can call this flavor only if this graph's edge type is generic. Otherwise see mapDiHyperBound.
NN
The node type of the resulting graph which may be unchanged or different from this graph's node type.
EC
The higher kind of the generic edge type parameter of this graph.
fNode
To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.
fDiHyperEdge
To apply to all directed hyperedges in this graph. This function is passed the existing inner directed hyperedge and its sources and targets after being mapped by fNode. Since the inner directed hyperedge is passed you can also examine the edge context. Call outer to get the outer directed hyperedge of type E.
fEdge
To apply to any directed or undirected edge in this possibly mixed graph. If not present simple edges will be mapped by the mandatory edge mapper you supply. You are recommended supplying Some unless you know that the graph does not contain any simple edge.
returns
The mapped graph with possibly changed node and edge type parameters.
Definition Classes
GraphLike → GraphOps
final def mapDiHyper[NN, EC[X] <: Edge[X]](fNode: (CC.NodeT) => NN, fDiHyperEdge: (OneOrMore[NN], OneOrMore[NN]) => EC[NN], fEdge: Option[(NN, NN) => EC[NN]] = None)(implicit w: <:<[E, AnyDiHyperEdge[N]]): CC[NN, EC[NN]]
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
You can call this flavor only if this graph's edge type is generic. Otherwise see mapDiHyperBound.
See overload except the parameter
fDiHyperEdge
has a simplified signature in this overload leaving out the inner edge. This comes in handy whenever you don't need to inspect inner edges.
Definition Classes
GraphOps
def mapDiHyperBound[NN, EC <: Edge[NN]](fNode: (CC.NodeT) => NN, fDiHyperEdge: (CC.EdgeT, OneOrMore[NN], OneOrMore[NN]) => EC, fEdge: Option[(CC.EdgeT, NN, NN) => EC])(implicit w: <:<[E, AnyDiHyperEdge[N]]): CC[NN, EC]
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
You can call this flavor only if this graph's edge type is typed. Otherwise see mapDiHyper.
NN
The node type of the resulting graph which may be unchanged or different from this graph's node type.
EC
The edge type parameter of this graph.
fNode
To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.
fDiHyperEdge
To apply to all directed hyperedges in this graph. This function is passed the existing inner directed hyperedge and its sources and targets after being mapped by fNode. Since the inner directed hyperedge is passed you can also examine the edge context. Call outer to get the outer directed hyperedge of type E.
fEdge
To apply to any directed or undirected edge in this possibly mixed graph. If not present simple edges will be mapped by the mandatory edge mapper you supply. You are recommended supplying Some unless you know that the graph does not contain any simple edge.
returns
The mapped graph with possibly changed node and edge type parameters.
Definition Classes
GraphLike → GraphOps
final def mapDiHyperBound[NN, EC <: Edge[NN]](fNode: (CC.NodeT) => NN, fDiHyperEdge: (OneOrMore[NN], OneOrMore[NN]) => EC, fEdge: Option[(NN, NN) => EC] = None)(implicit w: <:<[E, AnyDiHyperEdge[N]]): CC[NN, EC]
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
You can call this flavor only if this graph's edge type is typed. Otherwise see mapDiHyper.
See overload except the parameter
fDiHyperEdge
has a simplified signature in this overload leaving out the inner edge. This comes in handy whenever you don't need to inspect inner edges.
Definition Classes
GraphOps
final def mapHyper[NN, EC[X] <: Edge[X]](fNode: (CC.NodeT) => NN, fHyperEdge: (CC.EdgeT, Several[NN]) => EC[NN], fDiHyperEdge: Option[(CC.EdgeT, OneOrMore[NN], OneOrMore[NN]) => EC[NN]], fEdge: Option[(CC.EdgeT, NN, NN) => EC[NN]])(implicit w: <:<[E, AnyHyperEdge[N]]): CC[NN, EC[NN]]
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
You can call this flavor only if this graph's edge type is generic. Otherwise see mapHyperBound.
NN
The node type of the resulting graph which may be unchanged or different from this graph's node type.
EC
The higher kind of the generic edge type parameter of this graph.
fNode
To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.
fHyperEdge
To apply to all hyperedges in this graph. This function is passed the current inner hyperedge and its ends after being mapped by fNode. Since the inner hyperedge is passed you can also examine its context. Call outer to get the outer hyperedge of type E.
fDiHyperEdge
To apply to any directed hyperedge in this possibly mixed graph. If not present directed hyperedges will be mapped by the mandatory fDiHyperEdge. You are recommended supplying Some unless you know that the graph does not contain any directed hyperedge.
fEdge
To apply to any directed or undirected edge in this possibly mixed graph. If not present simple edges will be mapped by the mandatory edge mapper you supply. You are recommended supplying Some unless you know that the graph does not contain any simple edge.
returns
The mapped graph with possibly changed node and edge type parameters.
Definition Classes
GraphLike → GraphOps
final def mapHyper[NN, EC[X] <: Edge[X]](fNode: (CC.NodeT) => NN, fHyperEdge: (Several[NN]) => EC[NN], fDiHyperEdge: Option[(OneOrMore[NN], OneOrMore[NN]) => EC[NN]] = None, fEdge: Option[(NN, NN) => EC[NN]] = None)(implicit w: <:<[E, AnyHyperEdge[N]]): CC[NN, EC[NN]]
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
You can call this flavor only if this graph's edge type is generic. Otherwise see mapHyperBound.
See overload except the parameter
fHyperEdge
has a simplified signature in this overload leaving out the inner edge. This comes in handy whenever you don't need to inspect inner edges.
Definition Classes
GraphOps
final def mapHyperBound[NN, EC <: Edge[NN]](fNode: (CC.NodeT) => NN, fHyperEdge: (CC.EdgeT, Several[NN]) => EC, fDiHyperEdge: Option[(CC.EdgeT, OneOrMore[NN], OneOrMore[NN]) => EC], fEdge: Option[(CC.EdgeT, NN, NN) => EC])(implicit w: <:<[E, AnyHyperEdge[N]]): CC[NN, EC]
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
You can call this flavor only if this graph's edge type is typed. Otherwise see mapHyper.
NN
The node type of the resulting graph which may be unchanged or different from this graph's node type.
EC
The edge type parameter of this graph.
fNode
To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.
fHyperEdge
To apply to all hyperedges in this graph. This function is passed the current inner hyperedge and its ends after being mapped by fNode. Since the inner hyperedge is passed you can also examine its context. Call outer to get the outer hyperedge of type E.
fDiHyperEdge
To apply to any directed hyperedge in this possibly mixed graph. If not present directed hyperedges will be mapped by the mandatory fDiHyperEdge. You are recommended supplying Some unless you know that the graph does not contain any directed hyperedge.
fEdge
To apply to any directed or undirected edge in this possibly mixed graph. If not present simple edges will be mapped by the mandatory edge mapper you supply. You are recommended supplying Some unless you know that the graph does not contain any simple edge.
returns
The mapped graph with possibly changed node and edge type parameters.
Definition Classes
GraphLike → GraphOps
final def mapHyperBound[NN, EC <: Edge[NN]](fNode: (CC.NodeT) => NN, fHyperEdge: (Several[NN]) => EC, fDiHyperEdge: Option[(OneOrMore[NN], OneOrMore[NN]) => EC] = None, fEdge: Option[(NN, NN) => EC] = None)(implicit w: <:<[E, AnyHyperEdge[N]]): CC[NN, EC]
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
Creates a new graph with nodes and edges that are computed by the supplied mapping functions.
You can call this flavor only if this graph's edge type is typed. Otherwise see mapHyper.
See overload except the parameter
fHyperEdge
has a simplified signature in this overload leaving out the inner edge. This comes in handy whenever you don't need to inspect inner edges.
Definition Classes
GraphOps
def maxDegree(implicit nodeDegree: CC.DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): Int
The degree of the node having the highest degree or 0 if this graph is empty.
The degree of the node having the highest degree or 0 if this graph is empty.
Definition Classes
GraphDegree
def minDegree(implicit nodeDegree: CC.DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): Int
The degree of the node having the least degree or 0 if this graph is empty.
The degree of the node having the least degree or 0 if this graph is empty.
Definition Classes
GraphDegree
final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def newDiHyperEdge(outer: E, sources: OneOrMore[CC.NodeT], targets: OneOrMore[CC.NodeT]): CC.EdgeT
Attributes
protected
Definition Classes
GraphLike → GraphBase
def newEdge(outer: E, node_1: CC.NodeT, node_2: CC.NodeT): CC.EdgeT
Attributes
protected
Definition Classes
GraphLike → GraphBase
final def newHyperEdge(outer: E, nodes: Several[CC.NodeT]): CC.EdgeT
Attributes
protected
Definition Classes
GraphLike → GraphBase
final val noEdge: CC.EdgePredicate
Edge predicate always returning false.
Edge predicate always returning false.
Definition Classes
GraphBase → GraphOps
final val noNode: CC.NodePredicate
Node predicate always returning false.
Node predicate always returning false.
Definition Classes
GraphBase → GraphOps
final def nonTrivial: Boolean
true if this graph has at least 2 nodes.
true if this graph has at least 2 nodes.
Definition Classes
GraphOps
Annotations
@inline()
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final 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 → GraphOps
def outerIterator: Iterator[CC.OuterElem]
Iterator over all inner nodes and edges.
Iterator over all inner nodes and edges.
Definition Classes
GraphLike → GraphOps
def render(style: Style, nodeSeparator: String = GraphBase.defaultSeparator, edgeSeparator: String = GraphBase.defaultSeparator, nodeEdgeSetSeparator: String = GraphBase.defaultSeparator, withInnerPrefix: Boolean = true)(implicit ordNode: CC.NodeOrdering = defaultNodeOrdering, ordEdge: CC.EdgeOrdering = defaultEdgeOrdering): String
Sorts all nodes of this graph by ordNode followed by all edges sorted by ordEdge and concatenates their string representation nodeSeparator and edgeSeparator respectively.
Sorts all nodes of this graph by ordNode followed by all edges sorted by ordEdge and concatenates their string representation nodeSeparator and edgeSeparator respectively.
nodeEdgeSetSeparator
to separate the node set from the edge set.
withInnerPrefix
whether the node set and edge set should be prefixed.
ordNode
the node ordering defaulting to defaultNodeOrdering.
ordEdge
the edge ordering defaulting to defaultEdgeOrdering.
Definition Classes
ToString
final def size: Int
The size - commonly referred to as |E| - of this graph equaling to the number of edges.
The size - commonly referred to as |E| - of this graph equaling to the number of edges.
Definition Classes
GraphBase → GraphOps
final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
def toIterable: Iterable[CC.InnerElem]
Iterable over all nodes and edges.
Iterable over all nodes and edges.
Definition Classes
GraphLike → GraphOps
def toOuterIterable: Iterable[CC.OuterElem]
Iterable over all nodes and edges.
Iterable over all nodes and edges.
Definition Classes
GraphLike → GraphOps
def toString(): String
Sorts nodes and edges as long as this Graph has at most 100 elements.
Sorts nodes and edges as long as this Graph has at most 100 elements. See also def render.
Definition Classes
ToString → AnyRef → Any
final def topologicalSort[U](implicit visitor: (CC.InnerElem) => U = empty): CC.TopologicalSort
Sorts this graph topologically.
Sorts this graph topologically. Hooks are ignored.
visitor
called for each inner node or inner edge visited during the sort. See componentTraverser for more control by means of FluentProperties.
Definition Classes
GraphTraversal
final def topologicalSortByComponent[U](implicit visitor: (CC.InnerElem) => U = empty): Iterable[CC.TopologicalSort]
Sorts every isolated component of this graph topologically.
Sorts every isolated component of this graph topologically. Hooks are ignored.
visitor
called for each inner node or inner edge visited during the sort. See componentTraverser for more control by means of FluentProperties.
Definition Classes
GraphTraversal
def totalDegree(implicit nodeDegree: CC.DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): Int
The total degree of this graph equaling to the sum of the degrees over all nodes or 0 if this graph is empty.
The total degree of this graph equaling to the sum of the degrees over all nodes or 0 if this graph is empty.
nodeDegree
the degree function to apply to the nodes defaulting to Degree. Non-default predefined degree functions are InDegree and OutDegree.
degreeFilter
selects nodes to be included by their degree.
Definition Classes
GraphDegree
def totalWeight: Double
The Sum of the weight of all edges.
The Sum of the weight of all edges.
Definition Classes
GraphBase → GraphOps
final def union[N2 >: N, E2 >: E <: Edge[N2]](that: AnyGraph[N2, E2]): CC[N2, E2]
Computes the union between this graph and that graph.
Computes the union between this graph and that graph.
Definition Classes
GraphOps
Annotations
@inline()
final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException]) @native()
final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def |(that: AnyGraph[N, E]): CC[N, E]
Alias for union.
Alias for union.
Definition Classes
GraphOps
Annotations
@inline()
object InnerDiEdge
Annotations
@transient()
object InnerDiHyperEdge
Annotations
@transient()
object InnerHyperEdge
Annotations
@transient()
object InnerOrderedDiHyperEdge
Annotations
@transient()
object InnerOrderedHyperEdge
Annotations
@transient()
object InnerUnDiEdge
Annotations
@transient()
object InnerEdge
Definition Classes
GraphOps
object InnerNode
Definition Classes
GraphOps
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

Deprecated Value Members

def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.Throwable]) @Deprecated
Deprecated
def formatted(fmtstr: String): String
Implicit
This member is added by an implicit conversion from GraphLike[N, E, CC] toStringFormat[GraphLike[N, E, CC]] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@deprecated @inline()
Deprecated
(Since version 2.12.16) Use formatString.format(value) instead of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.
def →[B](y: B): (GraphLike[N, E, CC], B)
Implicit
This member is added by an implicit conversion from GraphLike[N, E, CC] toArrowAssoc[GraphLike[N, E, CC]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Packages

GraphLike

trait GraphLike[N, E <: Edge[N], +CC[X, Y <: Edge[X]] <: GraphLike[X, Y, CC] with AnyGraph[X, Y]] extends GraphBase[N, E, [X, Y]CC[X, Y]] with GraphTraversal[N, E] with GraphDegree[N, E, [X, Y]CC[X, Y]] with ToString[N, E, [X, Y]CC[X, Y]]

Type Members

Abstract Value Members

Concrete Value Members

Deprecated Value Members

Inherited from ToString[N, E, CC]

Inherited from GraphDegree[N, E, CC]

Inherited from GraphTraversal[N, E]

Inherited from GraphBase[N, E, [X, Y]CC[X, Y]]

Inherited from Serializable

Inherited from GraphOps[N, E, [X, Y]CC[X, Y]]

Inherited from OuterElems[N, E]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd fromGraphLike[N, E, CC] to any2stringadd[GraphLike[N, E, CC]]

Inherited by implicit conversion StringFormat fromGraphLike[N, E, CC] to StringFormat[GraphLike[N, E, CC]]

Inherited by implicit conversion Ensuring fromGraphLike[N, E, CC] to Ensuring[GraphLike[N, E, CC]]

Inherited by implicit conversion ArrowAssoc fromGraphLike[N, E, CC] to ArrowAssoc[GraphLike[N, E, CC]]

Ungrouped

Packages

GraphLike

trait GraphLike[N, E <: Edge[N], +CC[X, Y <: Edge[X]] <: GraphLike[X, Y, CC] with AnyGraph[X, Y]] extends GraphBase[N, E, [X, Y]CC[X, Y]] with GraphTraversal[N, E] with GraphDegree[N, E, [X, Y]CC[X, Y]] with ToString[N, E, [X, Y]CC[X, Y]]

Type Members

Abstract Value Members

Concrete Value Members

Deprecated Value Members

Inherited from ToString[N, E, CC]

Inherited from GraphDegree[N, E, CC]

Inherited from GraphTraversal[N, E]

Inherited from GraphBase[N, E, [X, Y]CC[X, Y]]

Inherited from Serializable

Inherited from GraphOps[N, E, [X, Y]CC[X, Y]]

Inherited from OuterElems[N, E]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd fromGraphLike[N, E, CC] to any2stringadd[GraphLike[N, E, CC]]

Inherited by implicit conversion StringFormat fromGraphLike[N, E, CC] to StringFormat[GraphLike[N, E, CC]]

Inherited by implicit conversion Ensuring fromGraphLike[N, E, CC] to Ensuring[GraphLike[N, E, CC]]

Inherited by implicit conversion ArrowAssoc fromGraphLike[N, E, CC] to ArrowAssoc[GraphLike[N, E, CC]]

Ungrouped

GraphLike