abstract class BaseNodeBase extends BaseInnerNode
- Attributes
- protected
- Alphabetic
- By Inheritance
- BaseNodeBase
- BaseInnerNode
- InnerNode
- InnerElem
- Node
- Serializable
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new BaseNodeBase()
Abstract Value Members
- abstract def connectionsWith(other: NodeT): Set[EdgeT] with FilterableSet[EdgeT]
All edges connecting this node with
otherincluding outgoing and incoming edges.All edges connecting this node with
otherincluding outgoing and incoming edges. This method is useful in case of multigraphs.- other
A node which is possibly connected with this node.
- returns
All edges connecting this node with
other. Ifotherequals this node all hooks are returned. Ifotheris not connected with this node an empty set is returned.
- Definition Classes
- BaseInnerNode
- abstract def degree: Int
The degree of this node.
The degree of this node.
- returns
the number of edges that connect to this node. An edge that connects to this node at more than one ends (loop) is counted as much times as it is connected to this node.
- Definition Classes
- BaseInnerNode
- abstract def diPredecessors: Set[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.
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.
- returns
set of all direct predecessors of this node.
- Definition Classes
- BaseInnerNode
- abstract def diSuccessors: Set[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.
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.
- returns
set of all direct successors of this node.
- Definition Classes
- BaseInnerNode
- abstract def edges: ExtSet[EdgeT]
All edges at this node - commonly denoted as E(v).
All edges at this node - commonly denoted as E(v).
- returns
all edges connecting to this node.
- Definition Classes
- BaseInnerNode
- abstract def findIncomingFrom(from: NodeT): Option[EdgeT]
An edge at
fromhaving this node as a successor.An edge at
fromhaving this node as a successor.- from
The node being at an edge which has this node as a successor.
- returns
An edges at
fromhaving this node as a successor. Iffromequals this node a hook may be returned. Iffromis not an adjacent nodeNoneis returned.
- Definition Classes
- BaseInnerNode
- abstract def findOutgoingTo(to: NodeT): Option[EdgeT]
An outgoing edge connecting this node with
to.An outgoing edge connecting this node with
to.- to
The node which is the end point of an edge starting at this node.
- returns
One of possibly several edges connecting this node with
to. Iftoequals this node a hook may be returned. Iftois not an adjacent nodeNoneis returned.
- Definition Classes
- BaseInnerNode
- abstract def hasOnlyHooks: Boolean
Checks whether this node has only hooks or no edges at all.
Checks whether this node has only hooks or no edges at all.
- returns
trueif this node has only hooks or it isolated.
- Definition Classes
- BaseInnerNode
- abstract def hasPredecessors: Boolean
Whether this node has any predecessors.
Whether this node has any predecessors.
- Definition Classes
- BaseInnerNode
- abstract def hasSuccessors: Boolean
Whether this node has any successors.
Whether this node has any successors.
- Definition Classes
- BaseInnerNode
- abstract def hook: Option[EdgeT]
- returns
A looping edge out of one or more at this node or
Noneif this node has no looping edge.
- Definition Classes
- BaseInnerNode
- abstract def inDegree(nodeFilter: GraphBase.NodePredicate, edgeFilter: GraphBase.EdgePredicate = anyEdge, includeHooks: Boolean = false, ignoreMultiEdges: Boolean = true): Int
The incoming degree of this node after applying some filters to the incoming edges and predecessors.
The incoming degree of this node after applying some filters to the incoming edges and predecessors.
- Definition Classes
- BaseInnerNode
- abstract def inDegree: Int
The incoming degree of this node.
The incoming degree of this node.
- returns
the number of edges that come in to this node including undirected edges. Loops count once each.
- Definition Classes
- BaseInnerNode
- abstract def incoming: Set[EdgeT] with FilterableSet[EdgeT]
Incoming edges of this node.
Incoming edges of this node.
- returns
set of all edges incoming to of this including undirected edges.
- Definition Classes
- BaseInnerNode
- abstract def incomingFrom(from: NodeT): Set[EdgeT] with FilterableSet[EdgeT]
All incoming edges connecting
fromwith this node.All incoming edges connecting
fromwith this node.- from
The node with zero, one or more edges having this node as a direct successor.
- returns
All edges at
fromhaving this node as a direct successor. Iffromequals this node all hooks are returned. Iffromis not an adjacent node an empty set is returned.
- Definition Classes
- BaseInnerNode
- abstract def isDirectPredecessorOf(that: NodeT): Boolean
Whether
thatis an adjacent (direct successor) to this node.Whether
thatis an adjacent (direct successor) to this node.- that
The node to check for adjacency.
- returns
trueifthatis adjacent to this node.
- Definition Classes
- BaseInnerNode
- abstract def isIndependentOf(that: NodeT): Boolean
Whether
thatis independent of this node meaning that there exists no edge connecting this node withthat.Whether
thatis independent of this node meaning that there exists no edge connecting this node withthat.- that
The node to check for independency.
- returns
trueifthatnode is independent of this node.
- Definition Classes
- BaseInnerNode
- abstract def neighbors: Set[NodeT]
All adjacent nodes (direct successors and predecessors) of this node, also called open neighborhood excluding this node.
All adjacent nodes (direct successors and predecessors) of this node, also called open neighborhood excluding this node.
- returns
set of all neighbors.
- Definition Classes
- BaseInnerNode
- abstract def outDegree(nodeFilter: GraphBase.NodePredicate, edgeFilter: GraphBase.EdgePredicate = anyEdge, includeHooks: Boolean = false, ignoreMultiEdges: Boolean = true): Int
The outgoing degree of this node after applying some filters to the outgoing edges and successors.
The outgoing degree of this node after applying some filters to the outgoing edges and successors.
- Definition Classes
- BaseInnerNode
- abstract def outDegree: Int
The outgoing degree of this node.
The outgoing degree of this node.
- returns
the number of edges that go out from this node including undirected edges. Loops count once each.
- Definition Classes
- BaseInnerNode
- abstract def outer: N
The outer node as supplied by instantiation or addition.
The outer node as supplied by instantiation or addition.
- Definition Classes
- InnerNode
- abstract def outgoing: Set[EdgeT] with FilterableSet[EdgeT]
All edges outgoing from this node.
All edges outgoing from this node.
- returns
set of all edges outgoing from this node including undirected edges and hooks.
- Definition Classes
- BaseInnerNode
- abstract def outgoingTo(to: NodeT): Set[EdgeT] with FilterableSet[EdgeT]
All outgoing edges connecting this node with
to.All outgoing edges connecting this node with
to.- to
The node which is the end point of zero, one or more edges starting at this node.
- returns
All edges connecting this node with
to. Iftoequals this node all hooks are returned. Iftois not an adjacent an empty set is returned.
- Definition Classes
- BaseInnerNode
Concrete Value Members
- def canEqual(that: Any): Boolean
- Definition Classes
- BaseInnerNode
- def equals(other: Any): Boolean
- Definition Classes
- BaseInnerNode → AnyRef → Any
- def hashCode(): Int
- Definition Classes
- BaseInnerNode → AnyRef → Any
- final def inNeighbors: Set[NodeT]
Synonym for
diPredecessors.Synonym for
diPredecessors.- Definition Classes
- BaseInnerNode
- Annotations
- @inline()
- final def isIsolated: Boolean
trueif this node's degree equals to 0.trueif this node's degree equals to 0.- Definition Classes
- BaseInnerNode
- Annotations
- @inline()
- final def isLeaf: Boolean
trueif this node's degree equals to 1.trueif this node's degree equals to 1.- Definition Classes
- BaseInnerNode
- Annotations
- @inline()
- final def outNeighbors: Set[NodeT]
Synonym for
diSuccessors.Synonym for
diSuccessors.- Definition Classes
- BaseInnerNode
- Annotations
- @inline()
- def toString(): String
- Definition Classes
- BaseInnerNode → AnyRef → Any
Welcome to the Graph for Scala API reference. Some suggested entry points:
AnyGraphimmutable.Graphand its inner nodesmutable.Graphand its inner nodes.edgespackage and its subpackageshyperedgespackage and its subpackages.labeled edgespackagemultilabeled edgespackagelabeled hyperedgespackagemultilabeled hyperedgespackageordered labeled hyperedgespackageordered multilabeled hyperedgesobjectgenericpackage.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.