1 General concept

A path is an ordered progression from one point or state to another. In everyday use, it may mean a physical route, a route through a system, or a sequence of steps leading toward a result. In scientific writing, the term is valued because it captures both movement and relation: elements are not merely listed, but connected in a specific order.

The concept appears across many fields because it is flexible. A path can be concrete, such as a line traced in space, or abstract, such as a sequence of states in a machine or a proof. In most contexts, the idea implies continuity, adjacency, or a rule that governs how one step follows another.

1.1 Basic definition

In its broadest sense, a path is a connected course between two endpoints or through a set of intermediate positions. The course may be physical, mathematical, or conceptual. What matters is that the elements are arranged in a way that supports transition from one to the next.

A path often includes direction, even when the direction is not explicitly stated. In some cases, it is reversible; in others, the order is essential. This makes the term useful for describing movement, access, and transformation.

1.2 Historical development

The idea of a path is ancient and predates formal scientific language. Early geometry treated lines, arcs, and routes as basic objects of study, while philosophy and logic used the notion metaphorically for progress in thought or argument. As mathematics developed, the concept became more precise, especially in geometry and later in topology and graph theory.

In modern science and computing, path has been adapted to new frameworks. It now describes routes through networks, sequences of operations, trajectories of particles, and ordered instructions in software. Despite these specialized uses, the underlying idea remains consistent: a path organizes change through relation and order.

Several terms overlap with path, but each emphasizes a different aspect. Some describe physical movement, while others focus on abstraction, structure, or process. Distinctions among them are often context dependent.

1.3.1 Route

A route is a planned or customary path between places. It usually suggests a practical course of travel, often chosen for efficiency, convenience, or accessibility. Unlike the broader term path, route commonly implies a navigable way with a recognizable purpose.

1.3.2 Trajectory

A trajectory is the path followed by a moving object. It is often used in physics and engineering, where the motion may be influenced by gravity, force, or control systems. The term stresses the shape and evolution of motion over time.

1.3.3 Walk and chain

In graph theory, a walk is a sequence of connected vertices and edges, and a chain is a similar term used in some branches of mathematics. These terms are more technical than path and may allow repeated vertices or edges depending on the definition. They are useful for distinguishing general connectivity from stricter forms of traversal.

2 Path in mathematics

Mathematics uses path in several distinct but related ways. The term can refer to a structure in graph theory, a continuous map in topology, or a geometric curve in space. In each setting, it expresses a controlled progression from one point to another.

2.1 Path in graph theory

In graph theory, a path is a sequence of vertices connected by edges so that each consecutive pair is adjacent. Paths are central to questions about connectivity, distance, and traversal. They help describe whether a graph is linked, how information may move through it, and what routes are available.

2.1.1 Simple path

A simple path is one in which no vertex is repeated, except possibly when a convention allows the first and last vertex to coincide in a closed form. Simplicity makes the path easier to analyze and is often important in problems involving minimal routes or nonrepeating traversal.

2.1.2 Path length

The length of a path is usually the number of edges it contains. In weighted graphs, length may instead mean the sum of the edge weights. This distinction matters in applications where the number of steps and the cost of travel are not the same.

2.1.3 Directed and undirected paths

In an undirected graph, movement along an edge is allowed in either direction. In a directed graph, each edge has an orientation, so the path must follow the permitted direction. Directed paths are especially relevant in systems where order and dependency matter.

2.1.4 Path graphs

A path graph is a graph that consists of vertices arranged in a single line. Each internal vertex is connected to exactly two neighbors, while the endpoints have one neighbor each. Path graphs are among the simplest graph structures and often serve as building blocks in graph theory.

2.2 Path in topology

Topology studies properties preserved under continuous deformation, and path is one of its most important notions. Here, a path is generally a continuous map from an interval into a space. This provides a way to talk about movement within a space without relying on exact shapes or distances.

2.2.1 Continuous path

A continuous path is a function from a closed interval, typically the unit interval, into a topological space. Continuity ensures that nearby points in the interval map to nearby points in the space. This makes the path suitable for describing uninterrupted movement.

2.2.2 Path-connected spaces

A space is path-connected if any two points in it can be joined by a continuous path. This property shows that the space is connected in a strong sense. Path-connectedness is often easier to visualize than more abstract forms of connectedness.

2.2.3 Path homotopy

Path homotopy is a continuous deformation from one path to another, keeping the endpoints fixed. It allows topologists to study when two paths are essentially equivalent. The idea is important for classifying spaces by how their paths can be transformed.

2.2.4 Fundamental group

The fundamental group uses closed paths, or loops, to capture information about the shape of a space. Its elements are equivalence classes of loops under path homotopy. This construction is a central tool in algebraic topology because it links geometry with algebraic structure.

2.3 Path in geometry

In geometry, a path is closely related to a curve or arc. It may be studied as a figure in a plane, a line in space, or a locus traced by moving points. Geometry often considers the path’s shape, smoothness, length, and relation to other objects.

2.3.1 Curves and arcs

A curve is a general geometric object that may represent a path in space. An arc is usually a bounded portion of a curve. These terms are often used when the shape of the route is more important than the sequence of points alone.

2.3.2 Parametrization

Parametrization describes a path by assigning coordinates as functions of a variable, often time or another parameter. This approach allows a geometric object to be studied through an ordered list of positions. It is widely used in calculus, physics, and computer graphics.

2.3.3 Geodesic paths

A geodesic path is the shortest or locally shortest route between points under a given geometry. On a flat surface, geodesics are straight lines; on curved surfaces, they may bend according to the space’s structure. Geodesics are important in differential geometry and relativity.

3 Path in computer science

Computer science uses path to describe orderings in files, data structures, algorithms, and program behavior. In these settings, a path may denote where a resource is located, how a search proceeds, or which sequence of operations a program follows.

3.1 File system paths

A file system path identifies the location of a file or directory in a hierarchical storage system. It lists folders or other containers in a specific order, allowing software and users to find resources precisely. File paths are fundamental to operating systems and application development.

3.1.1 Absolute paths

An absolute path begins from a fixed starting point, such as the root of a file system. It uniquely identifies a location regardless of the current working directory. This makes it reliable when the exact position must be specified.

3.1.2 Relative paths

A relative path is interpreted with reference to the current location. It is shorter and more flexible than an absolute path, but its meaning changes with context. Relative paths are common in portable scripts and projects with stable folder structures.

3.1.3 Path separators

Path separators are characters used to divide components of a file system path. Different operating systems may use different symbols or conventions. Separators help software parse the path into meaningful units.

3.2 Paths in algorithms

In algorithms, a path represents a sequence of connected steps or states. Such paths appear in search, optimization, scheduling, and navigation problems. The key question is often how to find a path with minimal cost, maximal efficiency, or specific constraints.

3.2.1 Shortest path problems

Shortest path problems ask for the least costly route between two nodes in a network. Cost may mean distance, time, number of steps, or weighted sum. These problems are central to graph algorithms and practical navigation systems.

3.2.2 Pathfinding methods

Pathfinding methods are procedures for discovering a route through a space or graph. They are used in robotics, games, logistics, and mapping software. Many methods balance speed, accuracy, and resource use.

3.2.3 Search trees and traversal

Search trees organize possible paths into branching structures. Traversal refers to moving through these structures in a systematic way. Together, they provide a framework for exploring possibilities without missing relevant options.

3.3 Paths in programming

Programming uses path to describe the sequence of actions a program can execute. This may involve actual control decisions, implicit execution routes, or links among dependent components. The term is especially useful in testing, debugging, and analysis.

3.3.1 Execution paths

An execution path is a particular sequence of operations taken during a run of a program. Different inputs may lead to different execution paths. Understanding them helps developers predict behavior and find errors.

3.3.2 Control flow paths

Control flow paths trace the branches and joins in a program’s logic. They reveal how conditions, loops, and function calls shape execution. These paths are important in program analysis and compiler design.

3.3.3 Dependency paths

A dependency path shows how one module, function, or data item relies on another. Such paths are used in build systems, package management, and software architecture. They help identify indirect relationships and potential points of failure.

4 Path in physics and applied sciences

In physics and applied sciences, path usually refers to the motion of an object or the route through which a process unfolds. The term appears in mechanics, control, transport, and probability. It is especially useful when changes occur over time and the intermediate states matter.

4.1 Particle trajectories

A particle trajectory is the path traced by a particle as it moves through space. The trajectory may be straight, curved, periodic, or irregular depending on the forces involved. In classical physics, it is often modeled as a smooth curve.

4.2 Motion planning

Motion planning is the process of determining a feasible path for a moving agent. It is used in robotics, automation, and navigation systems. The goal is to avoid obstacles while satisfying constraints on speed, direction, and safety.

4.3 Network flow and transport

In transport and network analysis, paths describe how goods, people, or information move through connected systems. Efficient path selection can reduce time, cost, and congestion. Such studies are important in logistics, infrastructure, and communications.

4.4 Random paths and stochastic processes

Random paths arise when movement is influenced by chance. They appear in stochastic models such as random walks and diffusion processes. These models are useful for describing phenomena that vary unpredictably over time.

5 Special cases and applications

Some paths have distinctive features that make them useful in specialized settings. These include loops, crossings, segments assembled from simpler pieces, and paths integrated into physical or mathematical calculations.

5.1 Closed paths and cycles

A closed path begins and ends at the same point. In graph theory, closed paths are often called cycles when they satisfy additional conditions. Closed structures are important in analysis of loops, recurrence, and periodic behavior.

5.2 Self-intersecting paths

A self-intersecting path crosses itself at one or more points. Such paths can occur in geometry, motion studies, and graph drawings. They are often more complex to analyze because they may enclose regions or create overlapping segments.

5.3 Piecewise paths

A piecewise path is built from several simpler segments joined together. Each segment may have its own formula or direction, but the overall route remains connected. Piecewise descriptions are common in geometry, animation, and engineering models.

5.4 Path integrals

Path integrals are methods that aggregate contributions over all possible paths or over a specified family of paths. They are widely used in advanced mathematics and theoretical physics. The concept provides a way to treat motion and transformation as collective behavior across routes.

5.4.1 Classical formulation

In classical settings, path integrals may be used to evaluate quantities along a curve, such as work, circulation, or accumulated change. The integral depends on the chosen path, making the route itself part of the result. This is especially relevant in vector calculus.

5.4.2 Quantum mechanical interpretation

In quantum mechanics, path integrals express physical amplitudes as sums over many possible trajectories. Rather than selecting a single route, the formalism considers contributions from a wide range of paths. This approach offers a powerful alternative to other formulations of quantum theory.

Several broader ideas are closely associated with path. These concepts help explain why paths matter across mathematics, science, and computation, since each emphasizes a different aspect of structure and change.

6.1 Connectivity

Connectivity concerns whether objects, nodes, or regions are linked in a way that allows passage between them. A path is one of the main means by which connectivity is demonstrated. Without paths, connectivity cannot be established in a practical sense.

6.2 Continuity

Continuity refers to an unbroken transition without abrupt jumps. It is central to topological paths and to smooth motion in geometry and physics. The idea ensures that intermediate positions or states are meaningfully related.

6.3 Traversal

Traversal is the act of moving through a structure, such as a graph, tree, or network. Paths provide the structure that traversal follows. In computational settings, traversal methods are designed to explore paths systematically.

6.4 Mapping and transformation

Mapping assigns elements of one set or space to another, while transformation changes the form or position of an object or state. Paths often describe how such changes unfold over time or across structure. They are therefore essential for representing processes, not just static relations.