{"push_id":978376698,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"a3093b2c31ab91bb29e36311cc12bba62362aecc","before":"f6131946411c5c4cdfadef8203f1f7468f967e8b","commits":[{"sha":"a3093b2c31ab91bb29e36311cc12bba62362aecc","author":{"email":"a40088f149b21c6ecb2d25a8992eb4a7ffd5fb69@gmail.com","name":"eisingvogel"},"message":"Update mst.cpp\n\nadded custom priority queue code, made changes to \"check_edge\" so that it could be used to check if an edge is not usable via usage data and the head node array, added code to the pass_change and dist_change functions","distinct":true,"url":"https://api.github.com/repos/ParallelProgramming-UARK-BAPD/Minimum-Spanning-Tree/commits/a3093b2c31ab91bb29e36311cc12bba62362aecc"}]}