Commit 1a18101

committed

Merge pull request #114 from kconnor/master

fix broken link

2 parents 2b58f9f + 47249d0 commit 1a18101Copy full SHA for 1a18101

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -97,6 +97,6 @@ This will output:`
`97`	`97`	`Node(label: d, distance: 2), Node(label: e, distance: 2), Node(label: f, distance: 2),`
`98`	`98`	`Node(label: g, distance: 2), Node(label: h, distance: 3)`
`99`	`99`
`100`		-> Note: This version of `breadthFirstSearchShortestPath()` does not actually produce the tree, it only computes the distances. See [minimum spanning tree](../Minimum Spanning Tree/) on how you can convert the graph into a tree by removing edges.
	`100`	+> Note: This version of `breadthFirstSearchShortestPath()` does not actually produce the tree, it only computes the distances. See [minimum spanning tree](../Minimum Spanning Tree (Unweighted)/) on how you can convert the graph into a tree by removing edges.
`101`	`101`
`102`	`102`	`Written by [Chris Pilcher](https://github.com/chris-pilcher) and Matthijs Hollemans`

Comments

(0)