I've a question regarding the extraction of highly connected nodes. My graph is directed graph with only two groups of nodes (X and Y). In the example below group X (node 0, 1, 2 and 3) points to group Y nodes (nodes A, 9 and C).
I would like to extract highly connected nodes taking into account the weight of each edges. In this example I would like to have :
[0, 1, 2, 3, A, B]
Any idea where to start ?