Definition:Minimal Length Path

Definition

Let $G = \struct {V, E}$ be a simple graph.

Let $u, v \in V$ be vertices of $G$.

Let $W$ be the set of all open paths between $u$ and $v$.

An open path $p \in W$ is a minimal length path from $u$ to $v$ if and only if:

there exists no path $q$ beginning at $u$ and ending at $v$ such that the length of $q$ is (strictly) less than the length of $p$.

Also see

• Results about minimal length paths can be found here.

Sources

There are no source works cited for this page. Source citations are highly desirable, and mandatory for all definition pages. Definition pages whose content is wholly or partly unsourced are in danger of having such content deleted. To discuss this page in more detail, feel free to use the talk page.