2

3
 Waze,google,moveit

4
5
 E V G=(V,E)

(v,u) v u (u,v)
u v

6
 Crossover Crossover

crossover

Evaluation Evaluation
fitness function

crossover

7
Dijakstra

8
 Crossover

crossover

Mutation

Evaluation
fitness function

crossover

9
 SSSP

BFS

APSP

10
 SSSP

E = V x V n = |V| V G={V,E,W}
W(x,y) W:E R m=|E|
s y x
V-s u u d(x)

G
G SSSP

where x V Insert_vertex(x)

where x V Delete_vertex(x)

where x,y V,(x,y) E,x=y Insert_edge(x,y,w)

and (x,y) E where x,y V Delete_edge(x,y)

and w>W(x,y) where x,y V,(x,y) E Increase_weight(x,y,w)

where x,y V,(x,y) E,0<w<W(x,y) Decrease_weight(x,y,w)

11
 Waze, Google maps, moveit

GPS

SPP

SPP

12
13
 Dijkstra's algorithm

O(|V|^2)

Waze

Bellman Ford algorithm

O(|V|*|E|)

A* search algorithm

14
 (h(x)

h(x) O(log(h(x)) O(|V|^2)

A
Google Maps

Floyd Warshall algorithm

O(|V|^3)

Johnson's algorithm

O(|V|^3) O(|V|^2)

GA search on a graph

O(population size*|V|*number of generations)

15
16