fix highlighting maybe

This commit is contained in:
xenia 2020-07-14 02:36:39 -04:00
parent 6444adfe97
commit cae008347e
1 changed files with 1 additions and 1 deletions

View File

@ -22,7 +22,7 @@ provided file: <map.txt>
consider the intersections and roads to be a (weighted) graph and use dijkstra's algorithm to find 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) the shortest path. here is a solution in racket (because racket is good and you should use it)
```racket ```scheme
#lang racket #lang racket
(require graph) (require graph)