Write a code in C++ that takes an
undirected graph as input using adjacency list. Now apply BFS algorithm to find
the farthest nodes from the source node. Take source node as input from user.
Shishir_1
0
Newbie Poster
rproffitt
2,565
"Nothing to see here."
Moderator
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.