 |  |  |  |  |  |  |  |
dijkstra algorithm problem in c++
Please support our C++ advertiser: Intel Parallel Studio Home
 |
I have problem with dijkstra algorithm
I want to write it in c++ and can not describe it in c++ //
please help me
I want to write it in c++ and can not describe it in c++ //
please help me
•
•
Join Date: Aug 2005
Posts: 15,433
Reputation: 
Solved Threads: 1471
Here is some pseudocode code
Don't PM me with questions -- you might get a nasty PM in response. If you have a question then post it in one of the forums.
•
•
Join Date: Aug 2005
Posts: 5,266
Reputation:
Solved Threads: 377
>how I can use stack and queue to find shortest path ?
It's called homework for a reason. You can use the stack and queue as defined in the standard template library. Go google.
It's called homework for a reason. You can use the stack and queue as defined in the standard template library. Go google.
*Voted best profile in the world*
•
•
•
•
Originally Posted by myleila 
I have problem with dijkstra algorithm
I want to write it in c++ and can not describe it in c++ //
please help me
Begueradj.
•
•
Join Date: Oct 2006
Posts: 2,873
Reputation:
Solved Threads: 301
•
•
•
•
Originally Posted by begueradj
I will try to code it for you in the following days and i will post it on your thread hopefully.
Begueradj.
shortestPath(in theGraph, in weight:WeightArray) {
// Finds the minimum-cost paths between an origin vertex (vertex 0)
// and all other vertices in a weighted directed graph theGraph;
// theGraph’s weights are nonnegative
Create a set vertexSet that contains only vertex 0;
n = number of vertices in the Graph;
// Step 1
for (v=0 through n-1)
weight[v] = matrix[0][v];
// Steps 2 through n
for (step=2 through n) {
Find the smallest weight[v] such that v is not in vertexSet;
Add v to vertexSet;
for (all vertices u not in vertexSet)
if (weight[u] > weight[v]+matrix[v][u])
weigth[u] = weight[v]+matrix[v][u];
}
}
Algorithm is above if u try to find this algorithm but i think nobody develops a code for u here. Because it seems like it's your homework. right?
// Finds the minimum-cost paths between an origin vertex (vertex 0)
// and all other vertices in a weighted directed graph theGraph;
// theGraph’s weights are nonnegative
Create a set vertexSet that contains only vertex 0;
n = number of vertices in the Graph;
// Step 1
for (v=0 through n-1)
weight[v] = matrix[0][v];
// Steps 2 through n
for (step=2 through n) {
Find the smallest weight[v] such that v is not in vertexSet;
Add v to vertexSet;
for (all vertices u not in vertexSet)
if (weight[u] > weight[v]+matrix[v][u])
weigth[u] = weight[v]+matrix[v][u];
}
}
Algorithm is above if u try to find this algorithm but i think nobody develops a code for u here. Because it seems like it's your homework. right?
|
Similar Threads
- Dijkstra Algorithm (Computer Science)
- algorithm problem with recursion (Java)
- Dijkstra algorithm (Networking Hardware Configuration)
- Algorithm problem (Computer Science)
Other Threads in the C++ Forum
- Previous Thread: Pointer Conversion Problem
- Next Thread: Problem with searching and Edit
| Thread Tools | Search this Thread |
You need to join our community in order to build your list of favorite forums. You can visit the forum index for a listing of all forums.
Latest C++ Posts
- Today's Posts
- Unanswered Threads
Related Forum Features
api array arrays based beginner binary bitmap c++ c/c++ calculator char char* class classes coding compile compiler console conversion convert count data database delete desktop developer directshow dll dynamiccharacterarray email encryption error file forms fstream function functions game generator getline google graph homeworkhelper iamthwee ifstream input int integer java lib linkedlist linux list loop looping loops map math matrix memory multiple news node number numbertoword output parameter pointer problem program programming project proxy python random read recursion recursive reference return rpg sorting string strings struct template templates text tree unix url vector video visualstudio win32 windows winsock word wordfrequency wxwidgets
