•
•
•
•
What is DaniWeb IT Discussion Community?
You're currently browsing the C# section within the Software Development category of DaniWeb, a massive community of 402,044 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 2,446 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: Programming Forums
Views: 349 | Replies: 3 | Solved
 |
•
•
Join Date: Jul 2008
Posts: 3
Reputation: 
Rep Power: 0
Solved Threads: 0
Newbie Poster
Hi, everybody!
I am new to this forum.
I have a problem with an oriented weighted graph, more precisely, I have to find the shortest path between 2 nodes, but this path should pass through a given intermediary node. For example, I have a graph with 5 nodes, namely A, B, C, D, E. I have to find the shortest path from A to E, but this path should involve node C as well. With the weights the graph has, the shortest path should be, for example, A-B-D-E.
I used Dijkstra's algorithm to find the shortest path from A to E, that is the path A-B-D-E. That worked out fine. But I have no idea how I could change the code to accept the node that I am interested in, that is node C.
If you have any ideas, I would be very grateful to you.
Thanks a lot.
I am new to this forum.
I have a problem with an oriented weighted graph, more precisely, I have to find the shortest path between 2 nodes, but this path should pass through a given intermediary node. For example, I have a graph with 5 nodes, namely A, B, C, D, E. I have to find the shortest path from A to E, but this path should involve node C as well. With the weights the graph has, the shortest path should be, for example, A-B-D-E.
I used Dijkstra's algorithm to find the shortest path from A to E, that is the path A-B-D-E. That worked out fine. But I have no idea how I could change the code to accept the node that I am interested in, that is node C.
If you have any ideas, I would be very grateful to you.
Thanks a lot.
•
•
Join Date: Mar 2008
Posts: 23
Reputation:
Rep Power: 1
Solved Threads: 5
Newbie Poster
It seems to me that you need to break the search into 2 separate operations. For example, if you start at A and want to end up at E, going through C then you would calculate the shortest path from A to C, then calculate the shortest path from C to E.
•
•
Join Date: Jul 2008
Posts: 3
Reputation:
Rep Power: 0
Solved Threads: 0
Newbie Poster
Hi. Thank you a lot for the reply. I will use your idea and I will tell you the results.
Best regards.
Best regards.
|
•
•
•
•
•
•
•
•
DaniWeb C# Marketplace
•
•
•
•
Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)
Linear Mode
Similar Threads
- Graphs in vb.net? (VB.NET)
- Website - Graphs and Charts (Site Layout and Usability)
- Website that generates graphs and charts (PHP)
- chats and graphs (Java)
- graphs and trees (C)
- help needed to show Excel graphs (only) in VB window (Visual Basic 4 / 5 / 6)
- manipulating graphs in a GUI (Java)
- importing graphs onto GUI frame (Java)
Other Threads in the C# Forum
- Previous Thread: Beginner Q - UI update, different thread, different class.
- Next Thread: tree view
