Resources:
Centroid Decomposition
Centroid Decomposition on a tree(Beginner)
centroid-decomposition.html
A Visual Introduction to Centroid Decomposition
iq.opengenus.org
Code for Food
commonlounge.com
Coding Start Up! blog
Cf problems ContestCentroid Decomposition of a Tree
GKCS
Ista
Algorithms live
Vjudge contest&nbs...
Showing posts with label Graph Theory. Show all posts
Showing posts with label Graph Theory. Show all posts
স্টেবল ম্যারেজ প্রবলেম
Resources:
Algorithm — Stable matching problem implementation using c++
The Stable Marriage Problem and School Choice
Stable Marriage Problem
স্টেবল ম্যারেজ প্রবলেম
Shakil Ahmed's video
Implementation:
This file contains bidirectional Unicode text that...
Round Trip
Problem Link: Round Trip
Resources:
Checking a graph for acyclicity and finding a cycle in O(M)
Detect cycle in an undirected graph using BFS
Detect cycle in an undirected graph
Implementation:
This file contains bidirectional Unicode text that...
Maximum flow problem
Resources:
wikipedia.org
ম্যাক্সিমাম ফ্লো (১)
ম্যাক্সিমাম ফ্লো (২)
Topcoder tutorial link
One problem solution discussion
CP Algorithms
Implementation:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below....
D - Coloring Edges on Tree
Problem link: Coloring Edges on Tree
Explanation: GfG
Implementation:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
...
ICPC Dhaka Regional- 2019
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Show...
Floyd-Warshall Algorithm
Resources:
গ্রাফ থিওরিতে হাতেখড়ি ১০: ফ্লয়েড ওয়ার্শল
CP-Algorithms
ইকরাম মাহমুদ
smilitude
Implementation:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals...
স্ট্রংলি কানেক্টেড কম্পোনেন্ট
Resource:
গ্রাফ থিওরিতে হাতেখড়ি ১৪ – স্ট্রংলি কানেক্টেড কম্পোনেন্ট
Finding strongly connected components Building condensation graph
This file contains bidirectional...
1049 - One Way Roads
1049 - One Way Roads
Topic: DFS
concept: কস্টকে ডিরেক্টটেড ধরবো তারপর আনডিক্টটেড গ্রাফ এ ডিএফএস চালাবো.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals...
TOPOSORT - Topological Sorting
TOPOSORT - Topological Sorting
Topic: Topological Sorting
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn...
Topological Sorting
Resource Link
Topological Sorting (E-Maxx)
Kahn’s algorithm for Topological Sorting
Topological Sorting
TopSort using DFS:
...
1002 - Country Roads
1002 - Country Roads
Topic: dijkstra
solution 01:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about...
Dijkstra Algorithm
Resource Link
Dijkstra Algorithm
Dijkstra on sparse graphs
This file contains bidirectional Unicode text...
Breadth First Search
Blog Link:
গ্রাফ থিওরিতে হাতেখড়ি-৪(ব্রেডথ ফার্স্ট সার্চ)
Visualization
visualgo.net
ট্রি...
Kruskal’s Algorithm [ Minimum Spanning Tree ]
Kruskal’s Algorithm [ Minimum Spanning Tree ]
গ্রাফ থিওরিতে হাতেখড়ি ৬: মিনিমাম স্প্যানিং ট্রি(ক্রুসকাল অ্যালগোরিদম)
Visualization
Hackerearth
Implementation 01:
//copy
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
#include<bits/stdc++.h>
using...
315 - Network
315 - Network
Topic : Graph Theory(AP)
Solution 01:
//copy
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include<bits/stdc++.h>
using namespace std;
#define Max 100000
vector<int> graph[Max];
int...
Articulation Points and Bridges
Resource:
বাইকানেক্টেড কম্পোনেন্ট , ব্রিজ, আরটিকুলেশন পয়েন্ট [ থিওরি ]
গ্রাফ থিওরিতে হাতেখড়ি ১৩: আর্টিকুলেশন পয়েন্ট এবং ব্রিজ
Visualization
CF blog
Finding bridges in a graph in O(N+M)
Finding articulation points in a graph in O(N+M)
Articulation Points:01
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include<bits/stdc++.h>
using...
802. Find Eventual Safe States
802. Find Eventual Safe States
Solution: DFS
concept:
যেই নোডগুলোতে সাইকেল নাই ওই গুলা প্রিন্ট করতে হবে।
Code:
class Solution {public: unordered_set<int> cycle_nodes, safe_nodes; bool dfs(vector<vector<int>>& g, int i, unordered_set<int>visited_nodes) ...