How to solve this coding round problem?

Revision en1, by destiny____, 2021-11-08 19:54:53

Given an undirected graph with n nodes rooted at node 1. In this graph for each node we've to find the number of predecessors in the path from root to this node. How can I solve this problem?

Tags help

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en7 English destiny____ 2021-11-08 20:06:34 2 Tiny change: 'irected **weighted**' -> 'irected **unweighted**'
en6 English destiny____ 2021-11-08 20:01:55 154
en5 English destiny____ 2021-11-08 19:59:22 17
en4 English destiny____ 2021-11-08 19:58:45 13 Tiny change: 'rs in the path from root to t' -> 'rs in the shortest path from the root to t'
en3 English destiny____ 2021-11-08 19:58:12 11 Tiny change: 'let's say graph is ' -> 'let's say the graph is '
en2 English destiny____ 2021-11-08 19:57:32 222
en1 English destiny____ 2021-11-08 19:54:53 230 Initial revision (published)