Answer to Question #291321 in C++ for hajar

Question

-         Design a C++ program that defines Graph class.

-         Represent graph objects by means of linked adjacency lists which are sorted.

-         Implement member functions ofthe class to manipulate directed weighted graphs with integer data items.

-         main() function should declare and create an object of this class. It should print the value of each node in depth first sequence.

-         For your first experiment create such a graph object:

 

                6

                                         10

7            9                    8   

  

 

-         Make necessary changes in your program to keep adjacency lists unsorted. Make sure that your search procedures take into account the fact that adjacency lists are unsorted now.

-         Present report with results of your experiments: The program code, outputs, some comments on using sorted and unsorted adjacency lists.

Answer 1

Dear hajar, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order