CommonLounge is a community of learners who learn together. Get started with the featured resources above, ask questions and discuss related stuff with everyone.
Understanding Tarjan's SCC algorithm
Recently I came across this problem from IARCS Problem Archive , and after some research , the answer seems to be tarjan's algorithm to find the points which when deleted , breaks the graph in two or more smaller graphs .
why did you do lo = mid but in the hi you did mid -1 , i mean you would normally do a lo = mid +1 and with the hi you do hi=mid-1 , my solution also required me to do only lo = mid to work when i add 1 it did not , do you know why ?
Try to not read this next hint, it gives it all away...
Read more… (82 words)
Read more (82 words)
Prim's algorithm for Minimum Spanning Tree
Given an undirected weighted graph, a minimum spanning tree (MST) is a subset of the edges of the graph which form a tree and have the minimum total edge weight. For a MST to exist, the graph must be connected (that is, every pair of nodes must be reachable from each other).
Example of Minimum Spanning Tree. Total edge weight ...
I got selection to IOITC this year. I would like to know more about the camp and topics which will be discussed there. Will they teach the whole syllabus of IOI in the camp within a span 10 days? What all should I learn before attending the camp in order to understand everything discussed there in a more better way?