diff --git a/graph/bidirectional_dijkstra.cpp b/graph/bidirectional_dijkstra.cpp
index deef66227..5f6d36928 100644
--- a/graph/bidirectional_dijkstra.cpp
+++ b/graph/bidirectional_dijkstra.cpp
@@ -14,6 +14,7 @@
  */
 
 #include <cassert>   /// for assert
+#include <cstdint>   /// for integral typedefs
 #include <iostream>  /// for io operations
 #include <limits>    /// for variable INF
 #include <queue>     /// for the priority_queue of distances
diff --git a/graph/connected_components_with_dsu.cpp b/graph/connected_components_with_dsu.cpp
index c0194e851..72c4f34fe 100644
--- a/graph/connected_components_with_dsu.cpp
+++ b/graph/connected_components_with_dsu.cpp
@@ -3,20 +3,24 @@
  * @brief [Disjoint union](https://en.wikipedia.org/wiki/Disjoint_union)
  *
  * @details
- * The Disjoint union is the technique to find connected component in graph efficiently.
+ * The Disjoint union is the technique to find connected component in graph
+ * efficiently.
  *
  * ### Algorithm
- * In Graph, if you have to find out the number of connected components, there are 2 options
+ * In Graph, if you have to find out the number of connected components, there
+ * are 2 options
  * 1. Depth first search
  * 2. Disjoint union
- * 1st option is inefficient, Disjoint union is the most optimal way to find this.
+ * 1st option is inefficient, Disjoint union is the most optimal way to find
+ * this.
  *
  * @author Unknown author
  * @author [Sagar Pandya](https://github.com/sagarpandyansit)
  */
-#include <iostream> /// for IO operations
-#include <set>    /// for std::set
-#include <vector> /// for std::vector
+#include <cstdint>   /// for integer typedefs
+#include <iostream>  /// for IO operations
+#include <set>       /// for std::set
+#include <vector>    /// for std::vector
 
 /**
  * @namespace graph
@@ -25,7 +29,8 @@
 namespace graph {
 /**
  * @namespace disjoint_union
- * @brief Functions for [Disjoint union](https://en.wikipedia.org/wiki/Disjoint_union) implementation
+ * @brief Functions for [Disjoint
+ * union](https://en.wikipedia.org/wiki/Disjoint_union) implementation
  */
 namespace disjoint_union {
 uint32_t number_of_nodes = 0;                // denotes number of nodes
diff --git a/graph/cycle_check_directed_graph.cpp b/graph/cycle_check_directed_graph.cpp
index 8a651cfc5..fbe6063ca 100644
--- a/graph/cycle_check_directed_graph.cpp
+++ b/graph/cycle_check_directed_graph.cpp
@@ -7,6 +7,7 @@
  *
  */
 
+#include <cstdint>      /// for integral typedefs
 #include <iostream>     // for std::cout
 #include <map>          // for std::map
 #include <queue>        // for std::queue
diff --git a/graph/is_graph_bipartite2.cpp b/graph/is_graph_bipartite2.cpp
index f1b04d070..d55f2c84b 100644
--- a/graph/is_graph_bipartite2.cpp
+++ b/graph/is_graph_bipartite2.cpp
@@ -15,6 +15,7 @@
  * @author [tushar2407](https://github.com/tushar2407)
  */
 #include <cassert>   /// for assert
+#include <cstdint>   /// for integral typedefs
 #include <iostream>  /// for IO operations
 #include <queue>     /// for queue data structure
 #include <vector>    /// for vector data structure
diff --git a/graph/travelling_salesman_problem.cpp b/graph/travelling_salesman_problem.cpp
index 28df3e931..8b4608009 100644
--- a/graph/travelling_salesman_problem.cpp
+++ b/graph/travelling_salesman_problem.cpp
@@ -19,6 +19,7 @@
 
 #include <algorithm>  /// for std::min
 #include <cassert>    /// for assert
+#include <cstdint>    /// for integral typedefs
 #include <iostream>   /// for IO operations
 #include <limits>     /// for limits of integral types
 #include <vector>     /// for std::vector