Life Coding

Life is nothing but problem solving :)

Menu

Skip to content
  • Home
  • About Me
  • Code Book
  • CP FAQ
  • CP Resources
  • Online Programming Camp 2020

Tag Archives: Graph Theory

Programming Camp 2020 Session 3: Graph Theory

0
Posted on September 6, 2020 by Tanmoy Datta

  • Camp materials:

    • Graph Theory Discussion Slide
    • Implemented Codes of all the discussed topics
    • Graph Theory Resources
  • Discussed topics (with further reading resources):

    • Breadth-first search (BFS)
    • Depth First Search (DFS)
    • 0-1 BFS  (Additional Resource)
    • Dijkstra Algorithm
    • Shortest Path Faster Algorithm (SPFA) (Additional Resource)
    • Floyd–Warshall (Additional Resource)
    • Articulation Point
    • Articulation Bridge
    • Biconnected Component (BCC)
    • Block-Cut Tree (Additional Resource)
    • Strongly Connected Components (SCC) (Additional Resource)
    • 2 – SAT (Additional Resource)
  • Additional Reading for Graph Theory:

    • Algorithm Gym :: Graph Algorithms (CF Blog)
    • গ্রাফ থিওরী – শর্টেস্ট পাথ প্রবলেম (Progkriya)
    • Graph Theory Posts – By Shafaet Ashraf Bhai
    • Graph Section of CP-Algorithm
    • Competitive Programming 3 Book’s Chapter 4 – Graph
    • Competitive Programmer’s Handbook’s Graph Chapter
  • Discussed problems

    • LOJ 1251 – Forming the Council
    • LOJ 1026 – Critical Links
    • LOJ 1063 – Ant Hills
    • LOJ 1379 – Toll Management
    • LOJ 1308 – Ant Network
    • Codechef PALPATH – Palindromic Walks
  • Practice problems:

    • Graph Theory Contest – 01
    • Graph Theory Contest – 02
    • Graph Theory Contest – 03
Programming Camp Uncategorized Graph Theory Programming Camp 2020

Tags

Beginner Binary Search BIT Book Codechef coin Change Combinatorics Computational Geo Data Structure Dp Euler Totient Extended Euclid factorial Prime Factor Game Graph Theory Grundy Hash HLD ICPC Inclusion-Exclusion Josephus Line Sweep Longest Palindrome Manachar Algo Math mobius nCr Number Theory Partial Sum Pattern Prime factor Programming Camp 2020 Resources Segmented Sieve SGIPC Meetup 01 Sieve String Matching Strongly Connected Component(SCC) Tree

Categories

  • Ad Hoc
  • Algorithm
  • Articulation Point
  • Beginner
  • Bellman Ford
  • BFS
  • Binary Search
  • BIT (Binary Indexed Tree)
  • Bitmask
  • Codeforces
  • Coin Change
  • Combinatorics
  • Complete Search
  • Convex Hull
  • Data Structure
  • DFS
  • Dijkstra
  • DP
  • Dqueue
  • Floyed Warshal
  • Game Theory
  • Geometry
  • Graph Theory
  • Greedy
  • Grundy Game
  • Hashing
  • Heavy Light Decomposition
  • High thinking
  • Histogram
  • Inclusion-Exclusion
  • Inspirational
  • KMP
  • Knapsack
  • LCA
  • LCS
  • Light OJ
  • LIS
  • Live Arhive
  • Manachar Algorithm
  • Map
  • Math
  • Matrix Exponentiation
  • Maxflow
  • Merge Sort Tree
  • Minimum Spanning Tree
  • Modular Arithmatic
  • Nim
  • Number Theory
  • Programming Camp
  • Segment Tree
  • Sliding Window
  • Sparse Table
  • SPOJ
  • Stack
  • String Simulation
  • Strongly Connected Components(SCC)
  • Suffix Array
  • Template
  • Think out of the box
  • Topological Sort
  • Treap
  • Trie
  • Uncategorized
  • USACO
  • Useful Resources
  • UVa
© by Tanmoy Datta | Sponsored by MazeGeek Inc.