This module defines the components of networks, graphs where edges have an in-degree that may exceed 1. The types defined in this module are concrete implementations that inherit from the abstract types in the abstract trees module .

Depending on the concrete subclass, edges in networks either have lengths formatted as integers or lengths formatted as floating point numbers. A concrete network node implementation. A concrete network edge implementation, with float edge. A concrete network edge implementation, with int edge. A concrete network implementation, with floating point edge lengths. A concrete network implementation, with integer edge lengths.