Changes between Version 1 and Version 2 of AboutTheExamples
 Timestamp:
 Nov 4, 2006 1:26:21 PM (15 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

AboutTheExamples
v1 v2 1 There are several examples in the examples subdirectory: 1 = Cgc examples = 2 There are several examples in the examples subdirectory. They demonstrate the use of each of the containers, as well as each of the algorithms. 2 3 3 4 Simple:: … … 11 12 * Demonstrate the use of a DynNet and a destructive example of removing a node on the fly 12 13 SSPSolver:: 13 This is a comprehensive example showing much more complex usage of the graph @li more complex data storage on nodes @li more complex data storea on arcs @li implements a well known algorithm for solving min cost network flow problems (Successive Shortest Paths) There is a reference in the code to the source of the algorithm. 14 This is a comprehensive example showing much more complex usage of the graph 15 * More complex data storage on nodes 16 * More complex data storea on arcs 17 * Implements a 'well known' algorithm for solving min cost network flow problems (Successive Shortest Paths) There is a reference in the code to the source of the algorithm. 14 18 15 19 For more detailed code information see the doxygen generated comments for more information on the particular classes. In particular, peruse the "Public Interface" module comments.