Can anyone please solve any of the following problems? I need a
detailed solution. It is my data structure assignment, and i have to
submit it by the 4th of april. Please someone help me... its urgent.
Show that if an edge(u,v)is contained in some MST, then it is a light
edge crossing some cut of the graph.
OR
Make a 3-by-3 chart with row and column labels WHITE, GRAY and BLAC.
in each cell(i,j), indicate whetehr, at any point during DFS of a
directed graph, thr can be an edge from a vertex of color i to a
vertex of colour j. for each possible edge, indicate what edge types
it can be. Make a second chart for DFS for an undirected graph.
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
