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.

That sounds like you need to find a site that hires out such work. Fiverr.com is a typical for hire site.

Here you read https://www.daniweb.com/welcome/rules to see you must show your work or the parts that fail and ask for help in that area.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of 1.21 million developers, IT pros, digital marketers, and technology enthusiasts learning and sharing knowledge.