summaryrefslogtreecommitdiffstats
path: root/src/graph.rs
diff options
context:
space:
mode:
authorJesse Luehrs <doy@tozt.net>2022-12-11 21:59:21 -0500
committerJesse Luehrs <doy@tozt.net>2022-12-11 22:16:30 -0500
commite2d219b331a878bbb3c9dcef9ea4e218b2e3ee06 (patch)
tree93e418011c45cab8d4070d3d33b377a9364f4a27 /src/graph.rs
parent179467096141b7e8f67d63b89fd21e779a564fe6 (diff)
downloadadvent-of-code-e2d219b331a878bbb3c9dcef9ea4e218b2e3ee06.tar.gz
advent-of-code-e2d219b331a878bbb3c9dcef9ea4e218b2e3ee06.zip
refactor
Diffstat (limited to 'src/graph.rs')
-rw-r--r--src/graph.rs4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/graph.rs b/src/graph.rs
index 831cc17..74c2910 100644
--- a/src/graph.rs
+++ b/src/graph.rs
@@ -7,9 +7,9 @@ where
type Edges: IntoIterator<Item = Edge>;
fn edges(&self, v: Vertex) -> Self::Edges;
- fn edge(&self, v: Vertex, e: Edge) -> (Vertex, i64);
+ fn edge(&self, v: Vertex, e: Edge) -> (Vertex, u64);
- fn dijkstra(&self, start: Vertex, end: Vertex) -> (i64, Vec<Vertex>) {
+ fn dijkstra(&self, start: Vertex, end: Vertex) -> (u64, Vec<Vertex>) {
let mut to_visit = priority_queue::PriorityQueue::new();
let mut prev = HashMap::new();
prev.insert(start, start);