1. Add the standard code of dijkstra, spfa.
2. POJ 1639 - Picnic Planning
Problem : Find a minimum spanning tree with the root has at most k degree.
Solution & Proof : Refer to the note.