InnerNode

abstract def diSuccessors: Set[(AdjacencyListBase.this)#NodeT]

All direct successors of this node, also called successor set or open out-neighborhood: target nodes of directed incident edges and / or adjacent nodes of undirected incident edges excluding this node.

abstract def edges: ArraySet[(AdjacencyListBase.this)#EdgeT]

All edges at this node - commonly denoted as E(v).

abstract def isContaining[N, E[X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean

abstract def value: N

The outer node as supplied by the user at instantiation time or by adding nodes this graph.

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

final def +=(edge: (AdjacencyListBase.this)#EdgeT): InnerNode.this.type

def ->[B](y: B): ((AdjacencyListBase.this)#InnerNode, B)

final def <~(from: (AdjacencyListBase.this)#NodeT): Set[(AdjacencyListBase.this)#EdgeT] with FilterableSet[(AdjacencyListBase.this)#EdgeT]

Synonym for incomingFrom.

final def <~: Set[(AdjacencyListBase.this)#EdgeT] with FilterableSet[(AdjacencyListBase.this)#EdgeT]

Synonym for incoming.

final def <~?(from: (AdjacencyListBase.this)#NodeT): Option[(AdjacencyListBase.this)#EdgeT]

Synonym for findIncomingFrom.

final def <~|: Set[(AdjacencyListBase.this)#NodeT]

Synonym for diPredecessors.

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

object Adj extends Serializable

final def addDiPredecessors(edge: (AdjacencyListBase.this)#EdgeT, add: ((AdjacencyListBase.this)#NodeT) ⇒ Unit): Unit

final def addDiSuccessors(edge: (AdjacencyListBase.this)#EdgeT, add: ((AdjacencyListBase.this)#NodeT) ⇒ Unit): Unit

final def addNeighbors(edge: (AdjacencyListBase.this)#EdgeT, add: ((AdjacencyListBase.this)#NodeT) ⇒ Unit): Unit

final def asInstanceOf[T0]: T0

final def asNodeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G): GraphPredef.InnerNodeParam.asNodeT.G.NodeT

final def asNodeTProjection[N <: N, E[X] <: EdgeLikeIn[X]]: GraphBase.NodeT

def canEqual(that: Any): Boolean

def clone(): AnyRef

final def connectionsWith(other: (AdjacencyListBase.this)#NodeT): FilteredSet[(AdjacencyListBase.this)#EdgeT]

All edges connecting this node with other including outgoing and incoming edges.

final def containingGraph: (AdjacencyListBase.this)#ThisGraph

The Graph instance this node is contained in.

final def degree: Int

The degree of this node.

final def diPredecessors: Set[(AdjacencyListBase.this)#NodeT]

All direct predecessors of this node, also called predecessor set or open in-neighborhood: source nodes of directed incident edges and / or adjacent nodes of undirected incident edges excluding this node.

def ensuring(cond: ((AdjacencyListBase.this)#InnerNode) ⇒ Boolean, msg: ⇒ Any): (AdjacencyListBase.this)#InnerNode

def ensuring(cond: ((AdjacencyListBase.this)#InnerNode) ⇒ Boolean): (AdjacencyListBase.this)#InnerNode

def ensuring(cond: Boolean, msg: ⇒ Any): (AdjacencyListBase.this)#InnerNode

def ensuring(cond: Boolean): (AdjacencyListBase.this)#InnerNode

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

def finalize(): Unit

final def findConnected[U](pred: ((AdjacencyListBase.this)#NodeT) ⇒ Boolean)(implicit visitor: ((AdjacencyListBase.this)#NodeT) ⇒ U = empty): Option[(AdjacencyListBase.this)#NodeT]

Finds a node connected with root by any number of edges with any direction for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

def findCycle[U](implicit visitor: ((AdjacencyListBase.this)#NodeT) ⇒ U = empty): Option[(AdjacencyListBase.this)#Cycle]

Finds a cycle starting the search at root taking optional properties like subgraph restriction, ordering or maximum depth into account.

final def findIncomingFrom(from: (AdjacencyListBase.this)#NodeT): Option[(AdjacencyListBase.this)#EdgeT]

An edge at from having this node as a successor.

final def findOutgoingTo(to: (AdjacencyListBase.this)#NodeT): Option[(AdjacencyListBase.this)#EdgeT]

An outgoing edge connecting this node with to.

final def findPredecessor[U](pred: ((AdjacencyListBase.this)#NodeT) ⇒ Boolean)(implicit visitor: ((AdjacencyListBase.this)#NodeT) ⇒ U = empty): Option[(AdjacencyListBase.this)#NodeT]

Finds a predecessor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

final def findSuccessor[U](pred: ((AdjacencyListBase.this)#NodeT) ⇒ Boolean)(implicit visitor: ((AdjacencyListBase.this)#NodeT) ⇒ U = empty): Option[(AdjacencyListBase.this)#NodeT]

Finds a successor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

final def fold[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton, T](g: G)(fa: (GraphPredef.InnerNodeParam.fold.G.NodeT) ⇒ T, fb: (GraphBase.NodeT) ⇒ T): T

def formatted(fmtstr: String): String

final def getClass(): Class[_]

final def hasOnlyHooks: Boolean

Checks whether this node has only hooks or no edges at all.

final def hasPredecessor[U](potentialPredecessor: (AdjacencyListBase.this)#NodeT)(implicit visitor: ((AdjacencyListBase.this)#NodeT) ⇒ U = empty): Boolean

Checks whether potentialPredecessor is a predecessor of root considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

final def hasPredecessors: Boolean

Whether this node has any predecessors.

final def hasSuccessor[U](potentialSuccessor: (AdjacencyListBase.this)#NodeT)(implicit visitor: ((AdjacencyListBase.this)#NodeT) ⇒ U = empty): Boolean

Checks whether potentialSuccessor is a successor of this node considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

final def hasSuccessors: Boolean

Whether this node has any successors.

def hashCode(): Int

final def inDegree(nodeFilter: ((AdjacencyListBase.this)#NodeT) ⇒ Boolean, edgeFilter: ((AdjacencyListBase.this)#EdgeT) ⇒ Boolean = anyEdge, includeHooks: Boolean = false, ignoreMultiEdges: Boolean = true): Int

The incoming degree of this node after applying some filters to the incoming edges and predecessors.

final def inDegree: Int

The incoming degree of this node.

final def inNeighbors: Set[(AdjacencyListBase.this)#NodeT]

Synonym for diPredecessors.

final def incoming: FilteredSet[(AdjacencyListBase.this)#EdgeT]

Incoming edges of this node.

final def incomingFrom(from: (AdjacencyListBase.this)#NodeT): FilteredSet[(AdjacencyListBase.this)#EdgeT]

All incoming edges connecting from with this node.

final def innerEdgeTraverser(implicit parameters: Parameters = Parameters()): (AdjacencyListBase.this)#InnerEdgeTraverser

Instantiates an InnerEdgeTraverser which extends scala.collection.Traversable with elements of type EdgeT and sets its root to this node.

final def innerElemTraverser(implicit parameters: Parameters = Parameters()): (AdjacencyListBase.this)#InnerElemTraverser

Instantiates an InnerElemTraverser which extends scala.collection.Traversable with elements of type InnerElem and sets its root to this node.

final def innerNodeDownUpTraverser(implicit parameters: Parameters = Parameters()): (AdjacencyListBase.this)#InnerNodeDownUpTraverser

Instantiates an InnerNodeDownUpTraverser which extends scala.collection.Traversable with elements of type (Boolean, NodeT) and sets its root to this node.

final def innerNodeTraverser(implicit parameters: Parameters = Parameters()): (AdjacencyListBase.this)#InnerNodeTraverser

Instantiates an InnerNodeTraverser which extends scala.collection.Traversable with elements of type NodeT and sets its root to this node.

final def isConnectedWith[U](potentialConnected: (AdjacencyListBase.this)#NodeT)(implicit visitor: ((AdjacencyListBase.this)#NodeT) ⇒ U = empty): Boolean

Checks whether potentialConnected is a node (not necessarily directly) connected with root by any number of edges with any direction considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

def isDefined: Boolean

final def isDirectPredecessorOf(that: (AdjacencyListBase.this)#NodeT): Boolean

Whether that is an adjacent (direct successor) to this node.

def isEdge: Boolean

def isIn: Boolean

final def isIndependentOf(that: (AdjacencyListBase.this)#NodeT): Boolean

Whether that is independent of this node meaning that there exists no edge connecting this node with that.

final def isInstanceOf[T0]: Boolean

final def isIsolated: Boolean

true if this node's degree equals to 0.

final def isLeaf: Boolean

true if this node's degree equals to 1.

def isNode: Boolean

def isOut: Boolean

final def isPredecessorOf[U](potentialSuccessor: (AdjacencyListBase.this)#NodeT)(implicit visitor: ((AdjacencyListBase.this)#NodeT) ⇒ U = empty): Boolean

Same as hasSuccessor.

final def isSuccessorOf[U](potentialPredecessor: (AdjacencyListBase.this)#NodeT)(implicit visitor: ((AdjacencyListBase.this)#NodeT) ⇒ U = empty): Boolean

Same as hasPredecessor.

val n1: (AdjacencyListBase.this)#InnerNode

final def ne(arg0: AnyRef): Boolean

final def neighbors: Set[(AdjacencyListBase.this)#NodeT]

All adjacent nodes (direct successors and predecessors) of this node, also called open neighborhood excluding this node.

final def nodeEqThis: ((AdjacencyListBase.this)#NodeT) ⇒ Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def outDegree(nodeFilter: ((AdjacencyListBase.this)#NodeT) ⇒ Boolean, edgeFilter: ((AdjacencyListBase.this)#EdgeT) ⇒ Boolean = anyEdge, includeHooks: Boolean = false, ignoreMultiEdges: Boolean = true): Int

The outgoing degree of this node after applying some filters to the outgoing edges and successors.

final def outDegree: Int

The outgoing degree of this node.

final def outNeighbors: Set[(AdjacencyListBase.this)#NodeT]

Synonym for diSuccessors.

final def outerEdgeTraverser(implicit parameters: Parameters = Parameters()): (AdjacencyListBase.this)#OuterEdgeTraverser

Instantiates an OuterEdgeTraverser which extends scala.collection.Traversable with elements of type E[N] and sets its root to this node.

final def outerElemTraverser(implicit parameters: Parameters = Parameters()): (AdjacencyListBase.this)#OuterElemTraverser

Instantiates an OuterElemTraverser which extends scala.collection.Traversable with elements of type OuterElem and sets its root to this node.

final def outerNodeDownUpTraverser(implicit parameters: Parameters = Parameters()): (AdjacencyListBase.this)#OuterNodeDownUpTraverser

Instantiates an OuterNodeDownUpTraverser which extends scala.collection.Traversable with elements of type (Boolean, N) and sets its root to this node.

final def outerNodeTraverser(implicit parameters: Parameters = Parameters()): (AdjacencyListBase.this)#OuterNodeTraverser

Instantiates an OuterNodeTraverser which extends scala.collection.Traversable with elements of type N and sets its root to this node.

final def outgoing: FilteredSet[(AdjacencyListBase.this)#EdgeT]

All edges outgoing from this node.

final def outgoingTo(to: (AdjacencyListBase.this)#NodeT): FilteredSet[(AdjacencyListBase.this)#EdgeT]

All outgoing edges connecting this node with to.

final def pathTo[U](potentialSuccessor: (AdjacencyListBase.this)#NodeT)(implicit visitor: ((AdjacencyListBase.this)#NodeT) ⇒ U = empty): Option[(AdjacencyListBase.this)#Path]

Finds a path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

def pathUntil[U](pred: ((AdjacencyListBase.this)#NodeT) ⇒ Boolean)(implicit visitor: ((AdjacencyListBase.this)#NodeT) ⇒ U = empty): Option[(AdjacencyListBase.this)#Path]

Finds a path from root to a successor of root for which pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

def root: (AdjacencyListBase.this)#NodeT

final def shortestPathTo[T](potentialSuccessor: (AdjacencyListBase.this)#NodeT, weight: ((AdjacencyListBase.this)#EdgeT) ⇒ T)(implicit arg0: Numeric[T]): Option[(AdjacencyListBase.this)#Path]

Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

final def shortestPathTo[U](potentialSuccessor: (AdjacencyListBase.this)#NodeT)(implicit visitor: ((AdjacencyListBase.this)#NodeT) ⇒ U = empty): Option[(AdjacencyListBase.this)#Path]

Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

def shortestPathTo[T, U](potentialSuccessor: (AdjacencyListBase.this)#NodeT, weight: ((AdjacencyListBase.this)#EdgeT) ⇒ T, visitor: ((AdjacencyListBase.this)#NodeT) ⇒ U)(implicit arg0: Numeric[T]): Option[(AdjacencyListBase.this)#Path]

Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

def stringPrefix: String

final def synchronized[T0](arg0: ⇒ T0): T0

final def toInnerElemTraverser(root: (AdjacencyListBase.this)#NodeT): (AdjacencyListBase.this)#InnerElemTraverser

final def toNodeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G)(f: (GraphBase.NodeT) ⇒ GraphPredef.InnerNodeParam.toNodeT.G.NodeT): GraphPredef.InnerNodeParam.toNodeT.G.NodeT

def toString(): String

def topologicalSort[U](ignorePredecessors: Boolean = false)(implicit visitor: ((AdjacencyListBase.this)#InnerElem) ⇒ U = empty): (AdjacencyListBase.this)#CycleNodeOrTopologicalOrder

Sorts the component designated by the given node topologically.

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def withDirection(direction: Direction): (AdjacencyListBase.this)#InnerNodeTraverser

Creates a new FluentProperties based on this except for an updated direction.

final def withKind(kind: Kind): (AdjacencyListBase.this)#InnerNodeTraverser

Creates a new FluentProperties based on this except for an updated kind.

final def withMaxDepth(maxDepth: Int): (AdjacencyListBase.this)#InnerNodeTraverser

Creates a new FluentProperties based on this except for an updated maxDepth.

final def withOrdering(ordering: (AdjacencyListBase.this)#ElemOrdering): (AdjacencyListBase.this)#InnerNodeTraverser

Creates a new FluentProperties based on this except for an updated ordering.

final def withParameters(parameters: Parameters): (AdjacencyListBase.this)#InnerNodeTraverser

Creates a new FluentProperties based on this except for an updated parameters.

final def withRoot(root: (AdjacencyListBase.this)#NodeT): (AdjacencyListBase.this)#InnerNodeTraverser

Creates a new FluentProperties based on this except for an updated root.

final def withSubgraph(nodes: ((AdjacencyListBase.this)#NodeT) ⇒ Boolean = anyNode, edges: ((AdjacencyListBase.this)#EdgeT) ⇒ Boolean = anyEdge): (AdjacencyListBase.this)#InnerNodeTraverser

Creates a new FluentProperties based on this except for an updated subgraphNodes and/or subgraphEdges.

final def ~: ExtSet[(AdjacencyListBase.this)#EdgeT]

Synonym for edges.

final def ~>(to: (AdjacencyListBase.this)#NodeT): Set[(AdjacencyListBase.this)#EdgeT] with FilterableSet[(AdjacencyListBase.this)#EdgeT]

Synonym for outgoingTo.

final def ~>: Set[(AdjacencyListBase.this)#EdgeT] with FilterableSet[(AdjacencyListBase.this)#EdgeT]

Synonym for outgoing.

final def ~>?(to: (AdjacencyListBase.this)#NodeT): Option[(AdjacencyListBase.this)#EdgeT]

Synonym for findOutgoingTo.

final def ~>|: Set[(AdjacencyListBase.this)#NodeT]

Synonym for diSuccessors.

final def ~|: Set[(AdjacencyListBase.this)#NodeT]

Synonym for neighbors.

def →[B](y: B): ((AdjacencyListBase.this)#InnerNode, B)

def isDefined: Boolean

def isEdge: Boolean

def isIn: Boolean

def isNode: Boolean

def isOut: Boolean

val self: Any

val self: Any

def stringPrefix: String

def toString(): String

val value: (AdjacencyListBase.this)#InnerNode

def ~[N >: N1](n2: N): UnDiEdge[N]

def ~>[N >: N1](n2: N): DiEdge[N]

def x: (AdjacencyListBase.this)#InnerNode

def x: (AdjacencyListBase.this)#InnerNode