Getting shortest path between 2 nodes in quickgraph
Posted
by Xtapodi
on Stack Overflow
See other posts from Stack Overflow
or by Xtapodi
Published on 2010-04-28T20:32:35Z
Indexed on
2010/04/28
22:57 UTC
Read the original article
Hit count: 298
Hello, i want to ask if there is any way to generate the shortest path from node A to node B without generating the shortest paths to all the other nodes (stop when node B is in the examined set) with A-star in QuickGraph.
I want to plug QuickGraph into a game and thus generating all the paths is not allowed from the time limitations the environment imposes.
Any other suggestions to solve my problem in C# are welcome
Thanks in advance, Xtapodi
© Stack Overflow or respective owner