A network made visible

By Code from zero · myAudience

myAudience · AI-generated original illustration · Original AI-generated illustration; not documentary evidence; no third-party artwork reproduced.

A graph represents a set of nodes and connections called edges. A node might stand for a station, a web page or a task, while an edge records a defined relationship. The model only becomes useful when those meanings are clear; a glowing network picture is not automatically evidence of a live system.

Edges may be directed or undirected. A one-way road needs a direction, whereas a simple mutual connection can be modeled without one. Weights can represent travel time, distance or cost. Those quantities must not be interchanged: the route with the fewest edges is not necessarily the route with the smallest total travel time.

An adjacency list records the neighbors available from each node. It is a compact way to describe a small graph without relying on a visual layout. Two drawings can represent the same graph even when their nodes appear in very different places; the connections and labels determine the model, not the decorative positions.

Worked example: routes A–B and B–D each take 4 minutes, while A–C and C–D each take 3 minutes. Both routes have two edges, but A–C–D takes 6 minutes and A–B–D takes 8. Check: would selecting the fewest edges distinguish them? No; a time-based question needs edge weights and a method that accounts for them.

The artwork is an original abstract network, not a map of members, contacts or private activity. Do not infer a person’s relationships from its visual arrangement. For a real application, validate and authorize data before building the graph; a useful model should explain what is represented and what it deliberately leaves out.

Image: illustration, not a documentary photograph.