Waldemar Bira

Implemented longest common subsequence algorithm

1

I want partially resolve #8 by adding implementation of Longest common subsequence

I want partially resolve #9 issue by implementing Bellman-Ford algorithm for shortest paths from a single source vertex to all of the other vertices.

I want partially resolve #9 by implementing Floyd-Warshall algorithm for finding shortest paths between all vertices

## Description of new feature, or changes ## Checklist - [ ] Your branch is up-to-date with the base branch - [ ] You've included at least one test if...