7 May
2019
7 May
'19
9:18 a.m.
Gesendet: Dienstag, 07. Mai 2019 um 06:59 Uhr Von: "Stefan Seefeld via Boost"
[...] Rather, we can take one library at a time and apply the above rules. In fact, I imagine it to be possible to draw a graph that shows inbound (prerequisites) and outbound (dependencies) connections, so we can rank libraries such that we work our way from the outside inwards. The ones that no other boost libraries depend on, and which have the fewest boost prerequisites, can be converted first.
I guess you can use any of those tools (maybe slightly extended) to do that? https://github.com/jeking3/boost-deptree https://github.com/Mike-Devel/boost_dep_graph (self-plug) https://github.com/boostorg/boostdep Mike
Stefan