├── 01-Find Center of Star Graph.cpp ├── 02-Maximal Network Rank.cpp ├── 03-Minimum Degree of a Connected Trio in a Graph.cpp ├── 04-Snakes and Ladder Game.cpp ├── 05-Message Route.cpp ├── 06-Word Ladder.cpp ├── 07-Valid Bfs.cpp ├── 08-Keys and Rooms.cpp ├── 09-Largest Island.cpp ├── 10-Astronaut Pairs.cpp ├── 11-Reconstruct Itinerary.cpp ├── 12-Cycle Detection in Undirected Graph.cpp ├── 13-Directed Graph Cycle Detection.cpp ├── 14-Course Schedule.cpp ├── 15-Is Graph Bipartite.cpp ├── 16-Detecting an Odd Length Cycle.cpp ├── 17-Detect Cycles in Grid.cpp ├── 18-Shortest Cycle in Undirected Graph.cpp ├── 19-All Paths From Source to Target.cpp ├── 20-Course Schedule II.cpp ├── 21-Largest Color Value in a Directed Graph.cpp ├── 22-Game Routes.cpp ├── 23-Disjoint Set Union.cpp ├── 24-Forest Detection.cpp ├── 25-Useless Connection.cpp ├── 26-Communication Between Towers.cpp ├── 27-Make Network Connected.cpp ├── 28-Special Paths.cpp ├── 29-Minimum Spanning Cost.cpp ├── 30-Connect All.cpp ├── 31-Remove Maximum Number of Edges.cpp ├── 32-Build Roads.cpp ├── 33-Find Critical and Pseudo-Critical Edges in MST.cpp ├── 34-Dijkstra.cpp ├── 35-Delay Time in Network.cpp ├── 36-Shortest Grid Path.cpp ├── 37-Cheapest Flight Within K Stops.cpp ├── 38-City With the Smallest Number of Neighbours at a Threshold Distance.cpp ├── 39-Travel by Car.cpp ├── 40-Shortest Superstring.cpp ├── 41-Number of Islands.cpp ├── 42-Flood Fill.cpp ├── 43-Number of Closed Islands.cpp ├── 44-Border Coloring.cpp ├── 45-Make Largest Island.cpp ├── 46-Rotting Oranges.cpp ├── 47-Shortest Bridge.cpp ├── 48-Highest Peak.cpp ├── 49-Minimum Height Trees.cpp ├── 50-Minimum Cost to Make Valid Path in a Grid.cpp ├── 51-Bob and Destructive Mind.cpp ├── 52-Fault in a Network.cpp ├── 53-Connected Cities.cpp ├── 54-GCD on Directed Path.cpp ├── 55-Subtree Problem.cpp ├── 56-Path on Tree.cpp ├── 57-Cut'em All!.cpp ├── 58-Tree Diameter.cpp ├── 59-Tree Distances.cpp ├── 60-Path Queries.cpp ├── 61-Subtree Queries.cpp ├── 62-Tree Queries.cpp ├── 63-Count Descendants.cpp ├── 64-New Year Tree.cpp ├── 65-Lowest Common Ancestor.cpp ├── 66-Distance Queries.cpp ├── 67-Path Xor.cpp ├── 68-A maximum Path.cpp ├── 69-Xor Distances.cpp ├── 70-Distance Sum.cpp ├── 71-Maximum White Subtree.cpp ├── 72-Choosing Capital for Treeland.cpp ├── 73-Distance in tree.cpp ├── 74-Tree with Maximum Cost.cpp ├── 75-Maximum Students Taking Exam.cpp ├── 76-Download Speed.cpp ├── 77-Count Pair of Nodes.cpp ├── 78-Longest Increasing Path.cpp ├── 79-Holiday Accommodation.cpp ├── 80-Distinct Colors.cpp └── README.md /01-Find Center of Star Graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/01-Find Center of Star Graph.cpp -------------------------------------------------------------------------------- /02-Maximal Network Rank.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/02-Maximal Network Rank.cpp -------------------------------------------------------------------------------- /03-Minimum Degree of a Connected Trio in a Graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/03-Minimum Degree of a Connected Trio in a Graph.cpp -------------------------------------------------------------------------------- /04-Snakes and Ladder Game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/04-Snakes and Ladder Game.cpp -------------------------------------------------------------------------------- /05-Message Route.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/05-Message Route.cpp -------------------------------------------------------------------------------- /06-Word Ladder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/06-Word Ladder.cpp -------------------------------------------------------------------------------- /07-Valid Bfs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/07-Valid Bfs.cpp -------------------------------------------------------------------------------- /08-Keys and Rooms.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/08-Keys and Rooms.cpp -------------------------------------------------------------------------------- /09-Largest Island.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/09-Largest Island.cpp -------------------------------------------------------------------------------- /10-Astronaut Pairs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/10-Astronaut Pairs.cpp -------------------------------------------------------------------------------- /11-Reconstruct Itinerary.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/11-Reconstruct Itinerary.cpp -------------------------------------------------------------------------------- /12-Cycle Detection in Undirected Graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/12-Cycle Detection in Undirected Graph.cpp -------------------------------------------------------------------------------- /13-Directed Graph Cycle Detection.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/13-Directed Graph Cycle Detection.cpp -------------------------------------------------------------------------------- /14-Course Schedule.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/14-Course Schedule.cpp -------------------------------------------------------------------------------- /15-Is Graph Bipartite.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/15-Is Graph Bipartite.cpp -------------------------------------------------------------------------------- /16-Detecting an Odd Length Cycle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/16-Detecting an Odd Length Cycle.cpp -------------------------------------------------------------------------------- /17-Detect Cycles in Grid.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/17-Detect Cycles in Grid.cpp -------------------------------------------------------------------------------- /18-Shortest Cycle in Undirected Graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/18-Shortest Cycle in Undirected Graph.cpp -------------------------------------------------------------------------------- /19-All Paths From Source to Target.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/19-All Paths From Source to Target.cpp -------------------------------------------------------------------------------- /20-Course Schedule II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/20-Course Schedule II.cpp -------------------------------------------------------------------------------- /21-Largest Color Value in a Directed Graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/21-Largest Color Value in a Directed Graph.cpp -------------------------------------------------------------------------------- /22-Game Routes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/22-Game Routes.cpp -------------------------------------------------------------------------------- /23-Disjoint Set Union.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/23-Disjoint Set Union.cpp -------------------------------------------------------------------------------- /24-Forest Detection.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/24-Forest Detection.cpp -------------------------------------------------------------------------------- /25-Useless Connection.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/25-Useless Connection.cpp -------------------------------------------------------------------------------- /26-Communication Between Towers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/26-Communication Between Towers.cpp -------------------------------------------------------------------------------- /27-Make Network Connected.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/27-Make Network Connected.cpp -------------------------------------------------------------------------------- /28-Special Paths.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/28-Special Paths.cpp -------------------------------------------------------------------------------- /29-Minimum Spanning Cost.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/29-Minimum Spanning Cost.cpp -------------------------------------------------------------------------------- /30-Connect All.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/30-Connect All.cpp -------------------------------------------------------------------------------- /31-Remove Maximum Number of Edges.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/31-Remove Maximum Number of Edges.cpp -------------------------------------------------------------------------------- /32-Build Roads.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/32-Build Roads.cpp -------------------------------------------------------------------------------- /33-Find Critical and Pseudo-Critical Edges in MST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/33-Find Critical and Pseudo-Critical Edges in MST.cpp -------------------------------------------------------------------------------- /34-Dijkstra.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/34-Dijkstra.cpp -------------------------------------------------------------------------------- /35-Delay Time in Network.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/35-Delay Time in Network.cpp -------------------------------------------------------------------------------- /36-Shortest Grid Path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/36-Shortest Grid Path.cpp -------------------------------------------------------------------------------- /37-Cheapest Flight Within K Stops.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/37-Cheapest Flight Within K Stops.cpp -------------------------------------------------------------------------------- /38-City With the Smallest Number of Neighbours at a Threshold Distance.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/38-City With the Smallest Number of Neighbours at a Threshold Distance.cpp -------------------------------------------------------------------------------- /39-Travel by Car.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/39-Travel by Car.cpp -------------------------------------------------------------------------------- /40-Shortest Superstring.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/40-Shortest Superstring.cpp -------------------------------------------------------------------------------- /41-Number of Islands.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/41-Number of Islands.cpp -------------------------------------------------------------------------------- /42-Flood Fill.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/42-Flood Fill.cpp -------------------------------------------------------------------------------- /43-Number of Closed Islands.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/43-Number of Closed Islands.cpp -------------------------------------------------------------------------------- /44-Border Coloring.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/44-Border Coloring.cpp -------------------------------------------------------------------------------- /45-Make Largest Island.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/45-Make Largest Island.cpp -------------------------------------------------------------------------------- /46-Rotting Oranges.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/46-Rotting Oranges.cpp -------------------------------------------------------------------------------- /47-Shortest Bridge.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/47-Shortest Bridge.cpp -------------------------------------------------------------------------------- /48-Highest Peak.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/48-Highest Peak.cpp -------------------------------------------------------------------------------- /49-Minimum Height Trees.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/49-Minimum Height Trees.cpp -------------------------------------------------------------------------------- /50-Minimum Cost to Make Valid Path in a Grid.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/50-Minimum Cost to Make Valid Path in a Grid.cpp -------------------------------------------------------------------------------- /51-Bob and Destructive Mind.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/51-Bob and Destructive Mind.cpp -------------------------------------------------------------------------------- /52-Fault in a Network.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/52-Fault in a Network.cpp -------------------------------------------------------------------------------- /53-Connected Cities.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/53-Connected Cities.cpp -------------------------------------------------------------------------------- /54-GCD on Directed Path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/54-GCD on Directed Path.cpp -------------------------------------------------------------------------------- /55-Subtree Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/55-Subtree Problem.cpp -------------------------------------------------------------------------------- /56-Path on Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/56-Path on Tree.cpp -------------------------------------------------------------------------------- /57-Cut'em All!.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/57-Cut'em All!.cpp -------------------------------------------------------------------------------- /58-Tree Diameter.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/58-Tree Diameter.cpp -------------------------------------------------------------------------------- /59-Tree Distances.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/59-Tree Distances.cpp -------------------------------------------------------------------------------- /60-Path Queries.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/60-Path Queries.cpp -------------------------------------------------------------------------------- /61-Subtree Queries.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/61-Subtree Queries.cpp -------------------------------------------------------------------------------- /62-Tree Queries.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/62-Tree Queries.cpp -------------------------------------------------------------------------------- /63-Count Descendants.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/63-Count Descendants.cpp -------------------------------------------------------------------------------- /64-New Year Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/64-New Year Tree.cpp -------------------------------------------------------------------------------- /65-Lowest Common Ancestor.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/65-Lowest Common Ancestor.cpp -------------------------------------------------------------------------------- /66-Distance Queries.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/66-Distance Queries.cpp -------------------------------------------------------------------------------- /67-Path Xor.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/67-Path Xor.cpp -------------------------------------------------------------------------------- /68-A maximum Path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/68-A maximum Path.cpp -------------------------------------------------------------------------------- /69-Xor Distances.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/69-Xor Distances.cpp -------------------------------------------------------------------------------- /70-Distance Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/70-Distance Sum.cpp -------------------------------------------------------------------------------- /71-Maximum White Subtree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/71-Maximum White Subtree.cpp -------------------------------------------------------------------------------- /72-Choosing Capital for Treeland.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/72-Choosing Capital for Treeland.cpp -------------------------------------------------------------------------------- /73-Distance in tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/73-Distance in tree.cpp -------------------------------------------------------------------------------- /74-Tree with Maximum Cost.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/74-Tree with Maximum Cost.cpp -------------------------------------------------------------------------------- /75-Maximum Students Taking Exam.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/75-Maximum Students Taking Exam.cpp -------------------------------------------------------------------------------- /76-Download Speed.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/76-Download Speed.cpp -------------------------------------------------------------------------------- /77-Count Pair of Nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/77-Count Pair of Nodes.cpp -------------------------------------------------------------------------------- /78-Longest Increasing Path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/78-Longest Increasing Path.cpp -------------------------------------------------------------------------------- /79-Holiday Accommodation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/79-Holiday Accommodation.cpp -------------------------------------------------------------------------------- /80-Distinct Colors.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/MountAim/Graph-Coding-Minutes/HEAD/80-Distinct Colors.cpp -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Graph-Coding-Minutes 2 | Codes 3 | --------------------------------------------------------------------------------