Dijkstra Algorithm [Go]

#### This issue is about [Dijkstra Algorithm](https://en.wikipedia.org/wiki/Dijkstra's_algorithm).

- [x] Issue Title is in form `Algo/DS Name [Language]`.
- [x] I searched or browsed the repo’s other issues to ensure this is not a duplicate.
- [x] This Algo/DS is worth adding to this repository.
- [x] Assign this issue to me (I want to work on this).
- [x] I ensure that I am not already assigned to 2 or more issues.
- [x] I will send my PR only after I'm assigned to this issue by any maintainer.
- [x] I understand that I will be unassigned from this issue if I fail to send a PR for this within a week.

Start with the Dijkstra Algorithm reference linked in the issue, then inspect the repository's existing Go implementations and conventions. The issue names no files or tests; done means adding a Go implementation of Dijkstra's algorithm that fits the repository's established structure and behavior.

Written by the indexing model from the issue text.