whats ur expected complexity...?? if we represent the graph in linked list form then graph can be easily formed and subgraph can be easily created in O(no. of successors)
i think u shud call it "connected nodes" instead of "successors" since it is a undirected grpah On Thu, Mar 24, 2011 at 12:04 PM, divya <[email protected]> wrote: > You have to create a graph in most efficient way from relationship of > nodes read from txt file. > text file contains information like: > node_id weight node_id > node_id weight node_id > ….. > // which means two nodes are connected with some weight. (undirected) > There are around 600K such information for about 65000 nodes. > Aim is to create a a subgraph for a given node_id. i.e for that > node_id find ALL successor nodes with level mentioned i.e form a > subgraph for that node. > > -- > 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. > > -- Regards Aditya Kumar B-tech 3rd year Computer Science & Engg. MNNIT, Allahabad. -- 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.
