Network Implementation 3

This simulation demonstrates how a network implementation with the current engine could function, with the assumption that stdlib functions would change how the user actually interacts with network features.

In this implementation, edges don't actually exist in the engine. Nodes simply have a network object which contains information about their network neighbors and all relevant properties (such as directed/undirected edge, edge length, etc...)

Nodes search their neighbors for nodes they are connected to and modify their height in a diffusion-like manner.