Sumários
Elementary graph algorithms
28 março 2008, 10:30 • Jan Gunnar Cederquist
Graph representation, (breadth-first search), depth-first search, strongly connected components.
Elementary graph algorithms
28 março 2008, 09:00 • Jan Gunnar Cederquist
Graph representation, (breadth-first search), depth-first search, strongly connected components.
Aula 3
28 março 2008, 09:00 • Nuno Pereira Lopes
Grafos, BFS, DFS e SCCs. Exercícios: 22.1-6, 22.2-1, 22.2-8, 22.3-7, 22.3-8, 22.3-10, 22.4-3, 22.5-1, 22.5-3 e 22.5-5.
Elementary graph algorithms
27 março 2008, 11:00 • Jan Gunnar Cederquist
Graph representation, (breadth-first search), depth-first search, strongly connected components.
Aula 3
27 março 2008, 11:00 • Nuno Pereira Lopes
Grafos, BFS, DFS e SCCs. Exercícios: 22.1-6, 22.2-1, 22.2-8, 22.3-7, 22.3-8, 22.3-10, 22.4-3, 22.5-1, 22.5-3 e 22.5-5.