{"push_id":1380983915,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"d2abf97cadc31c3ba479fb7a910bf29f26da27da","before":"17221c676940db7072be97326865a477587e6c29","commits":[{"sha":"d2abf97cadc31c3ba479fb7a910bf29f26da27da","author":{"name":"Himanshu Vohra","email":"ae884c53ca6e4ec8b22dfe884559fcd15f4e1599@gmail.com"},"message":"Implementation of Prims Algorithm\n\nGiven a graph which consists of several edges connecting the  nodes in it. \r\nIt is required to find a subgraph of the given graph with the following properties:\r\n1. The subgraph contains all the nodes present in the original graph.\r\n2. The subgraph is of minimum overall weight (sum of all edges) among all such subgraphs.\r\n3. It is also required that there is exactly one, exclusive path between any two nodes of the subgraph.\r\n4. One specific node  is fixed as the starting point of finding the subgraph. \r\nFind the total weight of such a subgraph (sum of all edges in the subgraph)","distinct":true,"url":"https://api.github.com/repos/hvohra812/IIITB-Algo/commits/d2abf97cadc31c3ba479fb7a910bf29f26da27da"}]}
{"actor":{"display_login":"hvohra812"}}