Update roadmap

Author: flowtoolz

README.md

@@ -220,16 +220,14 @@ SwiftNodes is already being used in production, but [Codeface](https://codeface.
 
 ## Roadmap
 
-1. Further align API with official Swift data structures (What would Apple do?):
-   1. Add the usual suspects of applicable protocol conformances (`Sequence`/`Collection`)
-   2. Compare with- and learn from API and implementation of [Swift Collections](https://github.com/apple/swift-collections)
-2. Round out and add algorithms (starting with the needs of Codeface):
-   1. Make existing algorithms compatible with cyclic graphs (two of them are still not)
-   2. General purpose graph traversal algorithms (BFT, DFT, compatible with potentially cyclic graphs)
+1. Round out and add algorithms (starting with the needs of Codeface):
+   1. Make existing algorithms compatible with cycles (two algorithms are still not). meaning: don't hang or crash, maybe throw an error!
+   2. Add general purpose graph traversal algorithms (BFT, DFT, compatible with potentially cyclic graphs)
    3. Model edge weights so they *can* be considered in algorithms like Dijkstra. Do we really need a third type parameter for `Graph`? Or just use `Double` as universal weight type? Do we merge that with edge count or keep both distinct?
-   4. Around here we should be able to move to version 1.0.0 if documentation is complete and up to date
-   5. Better ways of topological sorting
-   6. Approximate the [minimum feedback arc set](https://en.wikipedia.org/wiki/Feedback_arc_set), so Codeface can guess "faulty" or unintended dependencies, i.e. the fewest dependencies that need to be cut in order to break all cycles.
-3. Possibly optimize performance – but only based on measurements and only if measurements show that the optimization yields significant acceleration. Optimizing the algorithms might be more effective than optimizing the data structure itself.
+   4. Update and complete documentation
+   5. Move to version 1.0.0 if possible
+   6. Add better ways of topological sorting
+   7. Approximate the [minimum feedback arc set](https://en.wikipedia.org/wiki/Feedback_arc_set), so Codeface can guess "faulty" or unintended dependencies, i.e. the fewest dependencies that need to be cut in order to break all cycles.
+2. Possibly optimize performance – but only based on measurements and only if measurements show that the optimization yields significant acceleration. Optimizing the algorithms might be more effective than optimizing the data structure itself.
     * What role does `@inlinable` play here?
     * What role does [`lazy`](https://developer.apple.com/documentation/swift/sequence/lazy) play here?