Algorithms of displacement (example in java) MTO8 EN
From wikitin
Title: MT08_Algorithms of displacement(example in java)_EN
Student first name: ANEVAR
Student last name: Mouhamad rafik
Contents |
Resume
Nowadays every human being is facing the race against time. For instance a pizza deliveryman wants to deliver his pizza within thirty minutes; it may also be the story of Mr.Peter who wants to know which train will bring him soon to Heathrow airport to get his flight on time. Finally how is an e-mail sent from London to Paris by the various available paths?
The problem of all of them is: How to move from a location to another by saving their resources (time, fuel, cost, flow…)? The solution is to find the shortest path from their departure to their arrival. There are various algorithms called “algorithms of displacement” which deal with this sort of problem.
This project helps you to understand three main algorithms of the shortest path finder like Dijkstra, Bellman-Ford and Floyd. It also contains a demonstration in java which can find the shortest path in a graph using the Dijkstra algorithm.
Key word
Algorithm of displacement,shortest path,dijkstra,floyd,bellman ford
Technology used
java
Element of demonstration
Demonstration in java which can find the shortest path in a graph using the Dijkstra algorithm.
Bibliography
Book:
Graphes et Algorithmes, Michel GONDRAN et Michel MINOUX Initiation à l'informatique, Robert Strandh et Irène Durand
Course book :
Méthodes d'optimisation combinatoire (TELECOM PARIS)
Web:
http://www.apprendre-en-ligne.net/graphes/ http://brassens.upmf-grenoble.fr/IMSS/mamass/graphecomp/gcompcours.html http://mathworld.wolfram.com/topics/GraphTheory.html http://pagesperso-orange.fr/jean-paul.davalan/liens/liens_graph.html http://www.apprendre-en-ligne.net/graphes/index.html http://www.nimbustier.net/publications/djikstra/djikstra.html
DIJKSTRA'S IMPLEMENTATION IN JAVA :
http://java.sun.com/j2se/1.5.0/docs/api/index.html?java/awt/CardLayout.html http://www.laltruiste.com/coursjava/sommaire.html http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/dijkstra/Dijkstra.java http://www.javafr.com/codes/GRAPHE-ORIENTE-DIJKSTRA_30362.aspx
