Interview Question Help

Правка en3, от go_rob, 2017-04-02 20:22:29

There are n nodes(1,2.. n) in a weighted graph with m (m>n) bi-directional edges.

All weights are positive and there are no multiple edges.

There is one fixed origin(Node 1). We will always start traveling from the origin.

Now we have to find the number of ways to reach each of the nodes(starting from the origin) with minimum cost.

Expected complexity O(m*log(m)).

Input — First line contains n , m . Next m lines contain u,v,w. => There is an edge between u and v of weight w(w>0).

Output — Print n-1 lines one for each node other than origin, containing the number of ways to reach each of the nodes(starting from the origin) with minimum cost.

Sample Test -

4 5

1 2 5

1 3 3

3 2 2

3 4 7

2 4 5

Output — 2

1

3

Теги #graph, dijkstra, dynamic programming

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en7 Английский go_rob 2017-04-03 10:57:15 42
en6 Английский go_rob 2017-04-02 20:46:34 2 Tiny change: ' n , m .\nNext m l' -> ' n , m .\n\nNext m l' (published)
en5 Английский go_rob 2017-04-02 20:45:14 71
en4 Английский go_rob 2017-04-02 20:25:38 1356
en3 Английский go_rob 2017-04-02 20:22:29 17
en2 Английский go_rob 2017-04-02 20:21:00 69
en1 Английский go_rob 2017-04-02 20:17:44 764 Initial revision (saved to drafts)