From e879316a4c84e893fce207e43ba5e2ca6a865c89 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Stefan=20M=C3=BCller?= <stefan.mueller@aksdb.de>
Date: Mon, 6 Oct 2025 19:25:20 +0200
Subject: [PATCH] Update todo

---
 src/main.rs | 1 +
 1 file changed, 1 insertion(+)

diff --git a/src/main.rs b/src/main.rs
index 5fc6937..1b99b6a 100644
--- a/src/main.rs
+++ b/src/main.rs
@@ -96,6 +96,7 @@ impl Ord for DistanceOrderedVertex {
 }
 
 // TODO: Maybe introduce a return struct type for Dijkstra's algorithm?
+// TODO: Maybe variant of Dijkstra's algorithm without predecessors?
 fn dijkstra(graph: &Graph, source: Vertex) -> (Vec<Option<u32>>, Vec<Option<Vertex>>) {
     let mut distances = vec![None; graph.vertex_count()];
     let mut predecessors = vec![None; graph.vertex_count()];