Given an undirected graph in which each edge has a capacity, find the maximum capacity from node A to node B.
Given a directed graph where each edge has a cost, find the lowest cost path from node A to node B. Find the minimal spanning tree of a weighted, connected graph. On Sep 22, 2:03 pm, Ankur Garg <[email protected]> wrote: > Hi Frnds > > Can anybody suggest me some questions typically asked on Graphs . > > Couldnt find much in the internet > > If some one can share link or few questions on Graphs it will be really > helpful > > Thanks in Advance > > Ankur -- 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?hl=en.
