Further algorithms that are suitable for NoGraphs? #12
Replies: 3 comments 4 replies
-
Suggestion: DFS with iterative deepening Pro:
|
Beta Was this translation helpful? Give feedback.
-
Being totally agreed about library bloat, I don't see a problem about having support materials in form such as |
Beta Was this translation helpful? Give feedback.
-
Suggestion: Computing strongly connected components (of the sub-graph reachable from a set of vertices), e.g., with algorithms like described here. These are linear-time algorithms that can be applied to directed graphs. |
Beta Was this translation helpful? Give feedback.
Uh oh!
There was an error while loading. Please reload this page.
-
NoGraphs is focused on graph algorithms that make sense for its domain: „Graphs that can not or should not be fully computed, stored or adapted.“. And it only provides algorithms that are „often“ helpful, because library bloat should be prevented. But there might be more algorithms that fulfill these selection criteria.
Any suggestions? And why is the suggested algorithm suited for NoGraphs?
Beta Was this translation helpful? Give feedback.
All reactions