implement bellman ford algorithm to find shortest path with negative weights #431

	name: Go

	on:
	push:
	branches: [ main ]
	pull_request:

	jobs:
	test:
	name: Unit Tests
	runs-on: ubuntu-latest
	steps:
	- name: Set up Go 1.18
	uses: actions/setup-go@v2
	with:
	go-version: ^1.18
	id: go

	- name: Check out code into the Go module directory
	uses: actions/checkout@v2

	- name: Get dependencies
	run: \|
	go get -v -t -d ./...
	- name: Lint
	uses: golangci/golangci-lint-action@v3
	with:
	version: v1.51.2
	- name: Test
	run: go test -race -coverprofile=coverage.txt -covermode=atomic ./...

	- name: Codecov
	uses: codecov/codecov-action@v2

Provide feedback