Caminhos mínimos (parte 2):
- https://neps.academy/lesson/200
- https://www.geeksforgeeks.org/finding-shortest-path-between-any-two-nodes-using-floyd-warshall-algorithm/
- https://www.youtube.com/watch?v=3SmGlcq0qJU
- https://www.youtube.com/watch?v=4NQ3HnhyNfQ
- https://github.com/maratonago/maratonago.github.io/raw/master/_includes/attached_files/flody-warshall_dijkstra/floyd-warshall-e-dijsktra.pdf
Ordenação topológica:
- https://neps.academy/lesson/198
- https://www.geeksforgeeks.org/topological-sorting/
- https://www.youtube.com/watch?v=8JIR4ITnD_Y&t=56s
- https://www.youtube.com/watch?v=eL-KzMXSXXI
- https://cp-algorithms-brasil.com/grafos/ot.html
- https://www.ime.usp.br/~pf/algoritmos_para_grafos/aulas/topo-graphs.html
Menor Ancestral Comun:
- https://neps.academy/lesson/199
- https://www.geeksforgeeks.org/lca-for-general-or-n-ary-trees-sparse-matrix-dp-approach-onlogn-ologn/
- https://www.youtube.com/watch?v=C9DLjFXZVAo
- https://www.youtube.com/watch?v=rA7JJG7x9vs
- https://cp-algorithms-brasil.com/grafos/lca.html
Extra: