## Invitation to Computer Science 8th Edition

There are four distinct paths from node $\mathrm{A}$ to node $\mathrm{D},$ and their total weights are \begin{array}{ll}{\mathrm{ABCD}} & {\text { Weight }=16} \\ {\mathrm{ABFD}} & {\text { Weight }=14} \\ {\text { AEFBCD }} & {\text { Weight }=25} \\ {\text { AEFD }} & {\text { Weight }=15}\end{array} \begin{array}{l}{\text { So the shortest path is ABFD, found by computing the weight of every }} \\ {\text { possible path and then picking the smallest. This is essentially a "brute }} \\ {\text { force" approach to the problem. }}\end{array}
There are four distinct paths from node $\mathrm{A}$ to node $\mathrm{D},$ and their total weights are \begin{array}{ll}{\mathrm{ABCD}} & {\text { Weight }=16} \\ {\mathrm{ABFD}} & {\text { Weight }=14} \\ {\text { AEFBCD }} & {\text { Weight }=25} \\ {\text { AEFD }} & {\text { Weight }=15}\end{array} \begin{array}{l}{\text { So the shortest path is ABFD, found by computing the weight of every }} \\ {\text { possible path and then picking the smallest. This is essentially a "brute }} \\ {\text { force" approach to the problem. }}\end{array}