Generate a graph with 100,000 nodes, where each node randomlyhas between 1 and 5 connections to other nodes. Each node shouldcontain within it a random value between 1 and 300,000. (Sogenerally about 1 in 3 searches will yield a query match) Allow theuser to enter a number to search for, and implement each of thefollowing three types of searching algorithms. Breadth-First. (30points) Depth-First. (30 points) Dijkstra’s Algorithm. (40 points)Do not allow back-tracking in your searches. (Mark nodes that youalready searched as complete, and do not re-visit them in the samesearch) Each search should return the following: TheSuccess/Failure of your search.
PayPal Gateway not configured
PayPal Gateway not configured