Graph Theory - Prim Algorithm (Arabic)

ContentLink: www.dropbox.co...
Content:
Prim Algorithm
Proof
O(V^2) code for Adjacency Matrix
O(E Log V) code for Adjacency List
Problems: UVA(10034, 10147, 10369, 10397, 10462, 10600, 10842)

[@tahahussein8344]

ربنا ينفعك بعلمه يا بشمنهدس جزاك الله عنا خيرا (Y)

[@youssefroshdy1315]

جزاك الله خيرا

[@mohammedaymenakchiche117]

ايه هو الcost استاذ

[@Donbcheap]

وعليكم السلام ورحمة الله وبركاته

[@prodev7401]

we need visited array for avoid a Cycle ???

[@ArabicCompetitiveProgramming]

More details? Which minute annoys u?

[@prodev7401]

Arabic Competitive Programming by Mostafa Saad if(!vis[i]) we need vis array for avoid a circuit ? Prim's like Dijkstra the difference Is in prim's we don't need predecessor :D No ?

[@ArabicCompetitiveProgramming]

Each time we need to pick new node..with min distance to join the MST tree...so we need to know who is marked so far

[@prodev7401]

???

[@prodev7401]

?

[@yousefsameh4622]

❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤