Practice 1

Craph Algorithms
1) Review of
graphs
2) How to store a graph in Computer memory
3) Traversals Pr
4) Minimum
spanning trees
5) shortest paths

Graph :

directive undirective vertices

, , , edges.

·
Y
o↳
·
.
-
⑳
*
4L ~.
·V 1
B 5

undirective directed directed

weighted and
weighted
arrow

=> node
of V set
Graph : vertices > set is not
empty
-

IV) =
n

edges => Set E] consist of pars of verties]

IE1 = M .

adjacency relation

(weights) => W :
ExR