In the astronauts problem from hackerrank, how do we decide or come to know that it is a graphs problem? can’t we use any other data structure.
Advanced Graphs Webinar - Bipartite Graph, Strongly Connected Components, Minimum Spanning Tree, Union-Find, Problem Solving
can u post link of question
the graph is use for the dfs search basically to find different component of graph
if a b are of same country and b and c are of same country then a c also
so this is a relation u have to combine a b c into one country
and similar for other