Hi all, what are some good algorithms/concepts to learn to get better at graph problems? I can usually tackle most tree problems since most of them rely on some form of modified DFS/BFS, but struggle with anything beyond that.

# | User | Rating |
---|---|---|

1 | Benq | 3783 |

2 | jiangly | 3710 |

3 | tourist | 3662 |

4 | Um_nik | 3526 |

5 | ko_osaga | 3500 |

6 | maroonrk | 3488 |

7 | ecnerwala | 3478 |

8 | inaFSTream | 3477 |

9 | fantasy | 3470 |

10 | QAQAutoMaton | 3428 |

# | User | Contrib. |
---|---|---|

1 | Um_nik | 185 |

2 | adamant | 177 |

2 | awoo | 177 |

4 | nor | 169 |

5 | maroonrk | 165 |

6 | -is-this-fft- | 163 |

7 | antontrygubO_o | 155 |

8 | ko_osaga | 151 |

8 | dario2994 | 151 |

10 | SecondThread | 149 |

Hi all, what are some good algorithms/concepts to learn to get better at graph problems? I can usually tackle most tree problems since most of them rely on some form of modified DFS/BFS, but struggle with anything beyond that.

↑

↓

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/29/2023 12:10:15 (k3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

Hello there

Well, as a good source for learning graph theory concepts, I would suggest "introduction to graph theory" written by "Douglas Brent West".

Many of the theorems and lemmas that are talked about in the book may not be applied directly in problems, but the more you see about graphs, you will feel better about solving related problems.

Also, some really nice and useful ideas for proving graph-related lemmas are discussed in the book, which will help you when you want to prove a property about a class of graphs and use them to solve a problem, even in contests or similar situations.

And also I have found some nice graph problems on this website, in the "graph" category.

hope these can help :)

Sorry I missed your comment before, this is super helpful! A2 online judge especially seems like a great resource.