|
RAR-files |
| udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.rar |
1,000,000,000 |
F18F7D03 |
| udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.r00 |
1,000,000,000 |
AB461C6C |
| udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.r01 |
1,000,000,000 |
AA1FA686 |
| udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.r02 |
1,000,000,000 |
A228DCAD |
| udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.r03 |
1,000,000,000 |
87E43B83 |
| udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.r04 |
1,000,000,000 |
FAF6E60C |
| udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.r05 |
1,000,000,000 |
E56A1CE6 |
| udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.r06 |
1,000,000,000 |
D4022F9D |
| udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.r07 |
1,000,000,000 |
2F4AAF8E |
| udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.r08 |
1,000,000,000 |
AD34BB85 |
| udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.r09 |
1,000,000,000 |
71CF4E92 |
| udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.r10 |
1,000,000,000 |
B00DC841 |
| udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.r11 |
1,000,000,000 |
283B3A92 |
| udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.r12 |
725,377,965 |
017486B1 |
|
| Total size: |
13,725,377,965 |
|
|
| Archived
files |
|
104-Board_Game.mkv
[98a15587f8cc9069]
|
47,982,529 |
8486B3AE |
|
048-Kruskals_Code.mkv
[3f8f78e26460dd47]
|
48,679,052 |
8B86077B |
|
088-Introduction.mkv
[752b7e48a2c9425f]
|
172,981,866 |
F5E690BF |
|
101-Dinics_Algorithm.mkv
[20af770c3f3a6cdf]
|
495,345,675 |
6134294F |
|
038-DSU_Data_Structure-Union_and_Find_Ops.mkv
[4324e78168e3dac4]
|
27,895,833 |
012C5069 |
|
052-Bellman_Ford_Algorithm.mkv
[e141a01118b1e0f8]
|
92,314,074 |
8EAEBE1B |
|
097-Introduction_to_Network.mkv
[788a46fc07543fd3]
|
20,520,583 |
35C7D218 |
|
096-Code_for_re_rooting_of_the_tree.mkv
[1569c604c3e52a15]
|
168,432,659 |
A6553D19 |
|
044-Introduction_to_Minimum_Spanning_Trees.mkv
[4b6c2cd8e5cac221]
|
50,850,609 |
FAE6F408 |
|
021-BFS_Shortest_Path_Code.mkv
[b40aa75a08cc42f5]
|
29,171,765 |
1B983D72 |
|
082-Condensed_Component_Graph.mkv
[5124304b4c3af561]
|
62,418,220 |
FDC4220C |
|
089-Applications.mkv
[ec22bc7b6f545f91]
|
356,464,389 |
CA4861EA |
|
049-Introduction_to_Shortest_Path_Algorithms.mkv
[d98ac3a1e34e15a4]
|
30,641,816 |
B5AF614F |
|
071-DFS_Tree_and_backedges_in_Undirected_graph.mkv
[44b4f6f95a8c2a3c]
|
195,361,176 |
B58D6963 |
|
024-DFS_Code.mkv
[36c45674788bb511]
|
25,195,212 |
52E8C9FA |
|
056-Solution-Shortest_Path_in_Grid.mkv
[b308b52aa3dfe06b]
|
55,876,762 |
C91A3A78 |
|
095-Approach_to_re_root_the_tree.mkv
[34dc6799f88d91bb]
|
481,822,589 |
A54D193F |
|
084-Kosaraju_Algorithm_for_Strongly_Connected_Component_Code.mkv
[918d3d8491d5a0cb]
|
178,022,284 |
E14C3FAE |
|
023-DFS_Concept.mkv
[3037bbaebca769ae]
|
14,912,182 |
42D8B475 |
|
029-Directed_Graph-Cycle_Detection_Code.mkv
[47f77cd0bda909b]
|
52,325,404 |
2B04FE38 |
|
022-Snakes_and_Ladder_Solution.mkv
[fa692d7d761582d2]
|
62,442,889 |
3045DED8 |
|
069-01_BFS.mkv
[4ffb8640d8080b06]
|
92,540,756 |
85F3D46B |
|
015-Adjacency_List_Representation.mkv
[7f642ed0e8cbce43]
|
24,426,822 |
27595785 |
|
042-Path_Compression_Optimisation.mkv
[b3cc7e80f3622fa0]
|
31,760,414 |
E7EE0127 |
|
092-LCA_(Brute_Force).mkv
[3e72d078e20781ae]
|
138,614,806 |
1C930D9E |
|
083-Kosaraju_Algorithm_for_Strongly_Connected_Component.mkv
[395da152ae9a7bdd]
|
399,134,833 |
4E7B8A1D |
|
001-Course_Orientation.mkv
[45001e3872c3d155]
|
58,674,168 |
5FB4CCF2 |
|
013-Graph_Applications.mkv
[66d18e1c30e19a2d]
|
35,265,333 |
A17CBB74 |
|
062-Number_of_Islands.mkv
[6e123f1eeb2facbe]
|
384,911,062 |
3B1CD2A7 |
|
086-DFS_on_trees.mkv
[8bc427238a6b9fec]
|
53,386,889 |
1C6D3778 |
|
102-Dinics_Algorithm_Code.mkv
[873a566b993fc415]
|
646,966,751 |
A662F12A |
|
078-Coding_the_Algorithm.mkv
[67649acd0d56855b]
|
282,262,862 |
8F4EA695 |
|
074-Introduction_and_definitions.mkv
[526ea654d69882f3]
|
99,036,164 |
FACE2405 |
|
026-Cycle_Detection_in_Undirected_Graph.mkv
[c4ab58f19f4bac9c]
|
14,241,574 |
96658FCF |
|
060-TSP_DP_and_Bitmasking.mkv
[cbb1113aeb10cd5e]
|
15,093,607 |
2CE07081 |
|
090-Code.mkv
[32096fc616dcaf1a]
|
63,103,725 |
3B49E7FD |
|
036-Topological_Ordering_using_DFS_Code.mkv
[8930016558a916c4]
|
21,503,662 |
690A59C1 |
|
070-Introduction_to_DFS_tree_and_Backedges.mkv
[daf981217b7d8502]
|
55,547,416 |
4A6AB917 |
|
059-TSP_Brute_Force.mkv
[9c485efaedf3abff]
|
60,243,335 |
A42645C8 |
|
006-Sublime_Setup.mkv
[6e40a351b4e5dee3]
|
50,685,306 |
6AF2F68D |
|
065-Make_Largest_island.mkv
[d1b625ddc55cb0d5]
|
339,617,999 |
61D2E5A4 |
|
072-DFS_Tree_and_Backedges_in_Directed_and_Undirectde_graphs.mkv
[218b1c5561cb668d]
|
421,485,881 |
842E52BA |
|
supplemental_assets\LCA using 2 pointers.cpp |
985 |
45E85E8E |
|
supplemental_assets\Flood Fill Total connected Components.cpp |
757 |
1997EF07 |
|
supplemental_assets\kosaraju algorithm for SCC.cpp |
1,087 |
6707013A |
|
supplemental_assets\Flood Fill make largest island.cpp |
1,445 |
BB24F5EC |
|
supplemental_assets\flood fill largest island.cpp |
1,445 |
BB24F5EC |
|
supplemental_assets\print cycle in a graph.cpp |
940 |
D16A0D51 |
|
supplemental_assets\multisurce BFS (minimum distance).cpp |
1,083 |
5D1AE901 |
|
supplemental_assets\DFS tree and backedge code.cpp |
668 |
5CC77A86 |
|
supplemental_assets\dinic's algprithm.cpp |
2,004 |
C35A6490 |
|
supplemental_assets\articulation point and bridges.cpp |
1,159 |
2ADD34B2 |
|
supplemental_assets\ancestor printing .cpp |
587 |
6FB3C276 |
|
supplemental_assets\Multi source BFS minimum operations .cpp |
1,083 |
5D1AE901 |
|
supplemental_assets\best euler tour |
1,130 |
05B654E0 |
|
supplemental_assets\shortest path from first row to last row.cpp |
1,294 |
5D8E3D7B |
|
supplemental_assets\DFS tree and backedges in Directed Graphs.cpp |
793 |
2D7073A4 |
|
supplemental_assets\euler tours.cpp |
706 |
A0A3CD8C |
|
supplemental_assets\topological Order.cpp |
672 |
BF22E7E9 |
|
supplemental_assets\LCA using sparse table.cpp |
1,540 |
D26929F0 |
|
supplemental_assets\Flood fill color count.cpp |
1,061 |
EF80E619 |
|
supplemental_assets\re rooting .cpp |
1,376 |
6AA80243 |
|
supplemental_assets\Re-rooting brrute force.cpp |
705 |
346E9FCF |
|
020-BFS_Shortest_Path.mkv
[bdaa83df5f197de9]
|
15,080,129 |
35072342 |
|
085-Introduction_and_properties_of_trees.mkv
[9b2cb2a89e6ad4aa]
|
467,835,633 |
99A124D2 |
|
045-Prims_Algorithm.mkv
[c134e6814c12e0fd]
|
51,681,751 |
8547AB81 |
|
053-Bellman_Ford_Code.mkv
[76dc35edc07fec18]
|
23,328,452 |
DB88A750 |
|
008-Escaping_Online_Judges.mkv
[e3be5dd4b977c1c5]
|
27,050,405 |
60E4B159 |
|
033-Topological_Sort_Algorithm.mkv
[e8c1bfb3ae48946c]
|
17,484,405 |
4718ED37 |
|
093-LCA_using_Binary_Lifting.mkv
[56d4a7840f8a467b]
|
785,460,872 |
9CF133BB |
|
100-Ford-Fulkerson_and_Edmond-Karp_Algorithm.mkv
[6786c047aa4a4c96]
|
517,719,613 |
8583CC68 |
|
105-Board_Game_Code.mkv
[df084cc281f9cce2]
|
87,072,849 |
F4735FE5 |
|
027-Cycle_Detection_in_Undirected_Graph_Code.mkv
[5ea61286b0e44362]
|
39,556,129 |
F8890E48 |
|
039-DSU_Data_Structure.mkv
[e0dafa815354c9c4]
|
22,716,557 |
E4E7C61B |
|
037-Disjoint_Set_Union_Introduction.mkv
[7e8cb9c0ba242fc9]
|
16,070,517 |
A8CFD0D1 |
|
063-Coloring_Islands.mkv
[add6fe71bbd6718a]
|
44,558,277 |
1DEFCD4F |
|
081-Introduction_to_Strongly_Connected_Component.mkv
[1a961e4836661190]
|
112,767,112 |
DC25CB73 |
|
080-Algorithm_and_Code_to_find_Topological_Ordering.mkv
[9bf0bf8b91be6b17]
|
224,048,002 |
6BF2B631 |
|
055-Floyd_Warshall_Code.mkv
[4b59722869a7d157]
|
38,246,163 |
ADB9F49D |
|
068-Bonus_Problem_on_Multi_Source_BFS.mkv
[985b03b9c157c61c]
|
203,168,051 |
93D0FBA4 |
|
025-Largest_Island_Solution.mkv
[9263177ab283b7ca]
|
72,301,736 |
F8E2DEF7 |
|
040-DSU_Implementation.mkv
[e6f9a674805c8b1f]
|
46,471,605 |
AF26174F |
|
054-Floyd_Warshall.mkv
[7045243e6daee142]
|
124,213,269 |
91083896 |
|
031-Bipartite_Graph_Code.mkv
[271de2a2c9f36ab5]
|
47,668,251 |
1EAC2B79 |
|
016-Adjacency_List_Representation_with_Node_Class.mkv
[5a7d41715b0ef172]
|
42,377,125 |
54ABE3FC |
|
094-Introduction_and_brute_force.mkv
[7664dfd320ef009d]
|
231,762,277 |
6DAD2078 |
|
010-Using_Macros.mkv
[76232b405f90f91e]
|
41,595,047 |
DADD1902 |
|
066-Introduction_to_Multi_Source_BFS.mkv
[ed616a107e06b54]
|
150,553,195 |
7BF6F61D |
|
009-Common_Code_Snippets.mkv
[3d239525e9ad039]
|
20,656,884 |
6D252D33 |
|
014-Graph_Key_Terms.mkv
[623fac45e68de607]
|
34,568,991 |
AE7610B0 |
|
075-Discovered_Time.mkv
[f04a9ecf09d40785]
|
133,528,191 |
33509070 |
|
058-Travelling_Salesman_Intution.mkv
[58cf047e6cbaf541]
|
19,077,796 |
9EA126C7 |
|
073-Print_cycle_in_a_graph.mkv
[258caac4798ff0f4]
|
142,111,812 |
FF73335B |
|
007-Adding_Master_Header_File.mkv
[f9a27122feee2c5]
|
64,521,496 |
3898806F |
|
076-Lowest_Time_or_Low_Link.mkv
[3f641dfe5cff1f77]
|
417,447,510 |
67A27116 |
|
030-Bipartite_Graph.mkv
[2221ae24b84fc158]
|
20,898,469 |
5AC0D619 |
|
018-Breadth_First_Search.mkv
[d8f3f76e5b7bec8d]
|
25,752,709 |
7D02C6BE |
|
061-Flood_Fill_Introduction.mkv
[c5a7c5d6fee76c15]
|
77,256,734 |
C2BB8682 |
|
091-Introduction.mkv
[1003c8fcb3d05765]
|
197,142,238 |
7CABC28F |
|
057-Travelling_Salesman_Problem.mkv
[bdeac39cff2a256f]
|
51,586,346 |
63EA8D3D |
|
103-Applications_of_Max_Flow_as_Maximum_Bipartite_Matching.mkv
[342d415267521228]
|
599,749,016 |
7388C19F |
|
050-Dijkshtras_Algorithm.mkv
[24d5e4de9223c2fd]
|
37,497,380 |
2B8A67E8 |
|
041-Union_by_Rank.mkv
[e09e956c6600a58b]
|
45,082,178 |
8148308B |
|
043-DSU_Dry_Run.mkv
[2495da5706ba7583]
|
60,439,891 |
6D05C21B |
|
035-Toplogical_Order_using_DFS.mkv
[4368f3bc30cf3669]
|
18,761,381 |
E74C7E04 |
|
046-Prims_Code.mkv
[c740def488978f29]
|
80,994,812 |
A7B80248 |
|
012-Graphs_Introduction.mkv
[e45471cd1aa1694f]
|
48,827,739 |
19F8ECF5 |
|
051-Dijkshtras_Algorithm_Code.mkv
[c06189657d9cb414]
|
70,959,662 |
69138B8E |
|
067-Problem_on_Multi_Source_BFS.mkv
[c40c1fbe9818ec83]
|
383,924,036 |
F8A8FC0A |
|
099-Residual_Networks_and_Augmenting_Paths.mkv
[be9e99d4519945ed]
|
479,391,975 |
314700E3 |
|
028-Directed_Graph-Cycle_Detection.mkv
[93546866f534cdc]
|
35,821,441 |
E901CFCC |
|
032-Directed_Acyclic_Graph_and_Topological_Ordering.mkv
[16bf6e2c33623e8a]
|
28,076,426 |
C9D43FFD |
|
047-Kruskals_Algorithm.mkv
[38bfbfd4127f121d]
|
26,384,754 |
F8366F5F |
|
098-Introduction_to_Maximum_Flow_in_a_Network.mkv
[c3fee5ce8bc97d3]
|
123,038,458 |
1D3B1B49 |
|
011-Example_Code_Explained.mkv
[cc43e9c0f603e908]
|
288,336,047 |
9873292E |
|
019-BFS_Code.mkv
[9c5abad3086d452e]
|
107,178,736 |
E225DBC5 |
|
079-Introduction_to_Topological_Order_and_Strongly_Connected_Components.mkv
[afde44f21492becb]
|
212,938,995 |
B8CB07B0 |
|
087-Print_all_ancestors_in_a_tree.mkv
[eb102b59b814c573]
|
212,103,139 |
F72760F5 |
|
034-Topological_Ordering_BFS_Code.mkv
[4e9d17f5d46fde8d]
|
19,324,435 |
27555AC4 |
|
077-Algorithm.mkv
[e1c810cf188ae71d]
|
203,131,456 |
B512E729 |
|
064-Biggest_Island.mkv
[1293318c8a7f8aa5]
|
29,885,600 |
78D9B96A |
|
supplemental_assets |
0 |
00000000 |
|
| Total size: |
13,725,367,608 |
|
|
