Graph Capstone

Final Path Verdict

State the final shortest path and total cost. This is a small deterministic example, not solver engineering.

Example

State the final shortest path and total cost.

highlighted = computed this step

Step 1 — Path

Compute the highlighted combinatorics value.

path(A, B, C, D, E)\begin{array}{c|c}\text{path}&\hlmath{\text{(A, B, C, D, E)}}\end{array}

Step 2 — Cost

Compute the highlighted combinatorics value.

cost7\begin{array}{c|c}\text{cost}&\hlmath{\text{7}}\end{array}

Step 3 — Verdict

Compute the highlighted combinatorics value.

verdictshortest path\begin{array}{c|c}\text{verdict}&\hlmath{\text{shortest path}}\end{array}
combinatorics-search Every row is intentionally ordered and pinned to the lesson specification.