FirstGraph.h File Reference

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

#include "Galois/Bag.h"
#include "Galois/Graph/Details.h"
#include "Galois/Runtime/MethodFlags.h"
#include "llvm/ADT/SmallVector.h"
#include <boost/functional.hpp>
#include <boost/iterator/transform_iterator.hpp>
#include <boost/iterator/filter_iterator.hpp>
#include <algorithm>
#include <map>
#include <set>
#include <vector>

Go to the source code of this file.

Classes
struct	Galois::Graph::FirstGraphImpl::UEdgeInfoBase< NTy, ETy, true >
struct	Galois::Graph::FirstGraphImpl::UEdgeInfoBase< NTy, ETy, false >
struct	Galois::Graph::FirstGraphImpl::UEdgeInfoBase< NTy, void, true >
struct	Galois::Graph::FirstGraphImpl::UEdgeInfoBase< NTy, void, false >
struct	Galois::Graph::FirstGraphImpl::EdgeFactory< ETy >
struct	Galois::Graph::FirstGraphImpl::EdgeFactory< void >
class	Galois::Graph::FirstGraph< NodeTy, EdgeTy, Directional, HasNoLockable >
	A Graph. More...
struct	Galois::Graph::FirstGraph< NodeTy, EdgeTy, Directional, HasNoLockable >::with_no_lockable< _has_no_lockable >
	If true, do not use abstract locks in graph. More...
struct	Galois::Graph::FirstGraph< NodeTy, EdgeTy, Directional, HasNoLockable >::first_eq_and_valid< T >
struct	Galois::Graph::FirstGraph< NodeTy, EdgeTy, Directional, HasNoLockable >::first_not_valid
struct	Galois::Graph::FirstGraph< NodeTy, EdgeTy, Directional, HasNoLockable >::gNodeTypes
class	Galois::Graph::FirstGraph< NodeTy, EdgeTy, Directional, HasNoLockable >::gNode
struct	Galois::Graph::FirstGraph< NodeTy, EdgeTy, Directional, HasNoLockable >::is_node
struct	Galois::Graph::FirstGraph< NodeTy, EdgeTy, Directional, HasNoLockable >::is_edge
struct	Galois::Graph::FirstGraph< NodeTy, EdgeTy, Directional, HasNoLockable >::makeGraphNode
Namespaces
namespace	Galois
	Main Galois namespace.
namespace	Galois::Graph
	Parallel graph data structures.
namespace	Galois::Graph::FirstGraphImpl

---

Detailed Description

Basic morph graphs -*- C++ -*-.

License

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

Copyright (C) 2013, 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

Author:

Andrew Lenharth <andrewl@lenharth.org>