{"push_id":3528664761,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"b9248794f68b0ac251442c314e2391bf01df2b1d","before":"7fd48c80c173531ba42536c4e236e489c68ab83b","commits":[{"sha":"b9248794f68b0ac251442c314e2391bf01df2b1d","author":{"name":"arman18","email":"b2c2834d21dd18f3a6a84df1d2150c70177a68f5@users.noreply.github.com"},"message":"graph traversing and connected component\n\nthis code includes three topic :\r\n1) traverse graph by BFS.\r\n2) traverse graph by DFS.\r\n3) print how many connected component presents in that graph","distinct":true,"url":"https://api.github.com/repos/arman18/BSSE-Class-Code/commits/b9248794f68b0ac251442c314e2391bf01df2b1d"}]}
{"actor":{"display_login":"arman18"}}