Graph Theory - Kruskal Algorithm [Disjoint Set] (Arabic)

[@Donbcheap]

I understood this more than Prim Algorithm

[@Miller4way]

Just brilliant , Thx , but you have forgotten to upload this session to ur dropbox :D

[@ArabicCompetitiveProgramming]

I lost it :(

[@visheshmaheshwari2663]

Can you please send the code for counting number of MSTs in a graph I cannot understand it from visuals and i don't speak arabic. Thanks.

[@ArabicCompetitiveProgramming]

github.com/mostafa-saad/MyCompetitiveProgramming/blob/master/SPOJ/SPOJ_MSTS.txt

[@mohamednabil9146]

Sir, Minimax was in Flloyd if I remember correctly, not Dijkstra right ?

[@amrmaghraby327]

But why when i am solving on Disjoint only i must to decrement x and y before enter UNION_SET function and when i use Miniumm spanning tree i mustn't decrement it??????

[@ArabicCompetitiveProgramming]

I am not sure what seanrio you faced. Try to solve more problems. x and y are zero based positions in both Dijstra and other problems.

[@amrmaghraby327]

yes that what i was convinced with when solving disjoint but when i wrote MST it got WA and after removing decrementing it got AC

[@amrmaghraby327]

I was following this Scenario at line 72 and 73 tausiq.wordpress.com/2013/05/30/minimum-spanning-tree-kruskal-algorithm-source-code-cc/

[@ArabicCompetitiveProgramming]

show your wrong code in some solving facebook groups and ask them why decrementing is WA probably it was already 0 based

[@Donbcheap]

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

[@ayasaber2567]

ربنا يجزاكيك كل خير , ممكن الاكواد ؟؟

[@ArabicCompetitiveProgramming]

I lost it :( You have to write it

[@MohammedAli-xt9dy]

???more detail second minimum spanning tree

[@ArabicCompetitiveProgramming]

there is a UVA problem about it...try to solve it...or see forums for solution idea is normal...you can get it by yourself

[@MohammedAli-xt9dy]

thanks

[@MohammedAli-xt9dy]

الكود ده صح لان اجيب second minimum spanning tree

[@MohammedAli-xt9dy]

ideone.com/FN0WRL

[@ArabicCompetitiveProgramming]

try it on a problem and see

[@m00oon]

sir , can you please speak in english