Re:Possibly all the ways to get loop-finding in graphs wrong
by thaumasiotes on Thursday September 12, 2024 @02:07AM
(#41518014)
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?
What's the graph-theoretical approach? Does it have nicer characteristics?