https://cienciaprogramada.com/tags/cycles/ Recent content in cycles on Ciência Programada Hugo -- gohugo.io en contato[@]cienciaprogramada.com.br (Francisco Bustamante) contato[@]cienciaprogramada.com.br (Francisco Bustamante) © 2026 Francisco Bustamante Thu, 13 Aug 2026 00:00:00 +0000 https://cienciaprogramada.com/2026/08/paths-cycles/ Thu, 13 Aug 2026 00:00:00 +0000 contato[@]cienciaprogramada.com.br (Francisco Bustamante) https://cienciaprogramada.com/2026/08/paths-cycles/ How do we know whether two points of a network are connected, and by which shortest path? We define walk, trail, path, and cycle, connectivity and distance, compute distances with breadth-first search and Dijkstra, and prove that a graph is bipartite if and only if it has no odd cycle.