Class: Label

Graph.Label

new Label()

A Label, built as a tree starting from the primitive label A label for an SPPRC labelling algorithm stores its resident vertex, its predecessor arc over which it has been extended, its predecessor label, and its current vector of resource values. The
Source:

Methods

(static) extend()

Static factory function extends a label along the arc and returns a new label
Source:
Returns:
Label

(static) feasible()

Checks weather a label fulfills all its resource constraints in its resident node
Source: