Message from C, C++ discussions
January 2020
— Ok, I think I get that ugly code... you are looking for the smallest cost link to an unvisited node (that's the 2 inner loops), every time you get a link, you are basically adding one node to the solution, thus you need to repeat (n-1) times, because the initial node was already added, that's why ne goes from 1 to (n-1)
A.C.R.O.N.Y.M.S.
Use acronyms to keep the code terse. Real men never define acronyms; they understand them genetically.
— I had when one uses abbriviations characters all in UPPERCASE
— Like isHDR looks terrific, or HTTPRequest
— IsHdr or HttpRequest is much more sexier
— /hello
— Hi
— I am new here
— Great
— I need basic information about c++
— There is a magic portal called internet
— Yha nhi milegi kya mughe koi information?