Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
thaumasiotes
4 months ago
|
parent
|
context
|
favorite
| on:
Possibly all the ways to get loop-finding in graph...
This looks like a dynamic programming problem taking space proportional to |ring length|*|key length|. By that analysis, graphs don't really come into it.
What's the graph-theoretical approach? Does it have nicer characteristics?
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
What's the graph-theoretical approach? Does it have nicer characteristics?