Блог пользователя ND_

Автор ND_, 3 года назад, По-английски

Hello Codeforces!!

In this blog, I have categorized almost all CSES graph problems according to their topics. If you are a beginner and want to learn graph, below is the list of topics you can learn and problems that you can solve topic wise.

• DFS/BFS traversals

Topics

○ Cycle detection in directed graph using DFS and topological sorting.
○ Cycle detection in undirected graph using DFS. ○ Bipartite checking. ○ Shortest path in unweighted graph.

Problems

Counting RoomsLabyrinthBuilding RoadsMessage RoutesBuilding TeamsRound TripMonstersRound Trip 2

• Optimal Path algorithms

Topics

○ Dijkstras algo ○ Bellman Ford algo + Detect Negetive Cycle ○ Floyd Warshall algo. ○ Shortest Path in DAG using topological sorting

Problems

Shortest Routes 1Shortest Routes 2High ScoreFlight DiscountCycle FindingFlight Routes

• Minimum spanning trees

Topics

○ Prims algo ○ Krushkals algo using DSU

Problems

Road RepairationRoad Construction (DSU Only)

• Directed Graphs(Graph DP)

Topics

○ Topological sorting ○ Graph Dp(How many paths, shortest and longest paths etc)

Problems

Course ScheduleLongest Flight RouteGame RoutesInvestigation

• Functional Graphs

Topics

○ Finding cycles node and length. ○ Finding distance between nodes

Problems

Planet Queries ( LCA ) ○ Planet Queries 2Planet CyclesSecret Santa

• Strongly Connected Components

Topics

○ Kosarajus algo. ○ 2-SAT

Problems

Flight Route CheckPlanets And kingdomsCoin CollectorGiant Pizza

• Eulerian Path and Circuit

Topics

○ Hierholzer's algorithm

Problems

Mail Delivery (Circuit) ○ Teleporters Path (Path)

  • Проголосовать: нравится
  • +14
  • Проголосовать: не нравится

»
3 года назад, # |
  Проголосовать: нравится +1 Проголосовать: не нравится

Thanks a lot.

»
3 года назад, # |
  Проголосовать: нравится +4 Проголосовать: не нравится

Functional Graphs?

»
3 года назад, # |
Rev. 2   Проголосовать: нравится +1 Проголосовать: не нравится

Thank you very much, u deserve some more upvotes bro!!!

»
3 года назад, # |
  Проголосовать: нравится +1 Проголосовать: не нравится

I see it is really useful, thank you so much!

»
7 недель назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

thanks