├── LICENSE ├── README.md └── src ├── Community.cpp ├── Community.h ├── Makefile ├── MaxHeap.h ├── fcd.cpp ├── fcd.h └── main.cpp /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | {project} Copyright (C) {year} {fullname} 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # FastCommunityDetection 2 | Finding community structure in very large networks, with fast heuristic algorithm by Girvan-Newman and a Multi-Step variation. 3 | 4 | ## How to use 5 | ```C++ 6 | make 7 | ./fcd dataset scope [example: ./fcd amazon0505 24] 8 | ``` 9 | ## Input Format 10 | The input should be a list of edges, separated by tab or space. 11 | The graph can be either directed or undirected, but the algorithm will build an undirected version of it. 12 | ``` 13 | 1 2 14 | 1 3 15 | 2 4 16 | ecc... 17 | ``` 18 | 19 | ## References 20 | [1] Clauset et al. (2004) https://arxiv.org/abs/cond-mat/0408187 21 | 22 | [2] Schuetz and Amedeo (2008) https://arxiv.org/abs/0712.1163 23 | -------------------------------------------------------------------------------- /src/Community.cpp: -------------------------------------------------------------------------------- 1 | /* =========================================================================== 2 | * Community.cpp 3 | * 4 | * This program is free software: you can redistribute it and/or modify 5 | * it under the terms of the GNU General Public License as published by 6 | * the Free Software Foundation, either version 3 of the License, or 7 | * (at your option) any later version. 8 | * 9 | * This program is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | * GNU General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU General Public License 15 | * along with this program. If not, see . 16 | * 17 | * =========================================================================== 18 | * 19 | * Author: Lorenzo Rutigliano 20 | * 21 | * =========================================================================== 22 | */ 23 | 24 | #include "Community.h" 25 | using namespace std; 26 | 27 | 28 | Community::Community() { 29 | id = -1; 30 | stamp = 0; 31 | } 32 | 33 | Community::Community(int idx) { 34 | id = idx; 35 | stamp = 0; 36 | } 37 | 38 | Community::~Community() { 39 | cmax = NULL; 40 | clist.clear(); 41 | } 42 | 43 | ostream& operator <<(ostream& os, Community& c) { 44 | os << "id: " << c.id << "\n"; 45 | os << "neighbors:\n"; 46 | for (auto it=c.clist.begin(); it!=c.clist.end(); ++it) 47 | os << it->k << " \t" << it->dq << "\n"; 48 | return os; 49 | } 50 | 51 | 52 | unsigned int Community::degree() { 53 | unsigned int cnt = 0; 54 | for (auto it=clist.begin(); it!=clist.end(); ++it) 55 | if (!it->member) 56 | cnt++; 57 | return cnt; 58 | } 59 | 60 | 61 | unsigned int Community::members() { 62 | unsigned int cnt = 0; 63 | for (auto it=clist.begin(); it!=clist.end(); ++it) 64 | if (it->member) 65 | cnt++; 66 | return cnt; 67 | } 68 | 69 | 70 | bool Community::contains(int k) { 71 | for (auto it=clist.begin(); it!=clist.end(); ++it) 72 | if (it->k == k) 73 | return true; 74 | return false; 75 | } 76 | 77 | 78 | bool Community::add(int k, double v, bool f) { 79 | for (auto it=clist.begin(); it!=clist.end(); ++it) { 80 | if (it->k > k) { 81 | clist.emplace(it, k, v, f); 82 | return true; 83 | } 84 | if (it->k == k) return false; 85 | } 86 | clist.push_back(CNode(k, v, f)); 87 | return true; 88 | } 89 | 90 | 91 | /* [header] function: scan_max 92 | * ---------------------------------------------------------------------------- 93 | * Scan the community neighborhood to find the member with maximum 94 | * delta Q value. 95 | * 96 | * Args: 97 | * - av : vector of double. 98 | * 99 | * Returns: 1 if new maximum is found, 0 if same value, -1 if invalid. 100 | */ 101 | bool Community::scan_max(vector& av) { 102 | cmax = NULL; 103 | double bestdq = 0; 104 | for (list::iterator it=clist.begin(); it!=clist.end(); ++it) { 105 | if (!(it->member) && (av[it->k] > 0) && (it->dq > bestdq)) { 106 | bestdq = it->dq; 107 | cmax = &(*it); 108 | } 109 | } 110 | return (cmax != NULL); 111 | } 112 | 113 | 114 | bool Community::remove(int k) { 115 | for (list::iterator it=clist.begin(); it!=clist.end(); ++it) { 116 | if (it->k == k) { 117 | it = clist.erase(it); 118 | return true; 119 | } 120 | } 121 | return false; 122 | } 123 | 124 | 125 | void Community::shrink(vector& av) { 126 | for (list::iterator it=clist.begin(); it!=clist.end();) 127 | if ((!it->member) && (av[it->k] < 0)) 128 | it = clist.erase(it); 129 | else ++it; 130 | } 131 | 132 | 133 | void Community::merge(Community& cm, vector& av) { 134 | list::iterator ax = clist.begin(); 135 | list::iterator bx = cm.clist.begin(); 136 | while (1) { 137 | if (ax == clist.end()) { 138 | // update from bx to by, equation (10b) 139 | for (; bx!=cm.clist.end(); ++bx) 140 | bx->dq -= 2.0*av[id]*av[bx->k]; 141 | // append the remaining b list to a 142 | clist.splice(ax, cm.clist); 143 | break; 144 | } 145 | 146 | if (bx == cm.clist.end()) { 147 | // update from ax to ay, equation (10c) 148 | for (;ax!=clist.end(); ++ax) 149 | if (ax->k == cm.id) 150 | ax->member = true; 151 | else 152 | ax->dq -= 2.0*av[cm.id]*av[ax->k]; 153 | break; 154 | } 155 | 156 | if (ax->k == cm.id) 157 | ax->member = true; 158 | 159 | if (ax->k < bx->k) { 160 | // update ax, equation (10c) 161 | ax->dq -= 2.0*av[cm.id]*av[ax->k]; 162 | ++ax; 163 | } else if (ax->k > bx->k) { 164 | // update bx, equation (10b) 165 | bx->dq -= 2.0*av[id]*av[bx->k]; 166 | // transfer the node from list b to a 167 | clist.splice(ax, cm.clist, bx); 168 | bx = cm.clist.begin(); 169 | } else { // equals 170 | // check if members 171 | // or update ax, equation (10a) 172 | if (bx->member) 173 | ax->member = true; 174 | else 175 | ax->dq += bx->dq; 176 | ++ax; 177 | // remove equal node from b 178 | cm.clist.pop_front(); 179 | bx = cm.clist.begin(); 180 | } 181 | } 182 | } 183 | -------------------------------------------------------------------------------- /src/Community.h: -------------------------------------------------------------------------------- 1 | 2 | /* ============================================================================ 3 | * Community.h 4 | * 5 | * This program is free software: you can redistribute it and/or modify 6 | * it under the terms of the GNU General Public License as published by 7 | * the Free Software Foundation, either version 3 of the License, or 8 | * (at your option) any later version. 9 | * 10 | * This program is distributed in the hope that it will be useful, 11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | * GNU General Public License for more details. 14 | * 15 | * You should have received a copy of the GNU General Public License 16 | * along with this program. If not, see . 17 | * 18 | * ============================================================================ 19 | * 20 | * Author: Lorenzo Rutigliano 21 | * 22 | * ============================================================================ 23 | */ 24 | 25 | #ifndef __COMMUNITY_H 26 | #define __COMMUNITY_H 27 | 28 | #include 29 | #include 30 | #include 31 | #include 32 | 33 | 34 | typedef struct node { 35 | double dq; 36 | int k; 37 | bool member; 38 | 39 | node(int a, double b, bool c): k(a), dq(b), member(c) {} 40 | ~node() {} 41 | inline bool operator <(const node& n) const {return k clist; // list of members 56 | CNode* cmax; // maximum dQ 57 | uint64_t stamp; // timestamp of last cmax 58 | int id; // community id 59 | 60 | Community(); // default constructor (for vector allocation) 61 | Community(int); // custom constructor 62 | ~Community(); // default deconstructor 63 | 64 | friend std::ostream& operator <<(std::ostream&, Community&); 65 | 66 | inline unsigned int size() {return clist.size();} 67 | 68 | unsigned int degree(); 69 | unsigned int members(); 70 | 71 | bool contains(int); 72 | bool add(int,double,bool); // Add node in community 73 | bool scan_max(std::vector&); // Find member with maximum dQ 74 | bool remove(int); // Remove specific node 75 | 76 | void shrink(std::vector&); // Remove obsolete nodes 77 | void merge(Community&,std::vector&); // Merge two communities 78 | 79 | }; // 48B 80 | 81 | inline uint64_t timestamp() { 82 | return std::chrono::duration_cast 83 | (std::chrono::high_resolution_clock::now().time_since_epoch()).count(); 84 | } 85 | 86 | #endif // __COMMUNITY_H -------------------------------------------------------------------------------- /src/Makefile: -------------------------------------------------------------------------------- 1 | CXX = g++ 2 | 3 | OPTS = -g -O2 -std=c++11 4 | CFLAGS = $(OPTS) 5 | LIBS = -lm 6 | 7 | TARGET = fcd 8 | 9 | default: $(TARGET) 10 | 11 | clean: 12 | rm -rf *~ *.o $(TARGET) 13 | 14 | clean-all: 15 | rm -rf *~ *.o $(TARGET) *.csv *.tsv summary_* 16 | 17 | fcd: main.cpp fcd.o Community.o 18 | $(CXX) $(CFLAGS) -o fcd main.cpp fcd.o Community.o $(LIBS) 19 | 20 | fcd.o: fcd.cpp fcd.h Community.h MaxHeap.h 21 | $(CXX) $(CFLAGS) -c fcd.cpp 22 | 23 | Community.o: Community.cpp Community.h 24 | $(CXX) $(CFLAGS) -c Community.cpp -------------------------------------------------------------------------------- /src/MaxHeap.h: -------------------------------------------------------------------------------- 1 | /* ============================================================================ 2 | * MaxHeap.h 3 | * 4 | * This program is free software: you can redistribute it and/or modify 5 | * it under the terms of the GNU General Public License as published by 6 | * the Free Software Foundation, either version 3 of the License, or 7 | * (at your option) any later version. 8 | * 9 | * This program is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | * GNU General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU General Public License 15 | * along with this program. If not, see . 16 | * 17 | * ============================================================================ 18 | * 19 | * Author: Lorenzo Rutigliano 20 | * 21 | * ============================================================================ 22 | */ 23 | #ifndef __MAXHEAP_H 24 | #define __MAXHEAP_H 25 | 26 | #include 27 | 28 | 29 | typedef struct element { 30 | uint64_t stamp; 31 | double dq; 32 | int i; 33 | int j; 34 | element(int a, int b, double d, uint64_t st): i(a), j(b), dq(d), stamp(st) {} 35 | ~element() {} 36 | } Element; // 24B 37 | 38 | inline bool operator <(const struct element& e1, const struct element& e2) { 39 | return e1.dq < e2.dq; 40 | } 41 | 42 | class MaxHeap { 43 | 44 | public: 45 | inline int size() {return pq.size();} 46 | inline bool empty() {return pq.empty();} 47 | inline void push(int i, int j, double dq, uint64_t st) {pq.emplace(i, j, dq, st);} 48 | 49 | void pop(int& a, int& b, uint64_t& c) { 50 | a = pq.top().i; 51 | b = pq.top().j; 52 | c = pq.top().stamp; 53 | pq.pop(); 54 | } 55 | 56 | void clear() { 57 | while (!pq.empty()) 58 | pq.pop(); 59 | } 60 | 61 | private: 62 | std::priority_queue pq; 63 | }; // 64 | #endif // __MAXHEAP_H -------------------------------------------------------------------------------- /src/fcd.cpp: -------------------------------------------------------------------------------- 1 | /* ============================================================================ 2 | * fcd.cpp 3 | * 4 | * This program is free software: you can redistribute it and/or modify 5 | * it under the terms of the GNU General Public License as published by 6 | * the Free Software Foundation, either version 3 of the License, or 7 | * (at your option) any later version. 8 | * 9 | * This program is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | * GNU General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU General Public License 15 | * along with this program. If not, see . 16 | * 17 | * ============================================================================ 18 | * 19 | * Author: Lorenzo Rutigliano 20 | * 21 | * ============================================================================ 22 | */ 23 | 24 | #include 25 | #include 26 | #include 27 | #include 28 | #include 29 | 30 | #include "fcd.h" 31 | using namespace std; 32 | 33 | /* [header] function: fileExists 34 | * ---------------------------------------------------------------------------- 35 | * Check if a file exists. 36 | * Args: 37 | * - file: filename 38 | * Returns: true if and only if the file exists, false else. 39 | */ 40 | bool fileExists (const string& file) { 41 | struct stat buf; 42 | return (stat(file.c_str(), &buf) == 0); 43 | } 44 | 45 | 46 | int maximal(string filename) { 47 | int i, j; 48 | int maximal = -1; 49 | ifstream myfile(filename); 50 | if (myfile.is_open()) { 51 | while (myfile >> i >> j) 52 | maximal = max(maximal, max(i, j)); 53 | myfile.close(); 54 | } else { 55 | cerr << "Error opening input file\n"; 56 | exit(1); 57 | } 58 | return maximal; 59 | } 60 | 61 | 62 | /* [] function: process_dataset 63 | * ---------------------------------------------------------------------------- 64 | * Write community vector in a text file in a proper way. 65 | * Args: 66 | * - filename: trivial. 67 | * - univ: community vector. 68 | * - m: number of edges. 69 | * 70 | * Returns: 0 if success, 1 otherwise. 71 | */ 72 | void process_dataset (string filename, vector& univ, int m) { 73 | cout << "Start process dataset...\n"; 74 | ofstream outfile(filename + "_preprocess.txt"); 75 | if (outfile.is_open()) { 76 | outfile << univ.size() << "\n"; 77 | outfile << m << "\n"; 78 | for (int x=0; xk << " "; 82 | outfile << "\n"; 83 | } 84 | outfile.close(); 85 | } else { 86 | cerr << "Error opening output file.\n"; 87 | exit(1); 88 | } 89 | cout << "Finish process dataset.\n"; 90 | } 91 | 92 | 93 | /* [] function: read_data_set 94 | * ---------------------------------------------------------------------------- 95 | * Given a formatted text file representing the graph, it builds the correspon- 96 | * ding representation with the community invariants. 97 | * 98 | * Args: 99 | * - filename: trivial. 100 | * - univ: empty vector to be initialized. 101 | * 102 | * Returns: number of edges in the graph. 103 | */ 104 | int read_data_set (string filename, vector& univ) { 105 | 106 | // name of the preprocessed file. 107 | string outfilename = filename + "_preprocess.txt"; 108 | if (!fileExists(outfilename)) { 109 | cout << "Preprocessed version of file " << filename << " doesn't exists."; 110 | cout << " It will be done a new one !!\n"; 111 | 112 | int i, j; 113 | int max_id = maximal(filename); // search for maximal id 114 | univ.resize(max_id+1); // resize community universe 115 | ifstream myfile(filename); 116 | if (myfile.is_open()) { 117 | while (myfile >> i >> j) { 118 | if (i != j) { 119 | univ[i].add(j, 0, false); 120 | univ[j].add(i, 0, false); 121 | } 122 | } 123 | myfile.close(); 124 | } else { 125 | cerr << "Error opening input file\n"; 126 | exit(1); 127 | } 128 | 129 | // id correction 130 | cout << "Assigning IDs...\n"; 131 | for (int id=0; id> n; 156 | 157 | // get number of edges 158 | getline(prefile, line); 159 | iss = istringstream(line); 160 | iss >> m; 161 | 162 | // resize community vector 163 | univ.resize(n); 164 | 165 | while (getline(prefile, line)) { 166 | iss = istringstream(line); 167 | iss >> x; 168 | univ[x].id = x; // set id 169 | 170 | getline(prefile, line); 171 | iss = istringstream(line); 172 | while (iss >> y) 173 | univ[x].add(y,0,false); // add neighbors 174 | } 175 | prefile.close(); 176 | } 177 | 178 | return m; 179 | } 180 | 181 | 182 | /* [] function: compute_dq 183 | * ---------------------------------------------------------------------------- 184 | * Compute the starter value of delta Q. 185 | * 186 | * Args: 187 | * - ki: degree of community i. 188 | * - kj: degree of community j. 189 | * - m : number of edges. 190 | * 191 | * Returns: the computed delta Q. 192 | */ 193 | double cdq (int ki, int kj, int m) { 194 | return 2.0*(double(0.5/m) - (ki * kj)/(4.0*m*m)); 195 | } 196 | 197 | 198 | /* [header] function: populate_universe 199 | * ---------------------------------------------------------------------------- 200 | * Exposed function that initialized the community universe/vector. 201 | * 202 | * Args: 203 | * - filename: dataset filename. 204 | * 205 | * Returns: the community vector and the number of edges. 206 | */ 207 | int init_universe (vector& univ, string filename) { 208 | #ifdef DEBUG 209 | clock_t begin = clock(); 210 | #endif 211 | int m = read_data_set(filename, univ); 212 | for (int i=0; idq = cdq(univ[i].clist.size(), univ[it->k].clist.size(), m); 215 | 216 | #ifdef DEBUG 217 | clock_t end = clock(); 218 | double elapsed = double(end - begin) / CLOCKS_PER_SEC; 219 | cout << "Time to populate universe: " << elapsed << " seconds" << endl; 220 | #endif 221 | return m; 222 | } 223 | 224 | 225 | /* [header] function: populate_array 226 | * ---------------------------------------------------------------------------- 227 | * Header function that initialized the double vector. 228 | * 229 | * Args: 230 | * - univ: non-empty community vector. 231 | * - m: number of edges. 232 | * 233 | * Returns: the double vector. 234 | */ 235 | void init_array (vector& av, vector& univ, int m) { 236 | #ifdef DEBUG 237 | clock_t begin = clock(); 238 | #endif 239 | double k = (double)(0.5/m); 240 | for (int i=0; i& univ, vector& av) { 262 | #ifdef DEBUG 263 | clock_t begin = clock(); 264 | #endif 265 | for (int i=0; i 0 && univ[i].scan_max(av)) 267 | h.push(i, univ[i].cmax->k, univ[i].cmax->dq, 0); 268 | 269 | #ifdef DEBUG 270 | clock_t end = clock(); 271 | double elapsed = double(end - begin) / CLOCKS_PER_SEC; 272 | cout << "Time to populate max-heap: " << elapsed << " seconds "; 273 | cout << "with " << h.size() << " elements\n"; 274 | #endif 275 | } 276 | 277 | 278 | /* [] function: init_q 279 | * ---------------------------------------------------------------------------- 280 | * Initialize Q. 281 | * 282 | * Args: 283 | * - av: non-empty double vector. 284 | * 285 | * Returns: starting value of Q. 286 | */ 287 | double init_Q (vector& av) { 288 | double Q = 0.0; 289 | for (int i=0; i& univ, vector& av, MaxHeap& h) { 297 | for (auto&& c:univ) c.stamp = 0; 298 | h.clear(); 299 | init_heap(h, univ, av); 300 | return h.empty(); 301 | } 302 | 303 | 304 | void fill(vector& univ, vector& av) { 305 | for (int v=0; v 0) 307 | univ[v].clist.emplace_back(v, 0, true); 308 | } 309 | 310 | 311 | void shrink_all(vector& univ) { 312 | for (auto&& c:univ) 313 | for (auto it=c.clist.begin(); it!=c.clist.end();) { 314 | if (!it->member) 315 | it = c.clist.erase(it); 316 | else ++it; 317 | } 318 | } 319 | 320 | 321 | bool validity(Community& a, Community& b, uint64_t stamp, 322 | vector& av, MaxHeap& h) { 323 | if (av[a.id] <= 0) return false; 324 | 325 | if (av[b.id] <= 0) { 326 | if (a.stamp == stamp) { 327 | uint64_t st = timestamp(); 328 | if (a.scan_max(av)) 329 | h.push(a.id, a.cmax->k, a.cmax->dq, st); 330 | a.stamp = st; 331 | } 332 | return false; 333 | } 334 | 335 | if (a.stamp != stamp) return false; 336 | return true; 337 | } 338 | 339 | 340 | void merge(Community& a, Community& b, vector& av, MaxHeap& h) { 341 | // get timestamp 342 | uint64_t st = timestamp(); 343 | 344 | if (a.size() >= b.size()) { 345 | // remove self-edge and merge 346 | b.remove(a.id); 347 | a.merge(b, av); 348 | // update av 349 | av[a.id] += av[b.id]; 350 | av[b.id] = -(a.id); 351 | // update cmax and timestamp 352 | b.cmax = NULL; 353 | if (a.scan_max(av)) 354 | h.push(a.id, a.cmax->k, a.cmax->dq, st); 355 | a.stamp = st; 356 | 357 | } else { 358 | a.remove(b.id); 359 | b.merge(a, av); 360 | b.add(a.id,0,true); 361 | av[b.id] += av[a.id]; 362 | av[a.id] = -(b.id); 363 | a.cmax = NULL; 364 | if (b.scan_max(av)) 365 | h.push(b.id, b.cmax->k, b.cmax->dq, st); 366 | b.stamp = st; 367 | } 368 | } 369 | 370 | 371 | pair cnm (double Q, vector& univ, 372 | vector& av, MaxHeap& heap) { 373 | 374 | int x, y; 375 | uint64_t stamp; 376 | double elapsed; 377 | clock_t begin, end; 378 | 379 | int iter=0; 380 | double sQ = Q; 381 | clock_t begin_total = clock(); 382 | do { 383 | while (!heap.empty()) { 384 | // pop candidates communities 385 | heap.pop(x, y, stamp); 386 | // check validity 387 | if (!validity(univ[x], univ[y], stamp, av, heap)) continue; 388 | 389 | #ifdef DEBUG 390 | iter++; 391 | begin = clock(); 392 | #endif 393 | // update Q 394 | sQ += univ[x].cmax->dq; 395 | // start merge sequence 396 | merge(univ[x], univ[y], av, heap); 397 | 398 | #ifdef DEBUG 399 | if (iter%100000 == 0) { 400 | cout<< "iter: "<< iter; 401 | cout<< " time elapsed: "<< double(clock()-begin_total)/CLOCKS_PER_SEC; 402 | cout<< " partial Q: "<< sQ<< "\n"; 403 | } 404 | #endif 405 | } // end first while loop 406 | } while (!convergence(univ, av, heap)); 407 | 408 | clock_t end_total = clock(); 409 | double elapsed_total = double(end_total - begin_total) / CLOCKS_PER_SEC; 410 | return make_pair(elapsed_total, sQ); 411 | } 412 | 413 | 414 | /* [header] function: fcd 415 | * ---------------------------------------------------------------------------- 416 | * Header function that run the fast community detection algorithm. 417 | * 418 | * Args: 419 | * - univ: community vector. 420 | * - av : double vector. 421 | * - heap: max-heap. 422 | * - m : number of edges. 423 | * - chunk_size: trivial. 424 | * 425 | * Returns: tuple of 426 | */ 427 | pair cnm2 (double Q, vector& univ, 428 | vector& av, MaxHeap& heap, 429 | int l_scope) { 430 | 431 | int x, y, l; 432 | uint64_t stamp; 433 | double elapsed; 434 | clock_t begin, end; 435 | 436 | int iter=0; 437 | double sQ = Q; 438 | vector touched(univ.size(), false); 439 | vector> candidates; 440 | 441 | clock_t begin_total = clock(); 442 | while (!heap.empty() || candidates.size()>0) { 443 | l=0; 444 | while (!heap.empty() && ldq; 464 | merge(univ[x], univ[y], av, heap); 465 | 466 | #ifdef DEBUG 467 | if (iter%100000 == 0) { 468 | cout<< "iter: "<< iter; 469 | cout<< " time elapsed: "<< double(clock()-begin_total)/CLOCKS_PER_SEC; 470 | cout<< " partial Q: "<< sQ<< "\n"; 471 | } 472 | #endif 473 | } // end first for loop 474 | 475 | for (int i=0; i. 16 | * 17 | * =========================================================================== 18 | * 19 | * Author: Lorenzo Rutigliano 20 | * 21 | * =========================================================================== 22 | */ 23 | 24 | #ifndef __FCD_H 25 | #define __FCD_H 26 | 27 | #include 28 | #include "Community.h" 29 | #include "MaxHeap.h" 30 | 31 | #define DEBUG 32 | 33 | // COMMONS 34 | bool fileExists(const std::string&); 35 | int init_universe(std::vector&, std::string); 36 | void init_array(std::vector&, std::vector&, int); 37 | void init_heap(MaxHeap&, std::vector&, std::vector&); 38 | double init_Q(std::vector&); 39 | void fill(std::vector&, std::vector&); 40 | void shrink_all(std::vector&); 41 | 42 | // ALGORITHMS 43 | std::pair cnm(double, std::vector&, std::vector&, MaxHeap&); 44 | std::pair cnm2(double, std::vector&, std::vector&, MaxHeap&, int); 45 | 46 | #endif // __FCD_H -------------------------------------------------------------------------------- /src/main.cpp: -------------------------------------------------------------------------------- 1 | /* =========================================================================== 2 | * main.cpp 3 | * 4 | * This program is free software: you can redistribute it and/or modify 5 | * it under the terms of the GNU General Public License as published by 6 | * the Free Software Foundation, either version 3 of the License, or 7 | * (at your option) any later version. 8 | * 9 | * This program is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | * GNU General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU General Public License 15 | * along with this program. If not, see . 16 | * 17 | * =========================================================================== 18 | * 19 | * Author: Lorenzo Rutigliano 20 | * 21 | * =========================================================================== 22 | */ 23 | 24 | #include 25 | #include 26 | #include 27 | #include 28 | #include 29 | 30 | #include "fcd.h" 31 | using namespace std; 32 | 33 | #define OUTPUT 34 | #define COMP 35 | 36 | tuple stats (vector& univ, vector av) { 37 | int n_of_singleton = 0; 38 | int n_of_communities = 0; 39 | int max_size = 0; 40 | int sc; 41 | int cnt = 0; 42 | double mean_size = 0; 43 | 44 | for (int c=0; c 0 && sc > 0) { 47 | cnt++; 48 | if (sc < 3) n_of_singleton++; 49 | else n_of_communities++; 50 | if (sc > max_size) max_size=sc; 51 | mean_size+=sc; 52 | } 53 | } 54 | 55 | return make_tuple(n_of_communities,n_of_singleton, 56 | max_size, int(mean_size/double(cnt))); 57 | } 58 | 59 | 60 | vector ownership(vector& univ) { 61 | vector own(univ.size(), -1); 62 | for (auto&& c: univ) 63 | for (auto&& m: c.clist) 64 | if (m.member) 65 | own[m.k] = c.id; 66 | return own; 67 | } 68 | 69 | 70 | vector selection(vector& univ, int t, int m) { 71 | int lowerbound = 256; 72 | int upperbound = 32768; 73 | int midbound = 2048; 74 | vector res; 75 | vector> order; 76 | 77 | for (auto&& c: univ) 78 | if (c.size() > 0) 79 | order.push_back(make_pair(c.members(), c.id)); 80 | 81 | sort(order.begin(), order.end()); 82 | reverse(order.begin(), order.end()); 83 | 84 | int cnt = 0; 85 | for (int i=0; i= t) break; 87 | if (order[i].first >= lowerbound && order[i].first <= upperbound) { 88 | res.push_back(order[i].second); 89 | cnt++; 90 | } 91 | } 92 | 93 | vector mid; 94 | vector own = ownership(univ); 95 | 96 | for (int i: res) { 97 | cnt = 0; 98 | for (auto&& v: univ[i].clist) { 99 | if (cnt >= 64) break; 100 | if (!v.member && own[v.k] >= 0) { 101 | if (find(res.begin(), res.end(), own[v.k]) == res.end()) { 102 | if (univ[own[v.k]].members() >= lowerbound && univ[own[v.k]].members() <= midbound) { 103 | if (find(mid.begin(), mid.end(), own[v.k]) == mid.end()) { 104 | mid.push_back(own[v.k]); 105 | cnt++; 106 | } 107 | } 108 | } 109 | } 110 | } 111 | } 112 | 113 | random_shuffle(mid.begin(), mid.end()); 114 | for (int i=0; i& univ, vector& selection) { 123 | vector own = ownership(univ); 124 | vector visited(univ.size(), false); 125 | vector origin; 126 | int m = init_universe(origin, filename); 127 | list::iterator it; 128 | list queue; 129 | int front; 130 | 131 | ofstream myfile; 132 | if (ms) myfile.open (filename + "_struct_ms.tsv"); 133 | else myfile.open (filename + "_struct_std.tsv"); 134 | myfile << "Source\tTarget\n"; 135 | 136 | for (int i: selection) { 137 | front = univ[i].clist.front().k; 138 | visited[front] = true; 139 | queue.push_back(front); 140 | 141 | while (!queue.empty()) { 142 | front = queue.front(); 143 | queue.pop_front(); 144 | for (it=origin[front].clist.begin(); it!=origin[front].clist.end(); ++it) { 145 | if (find(selection.begin(),selection.end(),own[it->k]) != selection.end()) { 146 | if (!visited[it->k]) { 147 | myfile << front << "\t" << it->k << "\n"; 148 | visited[it->k] = true; 149 | queue.push_back(it->k); 150 | } 151 | } 152 | } 153 | } 154 | for (int b=0; b& univ) { 162 | ofstream myfile; 163 | if (ms) myfile.open (filename + "_info_ms.tsv"); 164 | else myfile.open (filename + "_info_std.tsv"); 165 | myfile << "Id\tSize\n"; 166 | for (auto&& c: univ) 167 | if (c.size() > 0) 168 | myfile << c.id << "\t" << c.members() << "\n"; 169 | myfile.close(); 170 | } 171 | 172 | 173 | void CommunityToTSV(string filename, bool ms, 174 | vector& univ, vector selection) { 175 | ofstream ids; 176 | if (ms) ids.open (filename + "_id_ms.tsv"); 177 | else ids.open (filename + "_id_std.tsv"); 178 | ids << "Id\tCommunity\n"; 179 | for (int i=0; imember) 183 | ids << it->k << "\t" << selection[i] << "\n"; 184 | ids.close(); 185 | } 186 | 187 | 188 | bool run(string filename, bool ms, int l_scope) { 189 | /* ========================================================================= */ 190 | vector arrv; /* Array of elements A (see paper). If a value 191 | is less than zero, it means that the 192 | corresponding community was merged 193 | within another. */ 194 | vector univ; /* Array of Communities. */ 195 | MaxHeap heap; /* Max-Heap of pairs delta Q value. */ 196 | int m; /* Number of edges */ 197 | /* ========================================================================= */ 198 | 199 | #ifdef OUTPUT 200 | cout << "============================================================\n"; 201 | if (!ms) cout << "CNM-standard\n\n"; 202 | else cout << "CNM-multistep\n\n"; 203 | #endif 204 | m = init_universe(univ, filename); 205 | init_array(arrv, univ, m); 206 | init_heap(heap, univ, arrv); 207 | double Q = init_Q(arrv); 208 | 209 | double total_time, sQ; 210 | if (!ms) tie(total_time, sQ) = cnm(Q, univ, arrv, heap); 211 | else tie(total_time, sQ) = cnm2(Q, univ, arrv, heap, l_scope); 212 | 213 | #ifdef DEBUG 214 | clock_t post_begin = clock(); 215 | #endif 216 | vector sel = selection(univ, 3, 7); 217 | fill(univ, arrv); 218 | shrink_all(univ); 219 | #ifdef DEBUG 220 | clock_t post_end = clock(); 221 | double post_elapsed = double(post_end - post_begin) / CLOCKS_PER_SEC; 222 | cout << "Time to post-processing: " << post_elapsed << " seconds" << endl; 223 | #endif 224 | 225 | int cms, sngl, maxs, mns; 226 | tie(cms, sngl, maxs, mns) = stats(univ, arrv); 227 | 228 | ofstream myfile; 229 | myfile.open ("summary_" + filename, ios::app); 230 | if (!ms) myfile << "CNM-standard "; 231 | else myfile << "CNM-multistep l_scope: " << l_scope << " "; 232 | myfile << "maxQ " << sQ << " total_time " << total_time << " "; 233 | myfile << "#minors " << sngl << " #communities " << cms << " "; 234 | myfile << "max size: " << maxs << " mean size: " << mns << "\n"; 235 | myfile.close(); 236 | 237 | #ifdef DEBUG 238 | clock_t begin = clock(); 239 | #endif 240 | SizeToTSV(filename, ms, univ); 241 | CommunityToTSV(filename, ms, univ, sel); 242 | StructureToTSV(filename, ms, univ, sel); 243 | #ifdef DEBUG 244 | clock_t end = clock(); 245 | double elapsed = double(end - begin) / CLOCKS_PER_SEC; 246 | cout << "Time to generate tsv files: " << elapsed << " seconds" << endl; 247 | #endif 248 | 249 | #ifdef OUTPUT 250 | cout << "# vertices: " << univ.size() << "\n"; 251 | cout << "# edges: " << m << "\n"; 252 | cout << "total time: " << total_time << " seconds\n"; 253 | cout << "max Q: " << sQ << "\n"; 254 | cout << "#minors: " << sngl << "\t#communities: " << cms << "\n"; 255 | cout << "max size: " << maxs << " mean size: " << mns << "\n"; 256 | cout << "============================================================\n\n"; 257 | #endif 258 | return (univ.size()<600000 && m<3000000); 259 | } 260 | 261 | 262 | /* MAIN */ 263 | int main(int argc, char *argv[]) { 264 | /* ========================================================================= */ 265 | vector arrv; /* Array of elements A (see paper). If a value 266 | is less than zero, it means that the 267 | corresponding community was merged 268 | within another. */ 269 | vector univ; /* Array of Communities. */ 270 | MaxHeap heap; /* Max-Heap of pairs delta Q value. */ 271 | int m; /* Number of edges */ 272 | /* ========================================================================= */ 273 | 274 | if (argc != 3) { 275 | cerr << "Extra Command Line Arguments Error: wrong number of arguments" << endl; 276 | exit(1); 277 | } 278 | 279 | istringstream ss(argv[1]); 280 | string filename; 281 | ss >> filename; 282 | 283 | istringstream ii(argv[2]); 284 | int l_scope; 285 | if(!(ii >> l_scope)) 286 | cerr << "Invalid number\n"; 287 | 288 | if (!fileExists(filename)) { 289 | cerr << "Extra Command Line Arguments Error: file doesn't exists" << endl; 290 | exit(1); 291 | } 292 | 293 | bool flag = run(filename, true, l_scope); 294 | #ifdef COMP 295 | if (flag) run(filename, false, 0); 296 | #endif 297 | exit(0); 298 | } 299 | --------------------------------------------------------------------------------