= Acronimul Proiectului: Numele proiectului =

 * Nume Scurt: '''Traffic'''
 * SVN: https://svn-batch.grid.pub.ro/svn/PP2009/proiecte/Traffic/

 * Membri echipei: Stefan Nour - stefan.nour, Raluca Negru - raluca.negru; 
 * Descriere proiect: Improving the algorithm for computing the shortest path to a destination for graphs with large numbers of nodes and integrate it in an existing framework for traffic rerouting.

== Activitate proiect ==
'''Completati ce veti face in fiecare etapa a proiectului '''
 * 12 Nov - ...
{{{
- Status proiect:
...

- ToDo:
...
}}}
== Experimental Results ==

The results were obtained for a 1000 nodes graph using the Dijkstra algorithm parallelized with OpenMp on specified number of threads on cluster.

[[Image(results.jpg)]]