New answers tagged dag
2
votes
Accepted
Transitive Closure of a graph
Using Kosaraju's algorithm, you can compute the strongly connected components (SCC) of $G$ in linear time.
The metagraph (or graph of the SCC) is well known to be a DAG. You can then compute the ...
Top 50 recent answers are included
Related Tags
dag × 136graphs × 97
algorithms × 56
graph-traversal × 13
weighted-graphs × 10
topological-ordering × 9
sorting × 7
partial-order × 7
optimization × 6
dynamic-programming × 6
trees × 6
shortest-path × 6
algorithm-analysis × 4
sets × 4
directed-graphs × 4
complexity-theory × 3
time-complexity × 3
data-structures × 3
np-complete × 3
terminology × 3
partitions × 3
hamiltonian-path × 3
minimum-cuts × 3
depth-first-search × 3
search-algorithms × 2