directed graph (as defined by graph theory) in compressed row format More...
#include <Omega_h_graph.hpp>
Inheritance diagram for Omega_h::Graph:
Public Member Functions | |
| Graph (LOs ab2b_) | |
| Graph (LOs a2ab_, LOs ab2b_) | |
| LO | nnodes () const |
| LO | nedges () const |
Public Attributes | |
| LOs | a2ab |
| LOs | ab2b |
Detailed Description
directed graph (as defined by graph theory) in compressed row format
the typical access pattern: using a serial CPU backend for (LO a = 0; a < na; ++a) { for (auto ab = a2ab[a]; ab < a2ab[a + 1]; ++ab) { auto b = ab2b[ab]; // do something with the (a,b) pair } }
The documentation for this struct was generated from the following files:
- src/Omega_h_graph.hpp
- src/Omega_h_graph.cpp
