Topological Sort

-
1. http://www.shafaetsplanet.com/?p=848
2. https://shadyf.com/blog/notes/2016-07-26-topological-sorting/
3. https://cp-algorithms.com/graph/topological-sort.html
4. http://kirhobe.blogspot.com/2016/11/topological-sorts-using-indegree-kahns.html

Comments

Post a Comment

Popular posts from this blog

C++ STL practice problem link

-
HackerRank: 1.  https://www.hackerrank.com/challenges/variable-sized-arrays/problem 2.  https://www.hackerrank.com/challenges/vector-sort/problem 3.  https://www.hackerrank.com/challenges/c-tutorial-stringstream/problem 4.  https://www.hackerrank.com/challenges/vector-erase/problem?h_r=profile 5.  https://www.hackerrank.com/challenges/cpp-sets/problem?h_r=profile 6.  https://www.hackerrank.com/challenges/cpp-lower-bound/problem?h_r=profile 7.  https://www.hackerrank.com/challenges/cpp-maps/problem Stable_Sort: 1 .  https://vjudge.net/contest/307320#status/Nipun_Paul/P/0/ Details:  https://www.geeksforgeeks.org/stable_sort-c-stl/ General Sort: 1.  https://vjudge.net/contest/307320#status/Nipun_Paul/R/0/ Queue 1.  https://vjudge.net/contest/307320#status/Nipun_Paul/C/0/ Details:  https://www.geeksforgeeks.org/queue-cpp-stl/ List 1. https://vjudge.net/contest/307320#status/Nipun_Paul/F/0/ Details:  ht...
Read more

Binary Index Tree(BIT)

-
Special for Query search and update, work same as segment tree. Tutorial: https://www.youtube.com/watch?v=aAALKHLeexw Problem : https://toph.co/p/easy-prime https://toph.co/p/another-query-on-string https://toph.co/p/rivalry-friends (long long matters in return type)
Read more

Combinatorics

-
1. Regular odd polygon total intersection point=     https://math.stackexchange.com/questions/1010591/what-is-the-number-of-intersections-of-diagonals-in-a-convex-equilateral-polygon Problem:  https://toph.co/p/irregular-is-tough-regular-is-easy 2. Given two side of a triangle, how many valid possible value of third side- 2*(min(a,b))-1 problem:  https://toph.co/p/geometry-forever n ( n − 1 ) ( n − 2 ) ( n − 3 ) 24 n ( n − 1 ) ( n − 2 ) ( n − 3 ) 24
Read more