Q) A city has a number of roads that meet at various junctions (A junction is a point where two or more roads meet). The traffic police department is severely short of policemen and therefore wants to know the minimum number of policemen required to be placed at junctions so as to cover all the roads in the city. Assume that there isn't more than one path between any two junctions in the city. (A policeman can patrol all the roads connected to the junction where he is placed). Write a code in to return the minimum number of policemen required. It is not necessary to print the various combinations of the junctions at which each of the policemen would be placed.
Input: adjacency matrix where if a[i][j] = 1, a road exists between i and j. Your prototype should be : int find_min_policemen_count(struct node* root); --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
