* Parse generic baggage types more carefully to preserve inner structure
* Add example
* Way too many clones
* Allow multiple generic arguments for baggage fields
* Try to detect errors earlier
* Support more types for the baggage fields, get rid of the path constraint
* extract graph
* move into scope
* remove dead code
* add special nodes
* avoid some clones
* better doc
* maybe better to use ✨
* print all cycles, or an error
Currently kosaraju_scc returns invalid cycles, which is yet to be investigated.
* don't print tiny cycles, if there is nothing to unvisited anymore, there is a cycle
* make print better
* fmt ffs
* correct: cycle -> scc
A strongly connected cluster contains at least one cycl, but could include more.
So this should be distringuished in the implementation to avoid some confusion.
* fix loop exit condition
* add a test for kosaraju behavior
* unify on 'component'
* disable graph by default
https://github.com/paritytech/ci_cd/issues/433
* chore: fmt
* move graph only to graph_helpers
Vsevolod Stakhov