Single directory for overlapping problems in greedy-algorithms and graph-algorithms

This is a(n):

• New algorithm
• Update to an existing algorithm
• Error
• Proposal to the Repository

Details:

There are three algorithms that overlap, between code/greedy-algorithms and code/graph-algorithms. There should be a single directory for each algorithm in code/graph-algorithms and a symlink to that directory in code/greedy-algorithms.

How it should look after this issue is closed

• There exists a single directory in code/graph-algorithms for the algorithm
• There exists a symlink in code/greedy-algorithms to the algorithm in code/graph-algorithms
• for each language the algorithm is implemented in currently, there exists one solution in the new directory in this language

Affected algorithms

• Dijkstra's shortest path
• Prim's minimum spanning tree
• Kruskal's minimum spanning tree