Topological Sort in Graph and Count Number of Islands in Graph

Question

Accepted Answer

Topological sort is a linear ordering of vertices in a directed acyclic graph. Counting number of islands involves identifying connected components in a graph.

Topological sort is used to order vertices in a graph such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering.
Number of islands in a graph can be counted by performing a depth-first search (DFS) or breadth-first search (BFS) to identify connected components.
For example, in a grid representing a map where 1s represent land and 0s represent water, islands can be counted by traversing the grid and marking visited land cells.

Topological Sort in Graph and Count Number of Islands in Graph

Popular interview questions of Senior Software Developer 2