Algoteka
View all languages for this problem (1 verified and 0 unverified)

Breadth-First Search - Samples for C++

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 samples:

# Tech tags Title Creator Created date
1 0
oml1111
2022-07-29 21:53

Unverified samples:

# Tech tags Title Creator Created date
No unverified samples ...
View problem discussion (0 comments)