Shortest Path
Shortest Path. HKOI 2006 March 11, 2006. Graph. Graph G = (V, E) Vertex/Node V Number |V| or simply V Degree deg[ v ],in-deg[ v ],out-deg[ v ] Edge E Number |E| or simply E Direction e = ( u , v ) or { u , v } Weight w e , w uv E ≤ V 2 i.e. deg[ v ] ≤ |V|.
549 views • 38 slides