{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":139834880,"defaultBranch":"master","name":"FirstCourseNetworkScience","ownerLogin":"CambridgeUniversityPress","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2018-07-05T10:40:57.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/40759902?v=4","public":true,"private":false,"isOrgOwned":true},"refInfo":{"name":"","listCacheKey":"v0:1668969949.287835","currentOid":""},"activityList":{"items":[{"before":"83043fa0d19a5a79be5f776804a5d98c117beb5e","after":"de9b42e3953ed90616940a801f64489067c1b888","ref":"refs/heads/master","pushedAt":"2023-11-03T00:56:43.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"filmenczer","name":"Fil Menczer","path":"/filmenczer","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/10651090?s=80&v=4"},"commit":{"message":"Update Chapter 3 Tutorial.ipynb\n\nWe had incorrectly assumed that nx.connected_components() returns the components sorted, largest first. In the robustness analysis, we had used this wrong assumption. This error has now been corrected. To get the largest component, we need to use max() instead of next().","shortMessageHtmlLink":"Update Chapter 3 Tutorial.ipynb"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAADpldfPQA","startCursor":null,"endCursor":null}},"title":"Activity · CambridgeUniversityPress/FirstCourseNetworkScience"}