Algoteka

Breadth-First Search - All languages

Problem by oml1111

Problem description:

Construct an unweighted graph and perform Breadth-first search on it. Calculate the distance of each node from the starting vertex of the search.

Verified languages:

# Language Count
1 C++ 1

Unverified languages:

# Language Count
No unverified languages ...
View problem discussion (0 comments)