GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — boost_graph/example/file_dependencies.expected at develop · stdgraph/boost_graph Expand file tree/ Copy pathfile_dependencies.expectedMore file actions 28 lines (23 loc) · 753 Bytes / Copy pathfile_dependencies.expectedFile metadata and controls28 lines (23 loc) · 753 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 make ordering: zow.h boz.h zig.cpp zig.o dax.h yow.h zag.cpp zag.o bar.cpp bar.o foo.cpp foo.o libfoobar.a libzigzag.a killerapp parallel make ordering, vertices with same group number can be made in parallel time_slot[dax.h] = 0 time_slot[yow.h] = 1 time_slot[boz.h] = 0 time_slot[zow.h] = 0 time_slot[foo.cpp] = 1 time_slot[foo.o] = 2 time_slot[bar.cpp] = 2 time_slot[bar.o] = 3 time_slot[libfoobar.a] = 4 time_slot[zig.cpp] = 1 time_slot[zig.o] = 2 time_slot[zag.cpp] = 2 time_slot[zag.o] = 3 time_slot[libzigzag.a] = 5 time_slot[killerapp] = 6 A change to yow.h will cause what to be re-made? yow.h bar.cpp zag.cpp bar.o zag.o libfoobar.a libzigzag.a killerapp The graph has a cycle? 0 adding edge bar_cpp -> dax_h The graph has a cycle now? 1 |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |