Teoria dos Grafos

1. Conceitos elementares
   1. Fundamentos
   2. Representação de grafos
      1. Codeforces Round #464 (Div. 2) - Problem A: Love Triangle (upsolving)
      2. OJ 11991 - Easy Problem from Rujia Liu? (upsolving)
2. Travessia
   1. Travessia por profundidade
      1. Codeforces Round #503 (by SIS, Div. 2) - Problem B: Badge (upsolving)
      2. OJ 10113 - Exchange (upsolving)
   2. Travessia por largura
      1. Codeforces Round #470 (Div. 2) - Problem A: Protect Sheep (upsolving)
      2. OJ 10687 - Monitoring the Amazon (upsolving)
3. Aplicações de travessias
   1. Componentes conectados
      1. Educational Codeforces Round 33 (Rated for Div. 2) - Problem C: Rumor (upsolving)
      2. OJ 11094 - Continents (upsolving)
   2. Detecção de ciclos
      1. AtCoder Beginner Contest 174 - Problem C: Repsept (upsolving)
      2. OJ 10116 - Robot Motion (upsolving)
   3. Grafos bipartidos
      1. Codeforces Round #435 (Div. 2) - Problem B: Mahmoud and Ehab and the bipartiteness (upsolving)
      2. OJ 10505 - Montesco vs Capuleto (upsolving)
   4. Pontes e pontos de articulação
      1. SPOJ SUBMERGE - Submerging Islands (upsolving)
      2. OJ 610 - Street Directions (upsolving)
4. Caminhos mínimos
   1. Definição de caminho mínimo
      1. AtCoder Beginner Contest 088 - Problem D: Grid Repainting (upsolving)
      2. OJ 10000 - Longest Paths (upsolving)
   2. Algoritmo de Bellman-Ford
      1. CSES 1637 - High Score (upsolving)
      2. OJ 534 - Frogger (upsolving)
   3. Algoritmo de Dijkstra
      1. OJ 1112 - Mice and Maze (upsolving)
      2. AtCoder Beginner Contest 143 - Problem E: Travel by Car (upsolving)
   4. BFS 0/1
      1. OJ 11573 - Ocean Currents (upsolving)
      2. Codeforces Round #516 (Div. 1) - Problem B: Labyrinth (upsolving)
   5. Algoritmo de Floyd-Warshall
      1. OJ 10717 - Meeting Prof. Miguel... (upsolving)
      2. Codeforces Round #179 (Div. 1) - Problem B: Greg and Graph (upsolving)
5. Árvores
   1. Fundamentos
   2. Travessias
      1. AtCoder Beginner Contest 126 -- Problem D: Even Relation (upsolving)
      2. OJ 10459 - The Tree Root (upsolving)
   3. Diâmetro
      1. OJ 10308 - Roads in the North (upsolving)
      2. AIZU GRL 5A - Diameter of a Tree (upsolving)
6. Árvore mínima geradora
   1. Definição
   2. Algoritmo de Kruskal
      1. OJ 10600 - ACM contest and Blackout (upsolving)
      2. OJ 10369 - Arctic Network (upsolving)
   3. Algoritmo de Prim
      1. SPOJ IITKWPCG - Help the old King (upsolving)
      2. OJ 10099 - The Tourist Guide (upsolving)
7. Grafos direcionados
   1. Ordenação topológica
      1. SPOJ TOPOSORT - Topological Sort (upsolving)
      2. Timus 1280 - Topological Sort (upsolving)
   2. Programação dinâmica em DAGs
      1. CSES 1202 - Investigation (upsolving)
      2. SPOJ DAGCNT2 - Counting in a DAG (upsolving)
   3. Grafos de sucessores
      1. CSES 1750 - Planets Queries I (upsolving)
      2. USACO 764 - The Bovine Shuffle (upsolving)
   4. Ciclos em grafos de sucessores
8. Componentes fortemente conectados
   1. Definição
   2. Algoritmo de Kosaraju
   3. 2SAT
9. Consultas em árvores
   1. Ancestrais
   2. Subárvores e caminhos
   3. ancestral comum mais próximo
   4. Algoritmos offline
10. Caminhos e circuitos
    1. Caminhos eulerianos
    2. Caminhos hamiltonianos
    3. Sequêncies de Bruijn
    4. Travessia do cavalo
11. Fluxo
    1. Fluxos e cortes
    2. Algoritmo de Ford-Fulkerson
    3. Caminhos disjuntos
    4. Pareamentos máximos
    5. Cobertura de caminhos