•
•
•
•
What is DaniWeb IT Discussion Community?
You're currently browsing the C++ section within the Software Development category of DaniWeb, a massive community of 392,076 software developers, web developers, Internet marketers, and tech gurus who are all enthusiastic about making contacts, networking, and learning from each other. In fact, there are 4,053 IT professionals currently interacting right now! Registration is free, only takes a minute and lets you enjoy all of the interactive features of the site.
Please support our C++ advertiser:
Views: 3796 | Replies: 9
 |
•
•
Join Date: Nov 2006
Posts: 2
Reputation: 
Rep Power: 0
Solved Threads: 0
Newbie Poster
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: Nov 2006
Posts: 7
Reputation:
Rep Power: 0
Solved Threads: 1
Newbie Poster
Re: dijkstra algorithm problem in c++ what is this dijkstra algorith. (i'm sorry if i am less informed about the topic)
•
•
Join Date: Aug 2005
Location: near St Louis, Missouri, USA
Posts: 10,562
Reputation: 
Rep Power: 36
Solved Threads: 860
Here is some pseudocode code
I think it's about time we voted for senators with breasts. After all, we've been voting for boobs long enough. ~Clarie Sargent, Arizona senatorial candidate
Those who are too smart to engage in politics are punished by being governed by those who are dumber. ~Plato
Those who are too smart to engage in politics are punished by being governed by those who are dumber. ~Plato
•
•
Join Date: Nov 2006
Posts: 2
Reputation:
Rep Power: 0
Solved Threads: 0
Newbie Poster
how I can use stack and queue to find shortest path ?
•
•
Join Date: Aug 2005
Posts: 4,668
Reputation:
Rep Power: 17
Solved Threads: 298
>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.
Member of: F-ugly code club
Join today don't delay!
Join today don't delay!
•
•
Join Date: Mar 2007
Posts: 7
Reputation:
Rep Power: 0
Solved Threads: 0
Newbie Poster
•
•
•
•
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
I will try to code it for you in the following days and i will post it on your thread hopefully.
Begueradj.
•
•
Join Date: Oct 2006
Location: the Netherlands
Posts: 1,578
Reputation:
Rep Power: 8
Solved Threads: 159
•
•
•
•
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.
You do realize that the question was asked 1,5 years ago right?
do NOT pm me for help, it makes me angry. You wouldn't like me when I'm angry...
•
•
Join Date: Mar 2007
Posts: 7
Reputation:
Rep Power: 0
Solved Threads: 0
Newbie Poster
i did not realize that 
•
•
Join Date: Nov 2007
Posts: 4
Reputation:
Rep Power: 0
Solved Threads: 0
Newbie Poster
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?
•
•
Join Date: Feb 2008
Location: Seattle
Posts: 699
Reputation:
Rep Power: 4
Solved Threads: 45
Practically a Master Poster
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?)
and to think we were just getting ready to close this one out as "unsolved"
*whew*
(next time, please dont wait so long, mmmkay?)
Why so serious?
|
•
•
•
•
Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)
•
•
•
•
•
•
•
•
DaniWeb C++ Marketplace
Linear Mode
- Dijkstra Algorithm (Computer Science and Software Design)
- algorithm problem with recursion (Java)
- Dijkstra algorithm (Networking Hardware Configuration)
- Algorithm problem (Computer Science and Software Design)
Other Threads in the C++ Forum
- Previous Thread: Pointer Conversion Problem
- Next Thread: Problem with searching and Edit
