graph haqida ma'lumotlar

PPTX 9 pages 233.7 KB Free download

Page preview (5 pages)

Scroll down 👇
1 / 9
what is graph? what is graph? algorithms and data structures course what is graph? graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense “related”. the objects called vertices (also called nodes or points). each of the related pairs of vertices is called an edge. algorithms and data structures course what is graph? example: vertices (yellow circles) is v = {1,2,3,4,5} edges (black lines) is pairs of vertices that are connected. in this case edges are: e = {(1, 2), (1, 3), (2, 4), (2, 5), (3, 4), (4, 5)} we are also defining graph as pair of v and e. if briefly, then g = (v, e). we will use this notation. algorithms and data structures course what is graph? parallel vertices: two or more edges joining a same pair of vertices. in example vertex 1 and 2 …
2 / 9
try to prove this at home. algorithms and data structures course what is graph? terminology graph is called connected if there is no vertex with deg = 0. each connected sub-graph is called component. a path in a graph is a sequence of edges which joins a sequence of vertices. for example, 4 3 2 5 a cycle is a path that begins and ends at the same vertex. for example, 3 2 1 3 algorithms and data structures course image1.png image2.png image3.png image4.png image5.png image6.png image7.png image8.png image9.png image10.png image11.png /docprops/thumbnail.jpeg
3 / 9
graph haqida ma'lumotlar - Page 3
4 / 9
graph haqida ma'lumotlar - Page 4
5 / 9
graph haqida ma'lumotlar - Page 5

Want to read more?

Download all 9 pages for free via Telegram.

Download full file

About "graph haqida ma'lumotlar"

what is graph? what is graph? algorithms and data structures course what is graph? graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense “related”. the objects called vertices (also called nodes or points). each of the related pairs of vertices is called an edge. algorithms and data structures course what is graph? example: vertices (yellow circles) is v = {1,2,3,4,5} edges (black lines) is pairs of vertices that are connected. in this case edges are: e = {(1, 2), (1, 3), (2, 4), (2, 5), (3, 4), (4, 5)} we are also defining graph as pair of v and e. if briefly, then g = (v, e). we …

This file contains 9 pages in PPTX format (233.7 KB). To download "graph haqida ma'lumotlar", click the Telegram button on the left.

Tags: graph haqida ma'lumotlar PPTX 9 pages Free download Telegram