{"id":20752789,"url":"https://github.com/dryak/louvain-community","last_synced_at":"2026-04-18T16:37:16.219Z","repository":{"id":94425746,"uuid":"133525387","full_name":"DrYak/louvain-community","owner":"DrYak","description":"Forked from https://sourceforge.net/projects/louvain/ . This fork attemps to fix some memory corruption bugs","archived":false,"fork":false,"pushed_at":"2019-01-24T20:37:14.000Z","size":203,"stargazers_count":1,"open_issues_count":3,"forks_count":1,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-03-11T14:54:47.612Z","etag":null,"topics":["louvain","louvain-algorithm","louvain-community-detection"],"latest_commit_sha":null,"homepage":"https://sites.google.com/site/findcommunities/","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/DrYak.png","metadata":{"files":{"readme":"readme.txt","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-05-15T14:06:25.000Z","updated_at":"2018-05-15T15:27:06.000Z","dependencies_parsed_at":"2023-03-03T19:00:23.658Z","dependency_job_id":null,"html_url":"https://github.com/DrYak/louvain-community","commit_stats":null,"previous_names":[],"tags_count":2,"template":false,"template_full_name":null,"purl":"pkg:github/DrYak/louvain-community","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DrYak%2Flouvain-community","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DrYak%2Flouvain-community/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DrYak%2Flouvain-community/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DrYak%2Flouvain-community/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/DrYak","download_url":"https://codeload.github.com/DrYak/louvain-community/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DrYak%2Flouvain-community/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31976795,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-18T16:27:12.723Z","status":"ssl_error","status_checked_at":"2026-04-18T16:27:11.140Z","response_time":103,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["louvain","louvain-algorithm","louvain-community-detection"],"created_at":"2024-11-17T08:42:41.686Z","updated_at":"2026-04-18T16:37:16.196Z","avatar_url":"https://github.com/DrYak.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"-----------------------------------------------------------------------------\n\nCommunity detection\nVersion 0.2 - not compatible with the previous version, see below.\n\nBased on the article \"Fast unfolding of community hierarchies in large networks\"\nCopyright (C) 2008 V. Blondel, J.-L. Guillaume, R. Lambiotte, E. Lefebvre\n\n\nThis file is part of Louvain algorithm.\n\nLouvain algorithm is free software: you can redistribute it and/or modify\nit under the terms of the GNU General Public License as published by\nthe Free Software Foundation, either version 3 of the License, or\n(at your option) any later version.\n\nLouvain algorithm is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\nGNU General Public License for more details.\n\nYou should have received a copy of the GNU General Public License\nalong with Louvain algorithm.  If not, see \u003chttp://www.gnu.org/licenses/\u003e.\n\n-----------------------------------------------------------------------------\n\nAuthor   : E. Lefebvre, adapted by J.-L. Guillaume\nEmail    : jean-loup.guillaume@lip6.fr\nLocation : Paris, France\nTime\t : February 2008\n\n-----------------------------------------------------------------------------\n\nDisclaimer:\nIf you find a bug, please send a bug report to jean-loup.guillaume@lip6.fr\nincluding if necessary the input file and the parameters that caused the bug.\nYou can also send me any comment or suggestion about the program.\n\nNote that the program is expecting a friendly use and therefore does not make\nmuch verifications about the arguments.\n\n-----------------------------------------------------------------------------\n\n\nThis package offers a set of functions to use in order to compute \ncommunities on graphs weighted or unweighted. A typical sequence of \nactions is:\n\n1. Conversion from a text format (each line contains a couple \"src dest\")\n./convert -i graph.txt -o graph.bin\nThis program can also be used to convert weighted graphs (each line contain\na triple \"src dest w\") using -w option:\n./convert -i graph.txt -o graph.bin -w graph.weights\nFinally, nodes can be renumbered from 0 to nb_nodes - 1 using -r option\n(less space wasted in some cases):\n./convert -i graph.txt -o graph.bin -r\n\n\n2. Computes communities and displays hierarchical tree:\n./community graph.bin -l -1 -v \u003e graph.tree\n\nTo ensure a faster computation (with a loss of quality), one can use\nthe -q option to specify that the program must stop if the increase of\nmodularity is below epsilon for a given iteration or pass:\n./community graph.bin -l -1 -q 0.0001 \u003e graph.tree\n\nThe program can deal with weighted networks using -w option:\n./community graph.bin -l -1 -w graph.weights \u003e graph.tree\nIn this specific case, the convertion step must also use the -w option.\n\nThe program can also start with any given partition using -p option\n./community graph.bin -p graph.part -v\n\n\n3. Displays information on the tree structure (number of hierarchical\nlevels and nodes per level):\n./hierarchy graph.tree\n\nDisplays the belonging of nodes to communities for a given level of\nthe tree:\n./hierarchy graph.tree -l 2 \u003e graph_node2comm_level2\n\n-----------------------------------------------------------------------------\n\nKnown bugs or restrictions:\n- the number of nodes is stored on 4 bytes and the number of links on 8 bytes.\n\n-----------------------------------------------------------------------------\n\nVersion history:\nThe following modifications have been made from version 0.1:\n- weights are now stored using floats (integer in V0.1)\n- degrees are stored on 8 bytes allowing large graphs to be decomposed\n- weights are stored in a separate file, which allows disk usage reduction if\n  different weights are to be used on the same topology\n- any given partition can be used as a seed for the algorithm rather than just\n  the trivial partition where each node belongs to its own community\n- initial network can contain loops is network is considered weighted\n- graph is not renumbered by default in the convert program\n- an optional verbose mode has been added and the program is silent by default\n- some portions of the code have been c++ improved (type * -\u003e vector\u003ctype\u003e)\nThese modifications imply that any binary graph file created with the previous\nversion of the code is not comptabile with this version. You must therefore\nregenerate all the binary files.\n\nVersion 0.1:\n- initial community detection algorithm\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdryak%2Flouvain-community","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdryak%2Flouvain-community","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdryak%2Flouvain-community/lists"}