update readme

Author: matiii

README.md

@@ -1,10 +1,13 @@
-# Dijkstra.NET Dijkstra algorithm in [C#]
+# Dijkstra.NET Dijkstra algorithm in [C#] [![NuGet Version](https://img.shields.io/badge/nuget-v1.0.3-blue.svg?style=flat)](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).
 
-## Installation
+## Get Started
+Install the latest version from NuGet
 
-From [Nuget](https://www.nuget.org/packages/Dijkstra.NET)
+```
+  Install-Package Dijkstra.NET
+```
 
 ## Simple example
 
@@ -20,6 +23,7 @@ var dijkstra = new Dijkstra<int, string>(graph);
 DijkstraResult result = dijkstra.Process(0, 1); //result contains the shortest path
 result.GetPath();
 ```
+
 ## License
 
 [![License](https://img.shields.io/badge/license-MIT-blue.svg?style=plastic)](https://github.com/matiii/Dijkstra.NET/blob/master/LICENSE)