Packages

t

scalax.collection.mutable

AdjacencyListGraph

trait AdjacencyListGraph[N, E <: Edge[N], +CC[X, Y <: Edge[X]] <: AdjacencyListGraph[X, Y, CC] with Graph[X, Y]] extends GraphLike[N, E, CC] with AdjacencyListBase[N, E, CC]

Implements an incident list based mutable graph representation.

Self Type
CC[N, E]
Linear Supertypes
AdjacencyListBase[N, E, CC], GraphLike[N, E, CC], GraphOps[N, E, CC], Cloneable[CC[N, E]], Cloneable, AbstractBuilder[N, E], Shrinkable[N, E], Growable[N, E], collection.GraphLike[N, E, CC], ToString[N, E, CC], GraphDegree[N, E, CC], GraphTraversal[N, E], GraphBase[N, E, [X, Y]CC[X, Y]], Serializable, collection.GraphOps[N, E, [X, Y]CC[X, Y]], OuterElems[N, E], AnyRef, Any
Known Subclasses
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AdjacencyListGraph
  2. AdjacencyListBase
  3. GraphLike
  4. GraphOps
  5. Cloneable
  6. Cloneable
  7. AbstractBuilder
  8. Shrinkable
  9. Growable
  10. GraphLike
  11. ToString
  12. GraphDegree
  13. GraphTraversal
  14. GraphBase
  15. Serializable
  16. GraphOps
  17. OuterElems
  18. AnyRef
  19. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. trait BaseInnerEdge extends InnerEdgeLike[NodeT] with InnerEdge with Equals
    Definition Classes
    GraphBase
  2. trait BaseInnerNode extends Node with InnerNode
    Definition Classes
    GraphBase
  3. abstract class BaseNodeBase extends BaseInnerNode
    Attributes
    protected
    Definition Classes
    GraphBase
  4. 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
  5. trait EdgeSet extends AnySet[EdgeT] with ExtSetMethods[EdgeT] with Serializable
    Definition Classes
    GraphBase
  6. sealed trait ElemOrdering extends AnyRef

    Base trait for graph Orderings.

    Base trait for graph Orderings.

    Attributes
    protected
    Definition Classes
    GraphBase
  7. trait Node extends Serializable
    Definition Classes
    GraphBase
  8. 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
  9. trait NodeSet extends AnySet[NodeT] with ExtSetMethods[NodeT]
    Definition Classes
    GraphBase
  10. trait DegreeFunction extends ((GraphDegree.this)#NodeT) => Int
    Definition Classes
    GraphDegree
  11. 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
  12. trait Filter[T] extends (T) => Boolean
    Definition Classes
    GraphDegree
  13. trait GraphEdgeSet extends CC.EdgeSet with CC.EdgeSetToString
    Definition Classes
    GraphLike
  14. trait GraphInnerEdge extends CC.BaseInnerEdge
    Definition Classes
    GraphLike
  15. trait GraphInnerNode extends CC.BaseInnerNode with CC.TraverserInnerNode
    Definition Classes
    GraphLike
  16. trait GraphNodeSet extends CC.NodeSet with CC.NodeSetToString
    Definition Classes
    GraphLike
  17. class InnerDiEdge extends DiEdge[CC.NodeT] with CC.EdgeT
    Definition Classes
    GraphLike
    Annotations
    @SerialVersionUID()
  18. class InnerDiHyperEdge extends DiHyperEdge[CC.NodeT] with CC.EdgeT
    Definition Classes
    GraphLike
    Annotations
    @SerialVersionUID()
  19. class InnerHyperEdge extends HyperEdge[CC.NodeT] with CC.EdgeT
    Definition Classes
    GraphLike
    Annotations
    @SerialVersionUID()
  20. class InnerOrderedDiHyperEdge extends OrderedDiHyperEdge[CC.NodeT] with CC.EdgeT
    Definition Classes
    GraphLike
    Annotations
    @SerialVersionUID()
  21. class InnerOrderedHyperEdge extends OrderedHyperEdge[CC.NodeT] with CC.EdgeT
    Definition Classes
    GraphLike
    Annotations
    @SerialVersionUID()
  22. class InnerUnDiEdge extends UnDiEdge[CC.NodeT] with CC.EdgeT
    Definition Classes
    GraphLike
    Annotations
    @SerialVersionUID()
  23. trait NodeBase extends CC.BaseNodeBase with CC.GraphInnerNode
    Attributes
    protected
    Definition Classes
    GraphLike
  24. trait InnerEdge extends InnerElem
    Definition Classes
    GraphOps
  25. sealed trait InnerElem extends AnyRef
    Definition Classes
    GraphOps
  26. trait InnerNode extends InnerElem
    Definition Classes
    GraphOps
  27. 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
  28. 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
  29. 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
  30. 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
  31. 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
  32. 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
  33. 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
  34. 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
  35. 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
  36. 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
  37. 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
  38. 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
  39. 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
  40. 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
  41. 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
  42. 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
  43. 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
  44. 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
  45. trait Properties extends SubgraphProperties

    Properties controlling traversals.

    Properties controlling traversals.

    Attributes
    protected
    Definition Classes
    GraphTraversal
  46. 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
  47. trait SubgraphProperties extends AnyRef

    Properties controlling the scope of traversals.

    Properties controlling the scope of traversals.

    Attributes
    protected
    Definition Classes
    GraphTraversal
  48. 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
  49. 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
  50. 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
  51. trait TraverserInnerNode extends BaseInnerNode
    Definition Classes
    GraphTraversal
  52. 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
  53. 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
  54. 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
  55. 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
  56. 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
  57. trait OuterElem extends AnyRef
    Definition Classes
    OuterElems
  58. 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
  59. trait EdgeSetToString extends GraphLike.SetToString[EdgeT]
    Attributes
    protected
    Definition Classes
    ToString
  60. trait NodeSetToString extends GraphLike.SetToString[NodeT]
    Attributes
    protected
    Definition Classes
    ToString
  61. trait SetToString[A] extends AnySet[A]
    Attributes
    protected
    Definition Classes
    ToString
  62. trait AdjacencyListBaseEdgeSet extends (AdjacencyListBase.this)#GraphEdgeSet
    Definition Classes
    AdjacencyListBase
  63. trait AdjacencyListBaseNodeSet extends (AdjacencyListBase.this)#GraphNodeSet
    Definition Classes
    AdjacencyListBase
  64. trait AdjacendyListBaseInnerNode extends (AdjacencyListBase.this)#GraphInnerNode
    Definition Classes
    AdjacencyListBase
  65. class AdjacencyListEdgeSet extends CC.GraphLikeEdgeSet with CC.AdjacencyListBaseEdgeSet
  66. class AdjacencyListNodeSet extends CC.GraphLikeNodeSet with CC.AdjacencyListBaseNodeSet
  67. 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
  68. type EdgePredicate = (CC.EdgeT) => Boolean
    Definition Classes
    GraphOps
  69. type EdgeSetT = CC.AdjacencyListEdgeSet
  70. type EdgeT = CC.GraphInnerEdge
    Definition Classes
    GraphLikeGraphBaseGraphOps
  71. abstract class InnerNodeImpl extends CC.BaseNodeBase with CC.NodeBase with CC.GraphLikeInnerNode with CC.AdjacendyListBaseInnerNode
  72. 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
  73. type NodePredicate = (CC.NodeT) => Boolean
    Definition Classes
    GraphOps
  74. type NodeSetT = CC.AdjacencyListNodeSet
  75. abstract type NodeT <: CC.InnerNodeImpl
  76. type ThisGraph = AdjacencyListGraph.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
  77. type TopologicalSort = Either[CC.TopologicalSortFailure, CC.TopologicalOrder[CC.NodeT]]
    Definition Classes
    GraphTraversal
  78. trait GraphLikeEdgeSet extends MSet[CC.EdgeT] with CC.GraphEdgeSet
    Definition Classes
    GraphLike
  79. trait GraphLikeInnerNode extends CC.GraphInnerNode
    Definition Classes
    GraphLike
  80. trait GraphLikeNodeSet extends MSet[CC.NodeT] with CC.GraphNodeSet
    Definition Classes
    GraphLike

Abstract Value Members

  1. abstract val companion: Factory[[X, Y]CC[X, Y]]

    The companion object of CC.

    The companion object of CC.

    Definition Classes
    GraphLike
  2. 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
  3. implicit abstract def config: GraphConfig with AdjacencyListArrayConfig
    Definition Classes
    AdjacencyListBaseGraphLike
  4. 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
    AdjacencyListGraphGraphLikeGraphBase
  5. abstract def empty: CC[N, E]
    Definition Classes
    GraphLike
  6. 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
  7. 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
  8. 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
  9. 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
  10. abstract def newBuilder: Builder[N, E, [X, Y]CC[X, Y]]
    Attributes
    protected[this]
    Definition Classes
    GraphLike
  11. abstract def newNodeSet: CC.NodeSetT
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  12. abstract def newNodeWithHints(node: N, hints: Hints): CC.NodeT
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  13. 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
  14. 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
  15. 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
    AdjacencyListGraphGraphBase
  16. 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
  17. 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
  18. 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
  19. 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
  20. 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.

    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

  1. object BaseInnerEdge
    Definition Classes
    GraphBase
    Annotations
    @transient()
  2. object EdgeOrdering extends Serializable

    Ordering for the path dependent type EdgeT.

    Ordering for the path dependent type EdgeT.

    Definition Classes
    GraphBase
  3. object NoOrdering extends ElemOrdering with Serializable

    The empty ElemOrdering.

    The empty ElemOrdering.

    Definition Classes
    GraphBase
  4. object Node extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  5. object NodeOrdering extends Serializable
    Definition Classes
    GraphBase
  6. object Degree extends (GraphDegree.this)#DegreeFunction
    Definition Classes
    GraphDegree
  7. object DegreeOrdering extends Serializable
    Definition Classes
    GraphDegree
  8. object InDegree extends (GraphDegree.this)#DegreeFunction
    Definition Classes
    GraphDegree
  9. object IntReverseOrdering extends Ordering[Int]

    Decreasing ordering of integers.

    Decreasing ordering of integers.

    Definition Classes
    GraphDegree
  10. object OutDegree extends (GraphDegree.this)#DegreeFunction
    Definition Classes
    GraphDegree
  11. object InnerDiEdge
    Definition Classes
    GraphLike
    Annotations
    @transient()
  12. object InnerDiHyperEdge
    Definition Classes
    GraphLike
    Annotations
    @transient()
  13. object InnerHyperEdge
    Definition Classes
    GraphLike
    Annotations
    @transient()
  14. object InnerOrderedDiHyperEdge
    Definition Classes
    GraphLike
    Annotations
    @transient()
  15. object InnerOrderedHyperEdge
    Definition Classes
    GraphLike
    Annotations
    @transient()
  16. object InnerUnDiEdge
    Definition Classes
    GraphLike
    Annotations
    @transient()
  17. object InnerEdge
    Definition Classes
    GraphOps
  18. object InnerNode
    Definition Classes
    GraphOps
  19. object Cycle
    Definition Classes
    GraphTraversal
  20. object ExtendedNodeVisitor
    Definition Classes
    GraphTraversal
  21. object Informer
    Definition Classes
    GraphTraversal
  22. object Path extends Serializable
    Definition Classes
    GraphTraversal
  23. object SubgraphProperties
    Attributes
    protected
    Definition Classes
    GraphTraversal
  24. object TraverserInnerNode extends Serializable
    Definition Classes
    GraphTraversal
    Annotations
    @transient()
  25. object Walk
    Definition Classes
    GraphTraversal
  26. object Weight
    Definition Classes
    GraphTraversal
  27. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  28. final def ##: Int
    Definition Classes
    AnyRef → Any
  29. final def &(that: AnyGraph[N, E]): CC[N, E]

    Alias for intersect.

    Alias for intersect.

    Definition Classes
    GraphOps
    Annotations
    @inline()
  30. final def &=(that: AnyGraph[N, E]): AdjacencyListGraph.this.type

    Alias for intersectInPlace.

    Alias for intersectInPlace.

    Definition Classes
    GraphOps
    Annotations
    @inline()
  31. final def &~(that: AnyGraph[N, E]): CC[N, E]

    Alias for diff.

    Alias for diff.

    Definition Classes
    GraphOps
    Annotations
    @inline()
  32. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, CC] toany2stringadd[AdjacencyListGraph[N, E, CC]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  33. 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()
  34. 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()
  35. def ++=(nodes: Iterable[N] = Nil, edges: Iterable[E] = Nil): AdjacencyListGraph.this.type

    Adds all passed nodes and edges to this graph.

    Adds all passed nodes and edges to this graph. For a mutable Graph see also unionInPlace.

    Definition Classes
    Growable
  36. def ++=(xs: Iterable[collection.OuterElem[N, E]]): AdjacencyListGraph.this.type

    Alias for addAll(xs).

    Alias for addAll(xs).

    Definition Classes
    Growable
  37. final def +=(edge: E): AdjacencyListGraph.this.type

    Alias for addOne(edge).

    Alias for addOne(edge).

    Definition Classes
    Growable
    Annotations
    @inline()
  38. final def +=(node: N): AdjacencyListGraph.this.type

    Alias for addOne(node).

    Alias for addOne(node).

    Definition Classes
    Growable
    Annotations
    @inline()
  39. final def --=(that: AnyGraph[N, E]): AdjacencyListGraph.this.type

    Alias for diffInPlace.

    Alias for diffInPlace.

    Definition Classes
    Shrinkable
    Annotations
    @inline()
  40. final def --=(edges: IterableOnce[E]): AdjacencyListGraph.this.type

    Alias for removeAll(edges).

    Alias for removeAll(edges).

    Definition Classes
    Shrinkable
    Annotations
    @inline()
  41. final def --=(nodes: IterableOnce[N], edges: IterableOnce[E]): AdjacencyListGraph.this.type

    Alias for removeAll(nodes, edges).

    Alias for removeAll(nodes, edges).

    Definition Classes
    Shrinkable
    Annotations
    @inline()
  42. final def -=(edge: E): AdjacencyListGraph.this.type

    Alias for subtractOne(node).

    Alias for subtractOne(node).

    Definition Classes
    Shrinkable
    Annotations
    @inline()
  43. final def -=(node: N): AdjacencyListGraph.this.type

    Alias for subtractOne(node).

    Alias for subtractOne(node).

    Definition Classes
    Shrinkable
    Annotations
    @inline()
  44. def ->[B](y: B): (AdjacencyListGraph[N, E, CC], B)
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, CC] toArrowAssoc[AdjacencyListGraph[N, E, CC]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  45. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  46. final def add(edge: E): Boolean

    Adds a single edge to this graph.

    Adds a single edge to this graph.

    returns

    true if this graph has not contained edge before.

    Definition Classes
    AdjacencyListGraphGraphOpsGrowable
    Annotations
    @inline()
  47. final def add(node: N): Boolean

    Adds a single node to this graph.

    Adds a single node to this graph.

    returns

    true if this graph has not contained node before.

    Definition Classes
    AdjacencyListGraphGraphOpsGrowable
    Annotations
    @inline()
  48. def addAll(xs: Iterable[collection.OuterElem[N, E]]): AdjacencyListGraph.this.type

    Adds all elements produced by outer to this graph.

    Adds all elements produced by outer to this graph. For a graph see also unionInPlace.

    Definition Classes
    Growable
  49. final def addAndGet(edge: E): CC.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()
  50. final def addAndGet(node: N): CC.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()
  51. def addOne(edge: E): AdjacencyListGraph.this.type

    Adds a single node to this graph.

    Adds a single node to this graph.

    Definition Classes
    Growable
  52. def addOne(node: N): AdjacencyListGraph.this.type

    Adds a single node to this graph.

    Adds a single node to this graph.

    Definition Classes
    Growable
  53. final def addOuter(elem: collection.OuterElem[N, E]): AdjacencyListGraph.this.type

    Adds a single outer element to this graph.

    Adds a single outer element to this graph.

    Attributes
    protected[collection]
    Definition Classes
    Growable
  54. 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
    GraphBaseGraphOps
  55. 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()
  56. 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
    GraphBaseGraphOps
  57. final lazy val anyOrdering: AnyOrdering[N]
    Attributes
    protected
    Definition Classes
    GraphBase
  58. 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()
  59. 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()
  60. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  61. final def bulkOp[N2 >: N, E2 >: E <: Edge[N2]](nodes: IterableOnce[N2], edges: IterableOnce[E2], op: (IterableOnce[N2], IterableOnce[E2]) => CC[N2, E2]): CC[N2, E2]
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  62. def className: String
    Attributes
    protected
    Definition Classes
    ToString
  63. final def clear(): Unit
    Definition Classes
    AdjacencyListGraphAbstractBuilder
    Annotations
    @inline()
  64. def clone(): CC[N, E]
    Definition Classes
    GraphLike → Cloneable → AnyRef
  65. final 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
    AdjacencyListBaseGraphOps
  66. 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
  67. 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
    GraphLikeGraphOps
  68. 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
    GraphLikeGraphOps
  69. final lazy val defaultEdgeOrdering: CC.EdgeOrdering
    Definition Classes
    GraphBase
  70. final lazy val defaultNodeOrdering: CC.NodeOrdering
    Definition Classes
    GraphBase
  71. final def defaultPathSize: Int
    Attributes
    protected
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  72. 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
  73. 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
  74. 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
  75. 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
  76. 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
  77. 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
  78. final def diffInPlace(that: AnyGraph[N, E]): AdjacencyListGraph.this.type

    Removes all nodes and edges contained in that graph from this graph.

    Removes all nodes and edges contained in that graph from this graph.

    Definition Classes
    Shrinkable
  79. def edgeIterator: Iterator[CC.EdgeT]
    Definition Classes
    AdjacencyListBase
  80. final def elementCount: Int

    The number of nodes and edges.

    The number of nodes and edges.

    Definition Classes
    GraphOps
    Annotations
    @inline()
  81. def ensuring(cond: (AdjacencyListGraph[N, E, CC]) => Boolean, msg: => Any): AdjacencyListGraph[N, E, CC]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, CC] toEnsuring[AdjacencyListGraph[N, E, CC]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  82. def ensuring(cond: (AdjacencyListGraph[N, E, CC]) => Boolean): AdjacencyListGraph[N, E, CC]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, CC] toEnsuring[AdjacencyListGraph[N, E, CC]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  83. def ensuring(cond: Boolean, msg: => Any): AdjacencyListGraph[N, E, CC]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, CC] toEnsuring[AdjacencyListGraph[N, E, CC]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  84. def ensuring(cond: Boolean): AdjacencyListGraph[N, E, CC]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, CC] toEnsuring[AdjacencyListGraph[N, E, CC]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  85. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  86. 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
  87. 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
    GraphLikeGraphOps
  88. def filterInPlace(fNode: CC.NodePredicate = anyNode, fEdge: CC.EdgePredicate = anyEdge): AdjacencyListGraph.this.type

    Computes a new graph with nodes satisfying fNode and edges satisfying fEdge.

    Computes a new graph with nodes satisfying fNode and edges satisfying fEdge. If both fNode and fEdge have default values the original graph is retained.

    Definition Classes
    GraphLikeGraphOps
  89. 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
  90. 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
    GraphLikeGraphOps
    Annotations
    @inline()
  91. 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
    GraphLikeGraphOps
    Annotations
    @inline()
  92. 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
  93. 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
  94. 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
    GraphLikeGraphOps
  95. 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
    GraphLikeGraphOps
  96. 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
  97. 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
    GraphLikeGraphOps
  98. 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
    GraphLikeGraphOps
  99. 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
  100. 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
    GraphLikeGraphOps
  101. 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
  102. 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
    GraphLikeGraphOps
  103. 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
  104. 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
    GraphLikeGraphOps
  105. 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
  106. 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
    GraphLikeGraphOps
  107. 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
  108. 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
    GraphLikeGraphOps
  109. 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
  110. final def get(edge: E): CC.EdgeT

    Short for find(edge).get.

    Short for find(edge).get.

    Definition Classes
    GraphLikeGraphOps
    Annotations
    @inline()
    Exceptions thrown

    NoSuchElementException if the edge is not found.

  111. final def get(node: N): CC.NodeT

    Short for find(node).get.

    Short for find(node).get.

    Definition Classes
    GraphLikeGraphOps
    Annotations
    @inline()
    Exceptions thrown

    NoSuchElementException if the node is not found.

  112. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  113. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  114. 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
  115. def initializeFrom(in: ObjectInputStream, nodes: CC.NodeSetT, edges: CC.EdgeSetT): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  116. 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
  117. final def intersectInPlace(that: AnyGraph[N, E]): AdjacencyListGraph.this.type

    Shrinks this graph to its intersection with that graph.

    Shrinks this graph to its intersection with that graph.

    Definition Classes
    GraphOps
  118. final def isAcyclic: Boolean

    Whether this graph has no cycle.

    Whether this graph has no cycle.

    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  119. 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
  120. 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
  121. 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()
  122. 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()
  123. 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()
  124. def isDirected: Boolean

    Whether all edges of this graph are directed.

    Whether all edges of this graph are directed.

    Definition Classes
    GraphLikeGraphOps
  125. 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()
  126. def isHyper: Boolean

    Whether this graph contains at least one hyperedge.

    Whether this graph contains at least one hyperedge.

    Definition Classes
    GraphLikeGraphOps
  127. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  128. 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
    GraphLikeGraphOps
  129. 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
    GraphLikeGraphOps
  130. 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()
  131. def iterator: Iterator[CC.InnerElem]

    Iterator over all inner nodes and edges.

    Iterator over all inner nodes and edges.

    Definition Classes
    GraphLikeGraphOps
  132. 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
    GraphLikeGraphOps
  133. 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
    GraphLikeGraphOps
  134. 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
  135. 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
    GraphLikeGraphOps
  136. 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
    GraphLikeGraphOps
  137. 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
  138. 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
    GraphLikeGraphOps
  139. 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
  140. 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
    GraphLikeGraphOps
  141. 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
  142. 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
    GraphLikeGraphOps
  143. 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
  144. 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
    GraphLikeGraphOps
  145. 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
  146. 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
  147. 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
  148. final def minusMinus(delNodes: IterableOnce[N], delEdges: IterableOnce[E]): CC[N, E]

    Implements the heart of -- calling the from factory method of the companion object.

    Implements the heart of -- calling the from factory method of the companion object. Note that this method must be reimplemented in each module having its own factory methods such as constrained does.

    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  149. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  150. def newDiHyperEdge(outer: E, sources: OneOrMore[CC.NodeT], targets: OneOrMore[CC.NodeT]): CC.EdgeT
    Attributes
    protected
    Definition Classes
    GraphLikeGraphBase
  151. def newEdge(outer: E, node_1: CC.NodeT, node_2: CC.NodeT): CC.EdgeT
    Attributes
    protected
    Definition Classes
    GraphLikeGraphBase
  152. final def newEdgeTArray(size: Int): Array[CC.EdgeT]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraphAdjacencyListBase
    Annotations
    @inline()
  153. final def newHyperEdge(outer: E, nodes: Several[CC.NodeT]): CC.EdgeT
    Attributes
    protected
    Definition Classes
    GraphLikeGraphBase
  154. final def newNode(n: N): CC.NodeT
    Attributes
    protected
    Definition Classes
    AdjacencyListBaseGraphBase
    Annotations
    @inline()
  155. final val noEdge: CC.EdgePredicate

    Edge predicate always returning false.

    Edge predicate always returning false.

    Definition Classes
    GraphBaseGraphOps
  156. final val noNode: CC.NodePredicate

    Node predicate always returning false.

    Node predicate always returning false.

    Definition Classes
    GraphBaseGraphOps
  157. 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()
  158. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  159. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  160. 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
    GraphBaseGraphOps
  161. def outerIterator: Iterator[CC.OuterElem]

    Iterator over all inner nodes and edges.

    Iterator over all inner nodes and edges.

    Definition Classes
    GraphLikeGraphOps
  162. final def plusPlus[N2 >: N, E2 >: E <: Edge[N2]](newNodes: IterableOnce[N2], newEdges: IterableOnce[E2]): CC[N2, E2]

    Implements the heart of ++ calling the from factory method of the companion object.

    Implements the heart of ++ calling the from factory method of the companion object. Note that this method must be reimplemented in each module having its own factory methods such as constrained does.

    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  163. final def remaining(nodesToDelete: Set[N], edgesToDelete: IterableOnce[E]): (Set[N], Set[E])

    Calculates the remaining nodes and edges of this graph after subtracting the passed elements.

    Calculates the remaining nodes and edges of this graph after subtracting the passed elements.

    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  164. final def remove(edge: E): Boolean

    Removes a single edge from this graph.

    Removes a single edge from this graph.

    returns

    whether the edge existed before

    Definition Classes
    GraphLikeShrinkable
    Annotations
    @inline()
  165. final def remove(node: N): Boolean

    Removes a single node from this graph.

    Removes a single node from this graph.

    returns

    whether the node existed before.

    Definition Classes
    GraphLikeShrinkable
    Annotations
    @inline()
  166. final def removeAll(edges: IterableOnce[E]): AdjacencyListGraph.this.type

    Removes all edges from this graph.

    Removes all edges from this graph.

    Definition Classes
    Shrinkable
  167. final def removeAll(nodes: IterableOnce[N], edges: IterableOnce[E]): AdjacencyListGraph.this.type

    Removes all nodes and edges from this graph.

    Removes all nodes and edges from this graph.

    Definition Classes
    Shrinkable
  168. def removedAll(isolatedNodes: IterableOnce[N], edges: IterableOnce[E]): CC[N, E]
    Definition Classes
    AdjacencyListBaseGraphOps
  169. 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
  170. final def serializeTo(out: ObjectOutputStream): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  171. 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
    GraphBaseGraphOps
  172. final def subtractOne(edge: E): AdjacencyListGraph.this.type

    Removes a single edge from this graph.

    Removes a single edge from this graph.

    Definition Classes
    GraphLikeShrinkable
    Annotations
    @inline()
  173. final def subtractOne(node: N): AdjacencyListGraph.this.type

    Removes a single node from this graph.

    Removes a single node from this graph.

    Definition Classes
    GraphLikeShrinkable
    Annotations
    @inline()
  174. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  175. def toIterable: Iterable[CC.InnerElem]

    Iterable over all nodes and edges.

    Iterable over all nodes and edges.

    Definition Classes
    GraphLikeGraphOps
  176. def toOuterIterable: Iterable[CC.OuterElem]

    Iterable over all nodes and edges.

    Iterable over all nodes and edges.

    Definition Classes
    GraphLikeGraphOps
  177. 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
  178. 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
  179. 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
  180. 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
  181. def totalWeight: Double

    The Sum of the weight of all edges.

    The Sum of the weight of all edges.

    Definition Classes
    GraphBaseGraphOps
  182. 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()
  183. final def unionInPlace(that: AnyGraph[N, E]): AdjacencyListGraph.this.type

    Adds all elements in other to this Growable.

    Adds all elements in other to this Growable.

    Definition Classes
    GraphOps
  184. final def upsert(edge: E): Boolean

    If an inner edge equaling to edge is present in this graph, it is replaced by edge, otherwise edge will be inserted.

    If an inner edge equaling to edge is present in this graph, it is replaced by edge, otherwise edge will be inserted. This is useful if non-key parts of an immutable edge are to be modified.

    returns

    true if edge has been inserted, false if it has been replaced.

    Definition Classes
    AdjacencyListGraphAbstractBuilder
    Annotations
    @inline()
  185. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  186. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  187. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  188. final def |(that: AnyGraph[N, E]): CC[N, E]

    Alias for union.

    Alias for union.

    Definition Classes
    GraphOps
    Annotations
    @inline()
  189. final def |=(that: AnyGraph[N, E]): AdjacencyListGraph.this.type

    Alias for unionInPlace.

    Alias for unionInPlace.

    Definition Classes
    GraphOps
    Annotations
    @inline()

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  2. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, CC] toStringFormat[AdjacencyListGraph[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.

  3. def [B](y: B): (AdjacencyListGraph[N, E, CC], B)
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, CC] toArrowAssoc[AdjacencyListGraph[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.

Inherited from AdjacencyListBase[N, E, CC]

Inherited from GraphLike[N, E, CC]

Inherited from GraphOps[N, E, CC]

Inherited from Cloneable[CC[N, E]]

Inherited from Cloneable

Inherited from AbstractBuilder[N, E]

Inherited from Shrinkable[N, E]

Inherited from Growable[N, E]

Inherited from collection.GraphLike[N, E, CC]

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 collection.GraphOps[N, E, [X, Y]CC[X, Y]]

Inherited from OuterElems[N, E]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd fromAdjacencyListGraph[N, E, CC] to any2stringadd[AdjacencyListGraph[N, E, CC]]

Inherited by implicit conversion StringFormat fromAdjacencyListGraph[N, E, CC] to StringFormat[AdjacencyListGraph[N, E, CC]]

Inherited by implicit conversion Ensuring fromAdjacencyListGraph[N, E, CC] to Ensuring[AdjacencyListGraph[N, E, CC]]

Inherited by implicit conversion ArrowAssoc fromAdjacencyListGraph[N, E, CC] to ArrowAssoc[AdjacencyListGraph[N, E, CC]]

Ungrouped