Update todo

2025-10-06 19:25:20 +02:00
parent 5bf723928b
commit e879316a4c
1 changed files with 1 additions and 0 deletions
@@ -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()];