April 2025
Intermediate to advanced
268 pages
6h 17m
Portuguese (Portugal, Brazil)
Content preview from Algoritmos de grafos
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Capítulo 4. Algoritmos de busca de caminhos e de grafos
Este trabalho foi traduzido com recurso a IA. Agradecemos o teu feedback e comentários: translation-feedback@oreilly.com
Algoritmos de pesquisa em grafos exploram um grafo para descoberta geral ou para pesquisa explícita.Estes algoritmos abrem caminhos através do grafo, mas não se espera que esses caminhos sejam computacionalmente óptimos. Iremos abordar a Breadth First Search e a Depth First Search porque são fundamentais para percorrer um grafo e são frequentemente um primeiro passo necessário para muitos outros tipos de análise.
Estes algoritmos são utilizados para identificar percursos óptimos através de um grafo para utilizações como o planeamento logístico, o encaminhamento de chamadas ou de IP ao menor custo e a simulação de jogos.
Especificamente, os algoritmos de pathfinding que iremos abordar são:
- Caminho mais curto, com duas variações úteis (A* e Yen's)
-
Encontra o caminho ou caminhos mais curtos entre dois nós escolhidos
- Caminho mais curto para todos os pares e Caminho mais curto de fonte única
-
Para encontrar os caminhos mais curtos entre todos os pares ou de um nó escolhido para todos osoutros
- Árvore Mínima de Varrimento
-
Para encontrar uma estrutura de árvore ligada com o menor custo para visitar todos os nós a partir de um nó escolhido
- Passeio aleatório
-
Porque é um passo útil de pré-processamento/amostragem para fluxos de trabalho de aprendizagem automática e outros algoritmos de grafos
Neste capítulo, ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.