Adding BFS and shortest path functionality to directed graphs

I believe I kept with the idioms used for the DFS implementation as well as I could, but I might be missing something. I'm relatively new to Golang, so feel free to critique.