“>In the last article, I introduced you to the Boost Graph Library(BGL) and showed you how to apply the BGL in the implementation of a make-likesoftware build system. You constructed a graph object using theadjacency_list class with the add_edge and add_vertexfunctions, and you applied the topological_sort function to determinethe order in which files should be compiled. You useddepth_first_search to check whether there were any cycles in the filedependencies. This next challenge is t
continue >>
Author:
Time:
Wednesday, February 6th, 2008 at 1:15 pm
Category:
Comments:
You can leave a response, or trackback from your own site.
RSS:
You can follow any responses to this entry through the RSS 2.0 feed.
Navigation: