Shortest Path

The Dijkstra algorithm solves the single-source shortest path problem. For a given source node in the graph, the algorithm finds the shortest path between that node and every other. It can also be used for finding the shortest paths from a single node to a single destination node by stopping the algorithm once the shortest path to the destination node has been determined. For example, if the nodes of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra’s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path algorithm is widely used in network routing protocols.

2015 — Acrylic, graphite dust, UV pigment and resin on canvas, 280 × 420 cm
A dense network of luminous linear structures traverses a near-black surface interrupted by zones of matte absorption. Developed from infrastructural mapping systems and routing diagrams, the work transforms computational efficiency into a spatial and psychological condition. Subtle variations in reflected light cause routes to appear and disappear depending on the viewer’s position.