C Programming – Backtracking – Hamiltonian Cycle – Create an empty path array and add vertex 0 to it. Add other vertices, starting from the vertex 1
Backtracking
2 Articles
2
Minimum No of Platforms Required for a Railway/Bus Station – Greedy algorithm – Given arrival and departure times of all trains that reach a railway station , to find the minimum number of platforms required for the railway station so that no train waits.