Shortest path Packages

The algorithm to find the maximum matching of the bipartite graph.

Dijkstra algorithm optimized with priority queue.

Dijkstra algorithm (bigint version) optimized with @algorithm.ts/priority-queue.

Documentation app: [raikuxq-algorithms.netlify.app/guide](https://raikuxq-algorithms.netlify.app/guide)