http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm For Q4): Dijkstra is the best one .. as there is no root for negative weight edge ... Floyds algo gives all pairs shortest path with negative weight edges also .. so that doesn't work in this situation ...
On Sun, Sep 4, 2011 at 6:22 PM, aditya kumar <[email protected]>wrote: > q4) floyds algorithm for shortest path . > > > On Sun, Sep 4, 2011 at 5:41 PM, sukran dhawan <[email protected]>wrote: > >> for q3 :either both inorder and preorder traversal shud be stored or >> inorder and postorder shud be stored >> >> >> On Sun, Sep 4, 2011 at 2:54 PM, sukran dhawan <[email protected]>wrote: >> >>> >>> >>> ---------- Forwarded message ---------- >>> From: sukran dhawan <[email protected]> >>> Date: Sun, Sep 4, 2011 at 2:53 PM >>> Subject: Re: [algogeeks] Tejas networks >>> To: [email protected] >>> >>> >>> reverse a linked list >>> >>> void reverse(struct node ** head) >>> { >>> struct node * last,*temp; >>> >>> last = *head; >>> while(last->next != null) >>> last = last->next; >>> >>> while(*head != last) >>> { >>> temp = *head; >>> *head = (*head)->next; >>> temp->next = last->next; >>> last->next = temp >>> } >>> } >>> >>> On Sun, Sep 4, 2011 at 2:46 PM, Anup Ghatage <[email protected]> wrote: >>> >>>> Could you please give an example for question 3? >>>> >>>> -- >>>> 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. >>>> >>> >>> >>> >> -- >> 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. >> > > -- > 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. > -- **Please do not print this e-mail until urgent requirement. Go Green!! Save Papers <=> Save Trees *BharatKumar Bagana* **http://www.google.com/profiles/bagana.bharatkumar<http://www.google.com/profiles/bagana.bharatkumar> * Mobile +91 8056127652* <[email protected]> -- 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.
