javascript python java c# php android html jquery c++ css ios mysql sql r node.js arrays reactjs c asp.net json ruby-on-rails .net sql-server swift python-3.x objective-c django angular angularjs excel regex pandas ruby iphone ajax linux xml vba asp.net-mvc spring laravel database wordpress typescript string wpf mongodb windows xcode postgresql bash oracle git vb.net amazon-web-services multithreading list firebase flutter eclipse spring-boot dataframe azure react-native algorithm docker macos forms image visual-studio scala powershell function twitter-bootstrap numpy api performance selenium winforms python-2.7 matlab vue.js sqlite apache hibernate entity-framework loops rest shell facebook express android-studio csv linq maven qt swing unit-testing file tensorflow

[ACCEPTED]-Topological Sort with Grouping-graph-theory

Accepted answer
Score: 11

Label all root nodes with a level value 8 0. Label all children with level value parent+1. If, a 7 node is being revisited i.e it already has 6 a level value assigned, check if the previously 5 assigned value is lower than the new one. If 4 so, update it with the higher value and 3 propagate them to the descendents.

now, you 2 have as many groups as there are unique 1 level labels 0 ... K

Source: stackoverflow.com

More Related questions

How can Modularity help in Network Analysis

What is a minimum spanning forest?

Similarity measure between graphs using NetworkX

Why do we need a priority queue in Prim's Algorithm

Construct a minimum spanning tree covering a specific subset of the vertices

Algorithm to simplify a weighted directed graph of debts

Postgres CTE : type character varying(255)[] in non-recursive term but type character varying[] overall

crossing edges in the travelling salesman problem

Vertex cover vs dominating set

What is the most efficient way of finding a path through a small world graph?