dependency updates and misc. edits

Author: j50n

README.md

@@ -1,6 +1,7 @@
 # Dijkstra's Shortest Path Algorithm
 
-A pretty good implementation of Dijkstra's shortest-path algorithm for Deno.
+A fast and memory-efficient implementation of Dijkstra's shortest-path algorithm
+for Deno.
 
 If you ever run into a problem that can be represented as a graph where the
 solution has something to do with finding the shortest path between nodes, this

build

@@ -0,0 +1,7 @@
+#!/bin/bash 
+
+set -e
+
+deno fmt
+deno lint
+deno test

deps.ts

@@ -1 +1 @@
-export * from "https://deno.land/std@0.115.0/testing/asserts.ts";
+export * from "https://deno.land/std@0.122.0/testing/asserts.ts";