Comments
On WalidMasri → How to solve this problem?, 10 years ago
0

Auto comment: topic has been updated by WalidMasri (previous revision, new revision, compare).
On WalidMasri → How to solve this problem?, 10 years ago
0

Auto comment: topic has been updated by WalidMasri (previous revision, new revision, compare).
On WalidMasri → Persistent Data Structures, 10 years ago
0

Auto comment: topic has been updated by WalidMasri (previous revision, new revision, compare).
On WalidMasri → Directed Graphs into DAG, 10 years ago
0

Assume that the input graph is already a DAG and we're applying SCC Contraction Building a hash function that checks whether an edge is added or not between every 2 pair of vertices takes O(N^2) space which is not feasible for big instances.
On WalidMasri → Directed Graphs into DAG, 10 years ago
0

Can you describe your approach? Thanks!
On Alex7 → Finding Bridges Tutorial, 10 years ago
-12

Can you please make tutorials on Tarjan SCC algorithm and maximum flow?

Thank you for your effort!
On WalidMasri → Help Request, 10 years ago
+3

Thank you :)
On aajjbb → Strongly Connected Components, 10 years ago
0

P_Nyagolov is now officially the man of the day :)
On aajjbb → Strongly Connected Components, 10 years ago
0

Thank you!
On aajjbb → Strongly Connected Components, 10 years ago
0

can we transform it into an undirected tree then?
On aajjbb → Strongly Connected Components, 10 years ago
0

of course they are not in the same graph. What i meant is, if i found some way the biconnected components of an undirected graph, can i create a DAG out of it if i contract all the BC?
On aajjbb → Strongly Connected Components, 10 years ago
0

We can transform a directed graph using SCC to a DAG.

Can we do the same if we find the biconnected components?
On WalidMasri → Tarjan SCC algorithm, 10 years ago
0

Does Tarjan algorithm also works on undirected graph for finding biconnected components ?
On aajjbb → Strongly Connected Components, 10 years ago
0

http://mirror.codeforces.com/gym/100676

In such contest, the solution of the last problem pointed out that we need to get the SCC of the graph. Any idea?
On aajjbb → Strongly Connected Components, 10 years ago
0

Does kosaraju and Tarjan algortihms works on undirected graph?

if no is the answer, how can i find the SCC in an undirected graphs?
+1

does anyone have the link of the contest?
0

how is it [logN][N] ? My implementation use parent[N][N] Can you provide a code of your approach?

Thanks!
-16

Nice! but binary lifting is slow with a query of O(log^2 n)
0

what does HPD stands for?