Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
londons_explore
on Jan 22, 2023
|
parent
|
context
|
favorite
| on:
Negative-weight single-source shortest paths in ne...
Yes, but the 'lowest' cost path is then travel to cycle, go round loop infinity times, and then go to destination.
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: