{"action":"created","issue":{"url":"https://api.github.com/repos/masabahmad/CRONO/issues/2","repository_url":"https://api.github.com/repos/masabahmad/CRONO","labels_url":"https://api.github.com/repos/masabahmad/CRONO/issues/2/labels{/name}","comments_url":"https://api.github.com/repos/masabahmad/CRONO/issues/2/comments","events_url":"https://api.github.com/repos/masabahmad/CRONO/issues/2/events","html_url":"https://github.com/masabahmad/CRONO/issues/2","id":186364707,"number":2,"title":"Triangle counting simple graph doesn't work","user":{"login":"yunduz","id":993726,"avatar_url":"https://avatars.githubusercontent.com/u/993726?v=3","gravatar_id":"","url":"https://api.github.com/users/yunduz","html_url":"https://github.com/yunduz","followers_url":"https://api.github.com/users/yunduz/followers","following_url":"https://api.github.com/users/yunduz/following{/other_user}","gists_url":"https://api.github.com/users/yunduz/gists{/gist_id}","starred_url":"https://api.github.com/users/yunduz/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/yunduz/subscriptions","organizations_url":"https://api.github.com/users/yunduz/orgs","repos_url":"https://api.github.com/users/yunduz/repos","events_url":"https://api.github.com/users/yunduz/events{/privacy}","received_events_url":"https://api.github.com/users/yunduz/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":8,"created_at":"2016-10-31T18:45:23Z","updated_at":"2016-11-01T04:00:13Z","closed_at":null,"body":"Hello,\r\n\r\nFor triangle counting I've tried to provide a file with a simple, 3 nodes graph which makes one triangle like this:\r\n0    1\r\n1    2\r\n2    0\r\n\r\nHowever, the output says:\r\n .gr graph with parameters: Vertices:1 Degree:1 \r\n\r\nFile Read, Largest Vertex:1\r\nThreads Joined!\r\nTime Taken:\r\n0.000009 seconds\r\nTriangles=0 \r\n\r\nThis seems to be incorrect. Could you let me know if my file format is wrong or it's something else?\r\n\r\nThanks,\r\n\r\nYunduz"},"comment":{"url":"https://api.github.com/repos/masabahmad/CRONO/issues/comments/257483778","html_url":"https://github.com/masabahmad/CRONO/issues/2#issuecomment-257483778","issue_url":"https://api.github.com/repos/masabahmad/CRONO/issues/2","id":257483778,"user":{"login":"masabahmad","id":7359809,"avatar_url":"https://avatars.githubusercontent.com/u/7359809?v=3","gravatar_id":"","url":"https://api.github.com/users/masabahmad","html_url":"https://github.com/masabahmad","followers_url":"https://api.github.com/users/masabahmad/followers","following_url":"https://api.github.com/users/masabahmad/following{/other_user}","gists_url":"https://api.github.com/users/masabahmad/gists{/gist_id}","starred_url":"https://api.github.com/users/masabahmad/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/masabahmad/subscriptions","organizations_url":"https://api.github.com/users/masabahmad/orgs","repos_url":"https://api.github.com/users/masabahmad/repos","events_url":"https://api.github.com/users/masabahmad/events{/privacy}","received_events_url":"https://api.github.com/users/masabahmad/received_events","type":"User","site_admin":false},"created_at":"2016-11-01T04:00:13Z","updated_at":"2016-11-01T04:00:13Z","body":"[12] reads in its triangle counting explanation: \"With undirected edges, the total number of overlaps gives 3 times the number of triangles.\" This is where the divide by three comes from. I guess its a heuristic to reduce complexity. In the sorted_neighbors code you can see that there is an additional for loop and also an additional while loop (this increases the complexity over O(V+E)). The algorithm approximates these inner loops by adding the number of connections, and then just dividing by three at the end. \r\n\r\nWhat you are saying about the parallelization is also correct. With time the heuristic in my code has become simpler, so you dont need an additional barrier and thus you can sum up the work in the prior phase. Earlier the code in this middle redundant phase was a bit more complex, as it required data from other threads, and hence a lock. This could only be done after a barrier when the D array values are set in the prior phase.\r\n\r\nYou can bug me as much as you want lol. Might I ask for what purpose are you using these benchmarks?"}}
{"actor":{"display_login":"masabahmad"}}