graphProcessing.h File Reference

---

Detailed Description

Brief Overview of Algorithm:.

Current Implementation

This implementation uses BOOSTs graph structure to analyze the paths of the graph

The path analyzer sends the user paths to be evaluated by the "analyzePath" function that is user defined

Further Improvements: TODO

Todo:

utilize BOOST visitors to take advantage of the BOOST graph structures abilities

Contact Info

Finally, blame can be assigned to and questions can be forwarded to the author, though response is not guaranteed

if I'm still at Lawrence hoffman34 AT llnl DOT gov

Author:

Michael Hoffman

Definition in file graphProcessing.h.

#include <boost/regex.hpp>
#include <iostream>
#include <fstream>
#include <string>
#include <assert.h>
#include <staticCFG.h>
#include <boost/graph/adjacency_list.hpp>
#include <boost/bind.hpp>
#include <boost/foreach.hpp>
#include <boost/tuple/tuple.hpp>
#include <boost/graph/graphviz.hpp>
#include <boost/graph/dominator_tree.hpp>
#include <boost/graph/reverse_graph.hpp>
#include <boost/graph/transpose_graph.hpp>
#include <boost/algorithm/string.hpp>
#include <vector>
#include <algorithm>
#include <utility>
#include <sys/time.h>
#include <sys/resource.h>

Include dependency graph for graphProcessing.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	SgGraphTraversal< CFG >
Defines
#define	LP   1
#define	PERFDEBUG   0

---

Define Documentation

#define LP   1

Definition at line 10 of file graphProcessing.h.

#define PERFDEBUG   0

Definition at line 11 of file graphProcessing.h.

---