warrence/grapherity
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add todos

Browse Source
This commit is contained in:
Stefan Müller
2026-07-31 10:24:51 +02:00
parent afaf161344
commit 53a6bed932
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/algorithms.rs
+2
View File
@@ -61,6 +61,7 @@ pub struct DijkstraResult<V: Copy> {
} }
// TODO: Generalize the return type of the weight function. // TODO: Generalize the return type of the weight function.
// TODO: Add complexity information for Dijkstra's algorithm variants.
/// [Dijkstra's algorithm] with custom edge weights, returns minimum distances and predecessors. /// [Dijkstra's algorithm] with custom edge weights, returns minimum distances and predecessors.
/// ///
/// Calculates the shortest paths from `source` to all vertices in `graph` with edge weights given /// Calculates the shortest paths from `source` to all vertices in `graph` with edge weights given
@@ -459,6 +460,7 @@ where
} }
} }
// TODO: 'visited' is already encoded in 'predecessors', except for 'source', which is visited, but has no predecessor.
/// Return data type for [`dfs`]. /// Return data type for [`dfs`].
pub struct DfsResult<V: Copy> { pub struct DfsResult<V: Copy> {
/// Vertex map indicating which vertices were visited during the search. /// Vertex map indicating which vertices were visited during the search.