[Boost-users] Shortest Path City map

From: Jeroen Vanattenhoven (jeroen.vanattenhoven_at_[hidden])
Date: 2006-03-24 16:12:09

Hello,

I'm just learning and reading about the graph theory and shortest path 
algorithms. For graph representation there are 3 possibilities: 
adjacency matrix for dense graphs, adjacency lists for sparse graphs and 
edge lists. The road network of a city map belongs to which category?

I've also been reading that Dijkstra is applied to a directed graph. 
Calculating the shortest route in a city map implies an undirected graph 
(am I wrong?). So how can I do shortest path calculation of a city map 
the best way?

Jeroen