For a nxm grid of nodes the no of possible paths between the two nodes each of them at a corner of the grid and under the constraint that a node should not be repeated is given by
(n+m) C n = (n+m)!/(m!n!) = (n+m) C m. Is this what you are looking for.? --~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
