Skip to content

Fix missing #include in Windows #153

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
pratzl merged 1 commit into from
May 25, 2025
Merged

Fix missing #include in Windows #153

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 3 additions & 2 deletions include/graph/algorithm/connected_components.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
/**
/**
* @file connected_components.hpp
*
* @brief Single-Source Shortest paths and shortest sistances algorithms using Dijkstra &
Expand All @@ -21,6 +21,7 @@
#include "graph/views/breadth_first_search.hpp"
#include <stack>
#include <random>
#include <numeric>

#ifndef GRAPH_CC_HPP
# define GRAPH_CC_HPP
Expand Down Expand Up @@ -155,7 +156,7 @@ template <typename vertex_id_t, random_access_range Component>
static vertex_id_t sample_frequent_element(Component& component, size_t num_samples = 1024) {
std::unordered_map<vertex_id_t, int> counts(32);
std::mt19937 gen;
std::uniform_int_distribution<vertex_id_t> distribution(0, component.size() - 1);
std::uniform_int_distribution<vertex_id_t> distribution(0, static_cast<vertex_id_t>(component.size() - 1));

for (size_t i = 0; i < num_samples; ++i) {
vertex_id_t sample = distribution(gen);
Expand Down
Loading