{"id":15517067,"url":"https://github.com/deric/fast-community","last_synced_at":"2025-04-04T10:26:51.438Z","repository":{"id":31486046,"uuid":"35050187","full_name":"deric/fast-community","owner":"deric","description":"A graph clustering algorithm","archived":false,"fork":false,"pushed_at":"2015-11-20T20:21:27.000Z","size":37,"stargazers_count":2,"open_issues_count":1,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-02-09T20:42:19.070Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":"nuxt-community/auth-module","license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/deric.png","metadata":{"files":{"readme":"README.md","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}},"created_at":"2015-05-04T17:54:52.000Z","updated_at":"2019-06-17T08:51:32.000Z","dependencies_parsed_at":"2022-08-18T07:05:24.959Z","dependency_job_id":null,"html_url":"https://github.com/deric/fast-community","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/deric%2Ffast-community","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/deric%2Ffast-community/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/deric%2Ffast-community/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/deric%2Ffast-community/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/deric","download_url":"https://codeload.github.com/deric/fast-community/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247159340,"owners_count":20893601,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":[],"created_at":"2024-10-02T10:11:11.000Z","updated_at":"2025-04-04T10:26:51.420Z","avatar_url":"https://github.com/deric.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# FastCommunity Clustering Algorithm\n\nSlightly modified version of [fastmodularity](http://www.cs.unm.edu/~aaron/research/fastmodularity.htm) that works on Linux.\n\n## Usage\nThis program is rather complicated and requires a specific kind of input,\nso some notes on how to use it are in order. Mainly, the program requires\na specific structure input file (.pairs) that has the following characteristics:\n\n  1. pairs is a list of tab-delimited pairs of numeric indices, e.g.,\n```\n\t\t54\\t91\\n\n```\n  2. the network described is a **SINGLE COMPONENT**\n  3. there are **NO SELF-LOOPS** or **MULTI-EDGES** in the file; you can use\n     the 'netstats' utility to extract the giantcomponent (-gcomp.pairs)\n     and then use that file as input to this program\n  4. the `MINIMUM NODE ID = 0` in the input file; the maximum can be\n     anything (the program will infer it from the input file)\n\nDescription of command line arguments:\n\n* `-f \u003cfilename\u003e` give the target `.pairs` file to be processed\n* `-l \u003ctext\u003e`the text label for this run; used to build output filenames\n* `-t \u003cint\u003e` timer period for reporting progress of file input to screen\n* `-s` calculate and record the support of the `dQ` matrix\n* `-v --v ---v`\tdiffering levels of screen output verbosity\n* `-o \u003cdirectory\u003e` directory for file output\n* `-c \u003cint\u003e` record the agglomerated network at step `\u003cint\u003e`\n\n## Algorithm\n\nSee http://www.arxiv.org/abs/cond-mat/0408187 for more information\n\n  - read network structure from data file (see below for constraints)\n  - builds dQ, H and a data structures\n  - runs new fast community structure inference algorithm\n  - records Q(t) function to file\n  - (optional) records community structure (at t==cutstep)\n  - (optional) records the list of members in each community (at t==cutstep)\n\n## Compiling\n\nOn Debian install:\n```\n$ sudo apt-get install build-essential\n```\n\nAnd compile using `make`:\n\n```\n$ make\n```\n\n## License\n\nGNU GPLv2\n\n## Authors\n\n  * Aaron Clauset  (aaron@cs.unm.edu)\n\n### Collaborators\n\n  * Dr. Cris Moore (moore@cs.unm.edu)\n  * Dr. Mark Newman (mejn@umich.edu)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fderic%2Ffast-community","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fderic%2Ffast-community","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fderic%2Ffast-community/lists"}