diff --git a/docs/docs/examples/example-basics/dot-serialization.md b/docs/docs/examples/example-basics/dot-serialization.md
index 78b4e0d5..56e3a6c0 100644
--- a/docs/docs/examples/example-basics/dot-serialization.md
+++ b/docs/docs/examples/example-basics/dot-serialization.md
@@ -56,7 +56,7 @@ const auto vertex_writer{[](graaf::vertex_id_t vertex_id,
**Edge writer**
```c++
-const auto edge_writer{[](const graaf::vertex_ids_t& /*edge_id*/,
+const auto edge_writer{[](const graaf::edge_id_t& /*edge_id*/,
const my_edge& edge) -> std::string {
const auto style{edge.priority == edge_priority::HIGH ? "solid" : "dashed"};
return fmt::format("label=\"{}\", style={}, color=gray, fontcolor=gray", edge.weight, style);
@@ -94,4 +94,4 @@ for easy visualization:
-
\ No newline at end of file
+
diff --git a/docs/docs/examples/example-basics/shortest-path.md b/docs/docs/examples/example-basics/shortest-path.md
index 5bf8b41c..8be14853 100644
--- a/docs/docs/examples/example-basics/shortest-path.md
+++ b/docs/docs/examples/example-basics/shortest-path.md
@@ -30,7 +30,7 @@ First, we create a datastructure of all edges on the shortest path such that we
```c++
// We use a set here for O(1) time contains checks
-std::unordered_set edges_on_shortest_path{};
+std::unordered_set edges_on_shortest_path{};
// Convert the list of vertices on the shortest path to edges
graaf::vertex_id_t prev{shortest_path.vertices.front()};
@@ -55,7 +55,7 @@ const auto vertex_writer{
}};
const auto edge_writer{
-[&edges_on_shortest_path](const graaf::vertex_ids_t& edge_id, int edge) -> std::string {
+[&edges_on_shortest_path](const graaf::edge_id_t& edge_id, int edge) -> std::string {
if (edges_on_shortest_path.contains(edge_id)) {
return "label=\"\", color=red";
}
@@ -69,4 +69,4 @@ This yields us the following visualization:
-
\ No newline at end of file
+