On Wed, 2017-05-24 at 15:14 +0000, William Harrington wrote: > In the past I have attempted to use topological sorting (tsort). This > method takes a bit of time if you start with an App with a lot of > deps. A rought example through book and required/recommended deps and > coming up with something for Vim (have to work through the circular > deps): >
And the easiest way to implement a topo sort is to re-use Make, since translating a dependency graph into a linear ordering is pretty much what Make is designed for. That's how my B/LFS system used to be maintained... a script to generate a Makefile from sources like the books. Simon.
signature.asc
Description: This is a digitally signed message part
-- http://lists.linuxfromscratch.org/listinfo/blfs-support FAQ: http://www.linuxfromscratch.org/blfs/faq.html Unsubscribe: See the above information page
