This chapter presents an overview of edges. It describes their purpose, how they can be connected to components of a graph, how metadata can be assigned to them and propagated through them, how edges can be debugged and how data flowing through edges can be analyzed.
An edge can be seen as a pipe conveying data from one component to another.
The following are properties of edges:
Each edge must connect two components.
Each edge is of one of the four types.
Metadata must be assigned to each edge, describing the data flowing through the edge.
Each edge changes its color upon metadata assignment, edge selection, etc.
Each edge can be debugged.
Some edges require more memory than others. This section contains the explanation.