Algorithms | Graph Traversals | Question 9
Make is a utility that automatically builds executable programs and libraries from source code by reading files called makefiles which specify how to derive the target program. Which of the following standard graph algorithms is used by Make.
(A) Strongly Connected Components
(B) Topological Sorting
(C) Breadth First Search
(D) Dijkstra’s Shortest Path
Explanation: Make can decide the order of building a software using topological sorting. Topological sorting produces the order considering all dependencies provide by makefile. See following for details.