graph.hpp File Reference

#include <functional>
#include <vector>
#include <optional>
#include <queue>
#include <stack>
#include <cassert>
#include <unordered_set>
#include <unordered_map>

Include dependency graph for graph.hpp:

Go to the source code of this file.

Namespaces
namespace	hsc_snippets

Functions
static std::vector< std::vector< std::pair< int, int > > >	hsc_snippets::make_weighted_directed_adjacency_list (int n, const std::vector< std::vector< int > > &edges)
static std::vector< std::vector< int > >	hsc_snippets::make_unweighted_undirected_adjacency_list (int n, const std::vector< std::vector< int > > &edges)
static std::vector< std::vector< std::pair< int, int > > >	hsc_snippets::make_weighted_undirected_adjacency_list (int n, const std::vector< std::vector< int > > &edges)
static std::vector< std::vector< int > >	hsc_snippets::make_unweighted_directed_adjacency_list (int n, const std::vector< std::vector< int > > &edges)
static void	hsc_snippets::breadth_first_search (std::vector< std::vector< int > > &adjacency_list, int root, std::function< void(int, int)> callback)
static void	hsc_snippets::breadth_first_search (std::unordered_map< int, std::vector< int > > &adjacency_list, int root, std::function< void(int, int)> callback)
static void	hsc_snippets::depth_first_search (std::vector< std::vector< int > > &adjacency_list, int root, std::function< void(int, int)> callback)
static int	hsc_snippets::dijkstra (int n, const std::vector< std::vector< std::pair< int, int > > > &adjacency_list, int src, int dst)
static std::vector< int >	hsc_snippets::find_euler_path_directed (const std::vector< std::vector< int > > &edges)
static std::vector< std::vector< int > >	hsc_snippets::find_connected_components (std::unordered_map< int, std::vector< int > > &adj)
static int	hsc_snippets::count_connected_components (const std::unordered_map< int, std::vector< int > > &adj)