Implementation details for graphs. More...
Classes | |
| class | LocalIteratorFeature |
| struct | LocalIteratorFeature< false > |
| struct | EdgeSortReference |
| Proxy object for EdgeSortIterator. More... | |
| struct | EdgeSortCompWrapper |
| Converts comparison functions over EdgeTy to be over EdgeSortValue. More... | |
| class | EdgeSortIterator |
| Iterator to facilitate sorting of CSR-like graphs. More... | |
| class | IntrusiveId |
| class | IntrusiveId< void > |
| class | NoLockable |
| Empty class for HasLockable optimization. More... | |
| struct | NodeInfoBaseTypes |
| Separate types from definitions to allow incomplete types as NodeTy. More... | |
| struct | NodeInfoBaseTypes< void, HasLockable > |
| class | NodeInfoBase |
| Specializations for void node data. More... | |
| struct | NodeInfoBase< void, HasLockable > |
| class | OutOfLineLockableFeature |
| class | OutOfLineLockableFeature< false > |
| struct | EdgeInfoBase |
| Edge specialization for void edge data. More... | |
| class | EdgesIterator |
| Convenience wrapper around Graph.edge_begin and Graph.edge_end to allow C++11 foreach iteration of edges. More... | |
| class | InEdgesIterator |
| Convenience wrapper around Graph.in_edge_begin and Graph.in_edge_end to allow C++11 foreach iteration of in edges. More... | |
| class | EdgesWithNoFlagIterator |
Functions | |
| template<typename GN , typename EI , typename EdgeData , typename Data > | |
| void | swap (EdgeSortReference< GN, EI, EdgeData, Data > a, EdgeSortReference< GN, EI, EdgeData, Data > b) |
Implementation details for graphs.
| void Galois::Graph::detail::swap | ( | EdgeSortReference< GN, EI, EdgeData, Data > | a, | |
| EdgeSortReference< GN, EI, EdgeData, Data > | b | |||
| ) | [inline] |
1.6.1