GraphNode<T> class abstract

An node in a graph in which the edges may be interlinked or not. This interface is used for algorithms which may work only for GraphNodes.

edges is an Set because having duplicate edges would break algorithms for GraphNodes.

It has an addEdge operation because some algos need them and it is impossible to create an immutable graph with interlinked edges, so this model assumes that every usable graph may be interlinked, and therefore may be mutable.

Inheritance

• Object
• Node<T>
• GraphNode

Implementers

• DependencyGraphNode

Constructors

GraphNode()

Properties

edges → Set<GraphNode<T>>

The edges of this Node. They may be interlinked.

no setter, override

hashCode → int

The hash code for this object.

no setter, inherited

runtimeType → Type

A representation of the runtime type of the object.

no setter, inherited

value → T

The value this Node represents.

no setter, inherited

Methods

addEdge(covariant GraphNode<T> edge) → void

Add an new edge to this GraphNode.

noSuchMethod(Invocation invocation) → dynamic

Invoked when a nonexistent method or property is accessed.

inherited

toString() → String

A string representation of this object.

inherited

Operators

operator ==(Object other) → bool

The equality operator.

inherited