{"push_id":575138534,"size":1,"distinct_size":1,"ref":"refs/heads/development","head":"47843b01e36d2275c4394b439fe438f91910af6e","before":"451f1d650c691097d9051ca1139a353d452a4aa6","commits":[{"sha":"47843b01e36d2275c4394b439fe438f91910af6e","author":{"email":"7c011dacdf24e0a314915d7db8445b4bae7415b7@gmx.de","name":"SethosII"},"message":"new merge implementation and refactoring\nadded missing free in deleteBinaryMinHeap and mstBoruvka\nchanged copyEdge parameters from (from,to) to (to,from)\nchanged copyEdge loop to memcpy\nchanged merge implementation (copy second part reverse)\ninserted the decrease*MinHeap functions at the right place\nremoved useless parentheses\nrenamed size in merge/mergeSort to end\nreplaced malloc/memset combinations with calloc\nrestructured includes","distinct":true,"url":"https://api.github.com/repos/SethosII/minimum-spanning-tree/commits/47843b01e36d2275c4394b439fe438f91910af6e"}]}