Question: Given a cyclic graph, we want to traverse entire graph in such a way that from starting node till supporting node named, each node

 Given a cyclic graph, we want to traverse entire graph in such a way that from starting node till supporting  

Given a cyclic graph, we want to traverse entire graph in such a way that from starting node till supporting node named, each node should be visited twice through different neighbors with any cost, after reaching that node from now further every node should be visited once only with minimum cost. Your task is to design a program that traverse and find overall single path with minimum cost using "Genetic Algorithm". [ Marks: 18] e.g: Starting node: A Supporting node: C End node: E A 2 C 3 8 E B D 5 Possible path_1: ABB-D-A-D->CE: path cost =3+5+7+8+8+4+9=44 Desired path: A -> D-BAB-> DC->E: path cost = 8+7+3+3+7+4+9 = 41

Step by Step Solution

3.44 Rating (160 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

The problem given is a variation of the wellknown traveling salesman problem TSP which is NPhard However there is a twist in that every node must be v... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!