Skip to main content
MathOverflow
user2512443's user avatar
user2512443's user avatar
user2512443's user avatar
user2512443
  • Member for 2 years, 9 months
  • Last seen more than 1 year ago
  • Seattle, WA, USA
Profile Activity

5 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
comment
$A^*$ algorithm to find shortest path when weights in my graph are the inverse of distance
Thank you for the response. Does this prove that there is no heuristic for this?
awarded
 Student
awarded
 Supporter
asked
$A^*$ algorithm to find shortest path when weights in my graph are the inverse of distance
awarded
 Autobiographer