UndirectedEdge class

Abstract class extending Edge. When building an undirected Edge this class should be extended. An undirected edge in a graph has ne directionality. That means that using a Vertex a or b as a starting point will not change if an operation is true or not.

Inheritance

• Object
• Edge
• UndirectedEdge

Implementers

• SimpleUndirectedEdge

Constructors

UndirectedEdge(Vertex a, Vertex b, double weight)

Properties

a ↔ Vertex

One of the points of the edge

getter/setter pair, inherited

b ↔ Vertex

One of the points of the edge

getter/setter pair, inherited

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

weight → double

Weight of this edge.

final, inherited

Methods

copy() → UndirectedEdge

Returns a copy of the instance of your object

override

equalToEdge(Edge other) → bool

For checking if an Edge contains the same vertices as other.

inherited

equalToVertices(Vertex a, Vertex b) → bool

For checking if an Edge contains Vertices a and b.

inherited

noSuchMethod(Invocation invocation) → dynamic

Invoked when a nonexistent method or property is accessed.

inherited

reversedEdge() → UndirectedEdge

toJson() → Map<String, dynamic>

Serializes an object

override

toString() → String

A string representation of this object.

override

Operators

operator ==(Object other) → bool

The equality operator.

inherited