A question about DAGs.

Revision en1, by smhh22, 2019-08-31 17:21:19

Hi; can you help me with this problem?: We have DAG with n vertices and m edges. We have q queries, each query has two integers v[i] and u[i], determine for each query that if there is a path starting at v[i] and finishing at u[i]. n, m, q <= 1e5 thanks, and sorry for my bad English. (:

Tags dag, directed_graph, query, #graph_theory, topological_sort

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English smhh22 2019-08-31 17:23:16 0 (published)
en2 English smhh22 2019-08-31 17:22:44 8
en1 English smhh22 2019-08-31 17:21:19 337 Initial revision (saved to drafts)