# go-shortestpath

[![Build Status](https://travis-ci.org/flemeur/go-shortestpath.svg?branch=master)](https://travis-ci.org/flemeur/go-shortestpath)
[![GoDoc](https://godoc.org/github.com/flemeur/go-shortestpath?status.svg)](https://godoc.org/github.com/flemeur/go-shortestpath)

A couple of implementations of different shortest path algorithms.
Mostly just a learning project for me but might be useful for others as well.

Please contribute if you find errors or have ideas for a better way of doing things.

So far I've only implemented Dijkstra's algorithm but I plan to also do Bellman-Ford and maybe A\*.

## Dijkstra's shortest path algorithm

	$ go get github.com/flemeur/go-shortestpath/dijkstra



# go-shortestpath

[![Go Report Card](https://goreportcard.com/badge/github.com/flemeur/go-shortestpath)](https://goreportcard.com/report/github.com/flemeur/go-shortestpath)
[![Build Status](https://travis-ci.org/flemeur/go-shortestpath.svg?branch=master)](https://travis-ci.org/flemeur/go-shortestpath)
[![GoDoc](https://godoc.org/github.com/flemeur/go-shortestpath?status.svg)](https://godoc.org/github.com/flemeur/go-shortestpath)
[![GitHub license](https://img.shields.io/github/license/flemeur/go-shortestpath)](https://github.com/flemeur/go-shortestpath/blob/master/LICENSE)

A couple of implementations of different shortest path algorithms.
Mostly just a learning project for me but might be useful for others as well.

Please contribute if you find errors or have ideas for a better way of doing things.

So far I've only implemented Dijkstra's algorithm but I plan to also do Bellman-Ford and maybe A\*.

## Dijkstra's shortest path algorithm

	$ go get github.com/flemeur/go-shortestpath/dijkstra



Add more badges to readme
Add more badges to readme
