Skip to content

Data structures

Graphs, queues, union-find and spatial neighbour structures. The algorithms on them are on the Algorithms page.

Graphs <structures/graph/graph.hpp>

graph

Multigraphs <structures/graph/multigraph.hpp>

structures::multigraph – structures::multi_edge – structures::to_multigraph

Grid graphs <structures/graph/structured_grid.hpp>

structured_grid_graph

Union-find <structures/containers/disjoint_set.hpp>

disjoint_set – basic_disjoint_set – disjoint_set_32

Indexed priority queues <structures/containers/indexed_priority_queue.hpp>

indexed_priority_queue – min_indexed_pq – max_indexed_pq

Degree queues <structures/containers/degree_queue.hpp>

structures::degree_queue – structures::basic_degree_queue – structures::degree_queue_32

2D cell lists <spatial/cell_list.hpp>

cell_list_2d – integer_range

3D cell lists <spatial/cell_list_3d.hpp>

cell_list_3d

Verlet lists <spatial/verlet_list.hpp>

verlet_list_2d

Periodic lattices <spatial/pbc_lattice.hpp>

pbc_lattice_2d

SPH kernels <spatial/sph_kernel.hpp>

sph_kernel