Слайды и текст доклада
Pic.1
Introduction to graphs Lyzhin Ivan, 2015
Pic.2
Definition G = (V, E) V – vertexes E – edges
Pic.3
Types Directed/undirected Weighted/unweighted Simple graph/multigraph Connected/unconnected Bipartite With cycles/without cycles
Pic.4
Ways of presenting in memory Adjacency matrix
Pic.5
Ways of presenting in memory Incidence matrix
Pic.6
Ways of presenting in memory List of edges
Pic.7
Ways of presenting in memory Adjacency list
Pic.8
Problems without explicit graph Labyrinth Number of objects
Pic.9
Basic algorithms Depth-First Search (DFS)
Pic.10
Basic algorithms Breadth-First Search (BFS)
Pic.11
Examples Find cycle in graph Count number of connected components in graph Find distance and path from one vertex to each other in unweighted graph
Скачать презентацию
Если вам понравился сайт и размещенные на нем материалы, пожалуйста, не забывайте поделиться этой страничкой в социальных сетях и с друзьями! Спасибо!