dijkstra algorithm problem in c++

[myleila]

I have problem with dijkstra algorithm
I want to write it in c++ and can not describe it in c++ //
please help me

[johnpeter1989]

what is this dijkstra algorith. (i'm sorry if i am less informed about the topic)

[Ancient Dragon]

Here is some pseudocode code

[myleila]

how I can use stack and queue to find shortest path ?

[iamthwee]

>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.

[begueradj]

I have problem with dijkstra algorithm
I want to write it in c++ and can not describe it in c++ //
please help me

I will try to code it for you in the following days and i will post it on your thread hopefully.
Begueradj.

[Nick Evan]

I will try to code it for you in the following days and i will post it on your thread hopefully.
Begueradj.

You do realize that the question was asked 1,5 years ago right?

[begueradj]

i did not realize that :(

[omeralper]

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?

[jephthah]

Thank the gods you finally arrived to give us the answer to this perplexing problem.

and to think we were just getting ready to close this one out as "unsolved"

*whew*

(next time, please dont wait so long, mmmkay?)