6 step 2 structure of shortest paths consider a

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: the set  ' (% ¥ . £  ¨¥ 0 §  ¡ ¤£¡ ¡  ¨¥  § ¨ ¨ ¥ # $¥ ! " % % 2. is a vertex on the path. The shortest such path has length  ¨¥  § ¨ 1. is not a vertex on the path, The shortest such path has length 6 . Step 2: Structure of shortest paths  Consider a shortest path from to containing the vertex . It consists of a subpath from to and a subpath from to . Each subpath can only contain intermediate vertices , and must be as short as possible, in namely they have lengths and . %   %   ¨¥  § % ' ¡  ¨¥ 0 § £  ¨¥  § £ ¡ ¡  ¨¥  § % $¥...
View Full Document

This document was uploaded on 03/26/2014.

Ask a homework question - tutors are online