Changes between Version 6 and Version 7 of FirstMtglExample


Ignore:
Timestamp:
11/07/08 15:34:28 (10 years ago)
Author:
jberry
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • FirstMtglExample

    v6 v7  
    1212However, we'll start here without worrying about configuration or building.  Rather, we'll take an existing "C" code, write (more accurately, just use) an adapter [[media:static_graph_adapter.hpp]] for its graph data structure, and "MTGL-ize" key portions of the code.  Consider the data structure below.  This is a typical compressed sparse row adjacency matrix representation of a graph, as implemented by Kamesh Madduri.  It is useful when the graph doesn't change often, hence the name "static graph."  Algorithms written with the MTGL will work on arbitrary graph types, including those intended for more dynamic situations, but we'll focus this tutorial on the simple structure below. 
    1313 
    14 [[Image(static_graph_nw.jpg)]] 
     14[[Image(Static_graph.jpg)]] 
    1515 
    1616