From cae008347eff319e7d585084de47b1c4554530af Mon Sep 17 00:00:00 2001 From: haskal Date: Tue, 14 Jul 2020 02:36:39 -0400 Subject: [PATCH] fix highlighting maybe --- 2020/rgbctf/picking-pieces/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/2020/rgbctf/picking-pieces/README.md b/2020/rgbctf/picking-pieces/README.md index f37c32c..2e4e527 100644 --- a/2020/rgbctf/picking-pieces/README.md +++ b/2020/rgbctf/picking-pieces/README.md @@ -22,7 +22,7 @@ provided file: consider the intersections and roads to be a (weighted) graph and use dijkstra's algorithm to find the shortest path. here is a solution in racket (because racket is good and you should use it) -```racket +```scheme #lang racket (require graph)