(Solved) : Generate Graph 100 000 Nodes Node Randomly 1 5 Connections Nodes Node Contain Within Rando Q37892939 . . .
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. The length of the shortest path tothe found node. The total number of nodes examined during thesearch. Optionally you may return the exhaustive display of theshortest path, for testing and verification. Also remember sinceyour graph is created with random values, try re-creating it fordifferent results. Note: Dijkstra’s Algorithm will requireaugmentation of the graph to include connection weights, which canalso be completely random. Hint: In each case, start with a smallernumber of nodes to test that your code is working, then increasethe size when you are sure it works.
Expert Answer
Answer to Generate Graph 100 000 Nodes Node Randomly 1 5 Connections Nodes Node Contain Within Rando Q37892939 . . .
OR