Algorithms

Graph traversal, shortest paths, spanning trees, connectivity, clique sampling and graph generators. The structures they run on are on the Data structures page.

Traversal and paths <structures/algorithms/traversal.hpp>

structures::bfs – structures::dfs – structures::dijkstra – structures::minimum_spanning_tree – structures::connected_components – structures::is_connected

Clusters on a lattice <spatial/connected_components.hpp>

connected_components – cluster_result

Cliques <structures/graph/clique.hpp>

structures::sample_clique – structures::sample_clique_tree – structures::sample_biclique_tree – structures::add_exact_clique – structures::collect_neighbors

Generators <structures/graph/generators.hpp>

structures::complete_graph – structures::cycle_graph – structures::path_graph – structures::star_graph – structures::grid_2d – structures::erdos_renyi – structures::random_spanning_tree