Jump to content
  • Advertisement


This topic is now archived and is closed to further replies.


Please help..

This topic is 5980 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

I''ve not implemented Dijkstra, but I''d guess it''s totally application specific.

Generally it would be the distance between the two nodes in your level, or if your terrain is sloped, the distance scaled by the "difficulty" of the slope.

Helpful links:
How To Ask Questions The Smart Way | Google can help with your question | Search MSDN for help with standard C or Windows functions

Share this post

Link to post
Share on other sites
Original post by HellRiZZer
Please, the only thing I need is how to find a cost of getting from one node to another.

The path cost in a search tree (graph structure) is the cost to traverse the arc in that graph. Since the graph represents a domain then the arc cost must be associated with a resource cost in the domain. What domain are you implementing Dijkstra''s for?


Share this post

Link to post
Share on other sites

  • Advertisement

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!