Skip to content

Path

Version
v1 · 2026-08-24 · History
Prime #
1055
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Graph Theory → Mathematics

Core Idea

A path is an ordered, adjacency-honouring sequence of edges connecting one node to another through a relational substrate. It is a committed realization of one connection — a concrete route, as opposed to the network's manifold of what could connect.

How would you explain it like I'm…

The Trail You Walked

A path is the actual trail you take to get from where you are to where you want to go, step by step. The whole park has lots of trails you could take, but a path is the one you really walked. It has a start, an end, and all the spots in between.

One Real Route

A path is an ordered chain of steps that connects one point to another by hopping along links that actually touch. A map shows everything that could connect to everything, but a path is one real route picked out of that map. Because it is a real route, you can ask how long it is, which step is the slowest, and what other way you could go if one link breaks. The map alone cannot answer those, because it only tells you what is possible, not which trip you took.

Committed Traversal

A Path is a sequence of edges through a relational structure that connects one node to another by an ordered, traversable chain. The minimum it needs is two things: an edge-like substrate (links, adjacencies, transitions, citations) and an ordering that says this, then that, until arrival. Everything else, directed or not, weighted or not, shortest or any-old, is a refinement of the same shape. What makes a path its own object, separate from the network it lives in, is the shift from capacity to route: a network says what can connect, a path is one committed realization of such a connection. Reifying the trajectory as an object is exactly what lets you ask its cost, its bottleneck, or its alternative if an edge is cut.

 

A Path is a sequence of edges through a relational structure connecting one node to another by an ordered, traversable chain. Structurally it needs only two pieces: a relational substrate, something edge-like such as adjacencies, transitions, links, or citations, and an ordering that imposes this-then-that until arrival. Directed or undirected, weighted or unweighted, shortest or arbitrary, deterministic or stochastic are all refinements of that single shape; at bottom a path is a committed traversal that honours the substrate's adjacency. Its distinctness from the network comes from the shift from capacity to route: a network is the manifold of possibility, a path is one concrete realized trajectory through it. Reifying the trajectory as an object makes new questions askable, the route's cost, its shortest or safest alternative, its bottleneck edge, what remains if an edge is severed. It also exports a richer vocabulary than node or edge alone: length, origin, destination, waypoints, edge costs, and direction. Once a system models its trajectories as paths, shortest-path search, capacity routing, and attribution along a chain all become expressible in one shared graph-theoretic formalism, which is why the same word describes a supply route, a transmission chain, a procedural escalation, and a sequence of inference steps.

Broad Use

  • Graph theory: paths, walks, and geodesics, with shortest-path algorithms foundational.
  • Computing and networking: routing paths through the internet, call stacks, execution traces, query plans.
  • Logistics: every dispatched route through a road or distribution network, optimised against cost and capacity.
  • Epidemiology: chains of transmission through the contact network, reconstructed by contact tracing.
  • Law: the appellate path through a court hierarchy; the chain from arrest to conviction.
  • Causal reasoning: a directed cause-to-effect path through a structural graph, blocked to compute interventions.
  • Search and reasoning: a solution path from initial state to goal in a game tree, proof search, or planner.

Clarity

It separates the possibility-structure (network) from the selected trajectory (path), keeping distinct three questions — does a route exist, can the system support routes, which route was chosen — each with a different remedy.

Manages Complexity

A path is a one-dimensional projection of a high-dimensional network, so reasoning about the selected trajectory exposes only the edges traversed, never the exponential space of all routes.

Abstract Reasoning

It licenses reasoning about reachability, cost, the Bottleneck (weakest link), alternative routing under a cut, and path-dependence — outcomes that hinge on which route was taken, not just the endpoints.

Knowledge Transfer

  • Software: contact-tracing paths transfer to defect-tracing on the version graph — instrument high-traversal edges, sever risky ones.
  • Audit: causal-path analysis transfers to audit-trail design, tracing a consequential output back to its responsible step.
  • Organizations: routing's lesson that each node compute its next hop locally transfers to robust distributed responsibility.

Example

A package routes factory → port → ship → port → customs → distribution centre → van, each node a waypoint where it can be lost; the interventions are identical to packet routing — find the bottleneck edge, precompute an edge-disjoint alternative.

Relationships to Other Abstractions

Local relationship map for PathParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.PathPRIMEPrime abstraction: Network — presupposesNetworkPRIMEDomain-specific abstraction: Line of Operation — includesLine ofOperationDOMAINDomain-specific abstraction: Map Matching — presupposesMap MatchingDOMAINDomain-specific abstraction: Differentiable curve — is a kind ofDifferentiablecurveDOMAINDomain-specific abstraction: External Ray — is a kind ofExternal RayDOMAINDomain-specific abstraction: Geodesic — is a kind ofGeodesicDOMAINDomain-specific abstraction: Induced Path — is a kind ofInduced PathDOMAINDomain-specific abstraction: Process function — is a kind ofProcess functionDOMAINDomain-specific abstraction: Rhumb line — is a kind ofRhumb lineDOMAIN

Current abstraction Path Prime

Parents (1) — outgoing typed relations

  • Path presupposes Network Prime

    'A path is one COMMITTED realization of a connection through the underlying relational substrate (a network)...

Children (8) — abstractions linked here by typed relations

  • Differentiable curve Domain-specific is a kind of Path

    It remains its own entry because its identity is fixed by the ambient manifold or vector space, parameter interval, curve map, differentiability class, derivative and regularity, orientation and allowed reparameterizations, image versus parametrization and claimed geometric quantities.

  • External Ray Domain-specific is a kind of Path

    Path is the broader abstraction this entry instantiates.

  • Geodesic Domain-specific is a kind of Path

    Geodesic is proposed as a strict specialization of Path: it is a traversable curve or route whose admissible progression respects a geometric substrate, with the added invariant of intrinsic straightness.

  • Induced Path Domain-specific is a kind of Path

    Induced paths are chordless graph paths.

  • Process function Domain-specific is a kind of Path

    It remains its own entry because its identity is fixed by the system boundary, initial and final equilibrium states, specified path and controls, inexact differential and sign convention, path integral and comparison with an alternate path and corresponding state functions.

Hierarchy path (1) — routes to 1 parentless root

Not to Be Confused With

  • Path is not a Network because a network is the manifold of what could connect, whereas a path is one committed realization of a connection — capacity fixes versus routing fixes.
  • Path is not a Markov Process because a Markov process is a stochastic generative rule for next states, whereas a path is a single realized ordered sequence carrying no transition law.
  • Path is not Pareto Efficiency because a path need not be shortest or best — "a route exists" and "the optimal route" are different questions.