Update README.md

matiii · web-flow · commit e71dc802ba13 · 2017-03-30T11:38:24.000+02:00
diff --git a/README.md b/README.md
@@ -1,4 +1,4 @@
-# Dijkstra.NET Dijkstra algorithm in [C#] [![NuGet Version](https://img.shields.io/badge/Dijkstra.NET-1.0.6-blue.svg)](https://www.nuget.org/packages/Dijkstra.NET)
+# Dijkstra.NET Dijkstra algorithm in C&#35; [![NuGet Version](https://img.shields.io/badge/Dijkstra.NET-1.0.6-blue.svg)](https://www.nuget.org/packages/Dijkstra.NET)
 
 Dijkstra algorithm which use priority queue thus complexity is equal O(ElogV) where E is number of edges and V is number of vertices. Used data structures are based on interfaces so you can implement your own or reused present. Simply example below. More information about algorithm you can find on the [wikipedia](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm).
 

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-# Dijkstra.NET Dijkstra algorithm in [C#] [![NuGet Version](https://img.shields.io/badge/Dijkstra.NET-1.0.6-blue.svg)](https://www.nuget.org/packages/Dijkstra.NET)`
	`1`	`+# Dijkstra.NET Dijkstra algorithm in C# [![NuGet Version](https://img.shields.io/badge/Dijkstra.NET-1.0.6-blue.svg)](https://www.nuget.org/packages/Dijkstra.NET)`
`2`	`2`
`3`	`3`	`Dijkstra algorithm which use priority queue thus complexity is equal O(ElogV) where E is number of edges and V is number of vertices. Used data structures are based on interfaces so you can implement your own or reused present. Simply example below. More information about algorithm you can find on the [wikipedia](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm).`
`4`	`4`