| Revision: | 283 |
| Committed: | Tue Sep 13 21:11:20 2011 UTC (13 years, 8 months ago) by francois |
| Content type: | text/plain |
| Original Path: | magic/lib/outil/src/HypergraphLib_Dijkstra.h |
| File size: | 502 byte(s) |
| Log Message: | structure de l'écriture |
| # | User | Rev | Content |
|---|---|---|---|
| 1 | francois | 283 | #ifndef DIJKSTRA_H |
| 2 | #define DIJKSTRA_H | ||
| 3 | |||
| 4 | #include <set> | ||
| 5 | #include <vector> | ||
| 6 | #include <map> | ||
| 7 | |||
| 8 | #include "HypergraphLib_Graph.h" | ||
| 9 | |||
| 10 | namespace HypergraphLib { | ||
| 11 | ///Calcule le chemin le plus court entre les noeuds a et b, selon la | ||
| 12 | ///fonction de co�t distanceFunc | ||
| 13 | double HYPERGRAPHLIB_ITEM Dijkstra(Graph * __G, Node * source, Node * destination, double (* distanceFunc) (HypergraphLib::Node*, HypergraphLib::Node*, HypergraphLib::Arc*), std::vector<Node *> & pathNodes, std::vector<Arc*> & pathArcs); | ||
| 14 | |||
| 15 | } | ||
| 16 | |||
| 17 | #endif |