FileGraph.h File Reference

Basic serialized graphs -*- C++ -*-. More...

#include "Galois/Graphs/Graph.h"
#include <boost/iterator/counting_iterator.hpp>

Go to the source code of this file.

Classes
class	Galois::Graph::FileGraph
	Graph serialized to a file. More...
class	Galois::Graph::LC_FileGraph< NodeTy, EdgeTy >
	Local computation graph (i.e., graph structure does not change). More...
struct	Galois::Graph::LC_FileGraph< NodeTy, EdgeTy >::gNode
class	Galois::Graph::LC_FileGraph< NodeTy, void >
struct	Galois::Graph::LC_FileGraph< NodeTy, void >::gNode
class	Galois::Graph::LC_FileGraph< void, void >
Namespaces
namespace	Galois
namespace	Galois::Graph

---

Detailed Description

Basic serialized graphs -*- C++ -*-.

License

Galois, a framework to exploit amorphous data-parallelism in irregular programs.

Copyright (C) 2011, The University of Texas at Austin. All rights reserved. UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS SOFTWARE AND DOCUMENTATION, INCLUDING ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR ANY PARTICULAR PURPOSE, NON-INFRINGEMENT AND WARRANTIES OF PERFORMANCE, AND ANY WARRANTY THAT MIGHT OTHERWISE ARISE FROM COURSE OF DEALING OR USAGE OF TRADE. NO WARRANTY IS EITHER EXPRESS OR IMPLIED WITH RESPECT TO THE USE OF THE SOFTWARE OR DOCUMENTATION. Under no circumstances shall University be liable for incidental, special, indirect, direct or consequential damages or loss of profits, interruption of business, or related expenses which may arise from use of Software or Documentation, including but not limited to those resulting from defects in Software and/or Documentation, or loss or inaccuracy of data of any kind.

Description

There are two main classes, FileGraph and LC_FileGraph. The former represents the pure structure of a graph (i.e., whether an edge exists between two nodes) and cannot be modified. The latter allows values to be stored on nodes and edges, but the structure of the graph cannot be modified.

An example of use:

 typedef Galois::Graph::LC_FileGraph<int,int> Graph;
 
 // Create graph
 Graph g;
 g.structureFromFile(inputfile);

 // Traverse graph
 for (Graph::active_iterator i = g.active_begin(), iend = g.active_end();
      i != iend;
      ++i) {
   Graph::GraphNode src = *i;
   for (Graph::neighbor_iterator j = g.neighbor_begin(src),
                                 jend = g.neighbor_end(src);
        j != jend;
        ++j) {
     Graph::GraphNode dst = *j;
     int edgeData = g.getEdgeData(src, dst);
     int nodeData = g.getData(dst);
   }
 }

Author:

Andrew Lenharth <andrewl@lenharth.org>