To make it more clear, suppose we have N process doing their own BFS at the same time on this graph, so we can not just set one flag in the node (unless we have N different flag in each node). In the same sense, we can not "lock" the graph.
So each process itself to use a separate hashtable to keep the node visited is the only way I can think of. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
