LUCAM Posted January 12 Share Posted January 12 Hi everyone, just wondering what algorithms the find shortest path node uses to calculate the shortest path, Ive been looking around but I can't figure out whether it's A/* or Dijkstra’s Algorithm - Luca Quote Link to comment Share on other sites More sharing options...
Darjeeling Posted 17 hours ago Share Posted 17 hours ago It’s safest to treat Find Shortest Path SOP as a Dijkstra-style weighted shortest-path solver. Houdini’s docs describe shortest-path computation in terms of running Dijkstra’s algorithm (for shortest paths on a graph), and the Find Shortest Path SOP is exactly “shortest paths along mesh edges with customizable costs.” https://www.sidefx.com/docs/houdini/nodes/sop/attribfill.html?utm_source=chatgpt.com Quote Link to comment Share on other sites More sharing options...
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.
Note: Your post will require moderator approval before it will be visible.