I have around 200K nodes and their relationship in a XML file as follows:
node_A - node_B direct, node_A - node_G inverse, node_A - node_H direct, node_A - node_X inverse, node_A - node_Y direct
I need to model the nodes and their relationship in the XML file using Python NetworkX graph data structure and based on user input (e.g node_A up) find the relationship among nodes and output the nodes as follows:
output: node_B - up, node_G - down, node_H - up, node_X - down, node_Y - up
Here meaning is that based on node relationship the app should sort/filter the nodes. For example if relationship of node_A to node_B is direct and node_A to node_X is inverse output will be node_B - up and node_X - down as in the output example above.
Please help me to suggest which NetworkX graph data structure I should be using. An example would be a great help.
Thanks in advance Prakash