Add an implementation of Bellman–Ford algorithm

[RodionovMaxim05]

Добавлена реализация алгоритма поиска кратчайшего пути в взвешенном графе:

• Алгоритм Беллмана — Форда

[github-actions[bot]]

Overall Project	97.01% -1.14%	:green_apple:
Files changed	95.55%	:green_apple:

File	Coverage
BellmanFordShortestPath.kt	95.66% -4.34%	:green_apple:

[github-actions[bot]]

Test Results

 14 files   14 suites   0s :stopwatch: 110 tests 110 :white_check_mark: 0 :zzz: 0 :x: 113 runs  113 :white_check_mark: 0 :zzz: 0 :x:

Results for commit 06595a14.

:recycle: This comment has been updated with latest results.

[github-actions[bot]]

Overall Project	97.01% -1.14%	:green_apple:
Files changed	95.55%	:green_apple:

File	Coverage
BellmanFordShortestPath.kt	95.66% -4.34%	:green_apple:

[github-actions[bot]]

Overall Project	97.46% -0.96%	:green_apple:
Files changed	95.45%	:green_apple:

File	Coverage
BellmanFordShortestPath.kt	95.47% -4.53%	:green_apple:

[IliaSuponeff]

Всё отлично. Хорошая работа.