How to solve this graph problem?

Revision en1, by ALuca_Rd, 2022-02-06 21:37:57

Given a graph with N nodes with each node numbered from 1 to N and M edges and a target vertex T. Find the number of different ways to reach target vertex T from vertex numbered 1.

N <= 2 * 10^5 M = min( 2 * 10^5, N * ( N — 1 ) / 2 )

Tags graphs

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en6 English ALuca_Rd 2022-02-06 23:39:27 39 Tiny change: 'ash; 5sec \n' -> 'ash; 5sec \n\nCompute the answer modulo 10^9 + 7. \n'
en5 English ALuca_Rd 2022-02-06 23:38:19 27 Tiny change: ' ) / 2 )` \n' -> ' ) / 2 )` \n\nTime limit - 5sec \n'
en4 English ALuca_Rd 2022-02-06 21:40:47 8 Tiny change: ', N * ( N &mdash; 1 ) / 2 )' -> ', N * ( N - 1 ) / 2 )'
en3 English ALuca_Rd 2022-02-06 21:40:21 9
en2 English ALuca_Rd 2022-02-06 21:39:05 2 Tiny change: '= 2 * 10^5\nM = min(' -> '= 2 * 10^5, \nM = min('
en1 English ALuca_Rd 2022-02-06 21:37:57 282 Initial revision (published)