From fc0d0900b9e4a42a6a0dc7a99a7f1517e873012f Mon Sep 17 00:00:00 2001 From: Greg Roach Date: Mon, 19 Oct 2015 12:13:57 +0100 Subject: [PATCH] Typo in README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index bdc9283..cf99d2f 100644 --- a/README.md +++ b/README.md @@ -20,7 +20,7 @@ shortest path(s) between two nodes in a weighted, directed graph. Graphs are specified as an array of edges, each with a cost. The example below is an undirected graph (i.e. if D→E is 9, then E→D is also 9.), because it is easy to -understand and easy to draw. However, the algorithm works equally well for undirected +understand and easy to draw. However, the algorithm works equally well for directed graphs, where links can be one-way only or have different costs in each direction. ``` D---9---E