add: fluid communities decs to communities and decomposition section

Author: BeaMarton13

src/_igraph/graphobject.c

@@ -18439,6 +18439,28 @@ struct PyMethodDef igraphmodule_Graph_methods[] = {
    "\n"
    "@see: modularity()\n"
   },
+  {"community_fluid_communities", 
+    (PyCFunction) igraphmodule_Graph_community_fluid_communities,
+    METH_VARARGS | METH_KEYWORDS,
+    "community_fluid_communities(no_of_communities)\n--\n\n"
+    "Community detection based on fluids interacting on the graph.\n\n"
+    "The algorithm is based on the simple idea of several fluids interacting\n"
+    "in a non-homogeneous environment (the graph topology), expanding and\n"
+    "contracting based on their interaction and density. Weighted graphs are\n"
+    "not supported.\n\n"
+    "This function implements the community detection method described in:\n"
+    "Parés F, Gasulla DG, et. al. (2018) Fluid Communities: A Competitive,\n"
+    "Scalable and Diverse Community Detection Algorithm. In: Complex Networks\n"
+    "& Their Applications VI: Proceedings of Complex Networks 2017 (The Sixth\n"
+    "International Conference on Complex Networks and Their Applications),\n"
+    "Springer, vol 689, p 229. https://doi.org/10.1007/978-3-319-72150-7_19\n\n"
+    "@param no_of_communities: The number of communities to be found. Must be\n"
+    " greater than 0 and fewer than number of vertices in the graph.\n"
+    "@return: a list with the community membership of each vertex.\n"
+    "@note: The graph must be simple and connected. Edge directions will be\n"
+    " ignored if the graph is directed.\n"
+    "@note: Time complexity: O(|E|)\n"
+  },
   {"community_infomap",
    (PyCFunction) igraphmodule_Graph_community_infomap,
    METH_VARARGS | METH_KEYWORDS,
@@ -18734,31 +18756,6 @@ struct PyMethodDef igraphmodule_Graph_methods[] = {
    "  the given length (shorter if the random walk got stuck).\n"
   },
 
-
-  /**********************/
-  /* OTHER METHODS */
-  /**********************/
-  {"community_fluid_communities", (PyCFunction) igraphmodule_Graph_community_fluid_communities,
- METH_VARARGS | METH_KEYWORDS,
- "community_fluid_communities(no_of_communities)\n--\n\n"
- "Community detection based on fluids interacting on the graph.\n\n"
- "The algorithm is based on the simple idea of several fluids interacting\n"
- "in a non-homogeneous environment (the graph topology), expanding and\n"
- "contracting based on their interaction and density. Weighted graphs are\n"
- "not supported.\n\n"
- "This function implements the community detection method described in:\n"
- "Parés F, Gasulla DG, et. al. (2018) Fluid Communities: A Competitive,\n"
- "Scalable and Diverse Community Detection Algorithm. In: Complex Networks\n"
- "& Their Applications VI: Proceedings of Complex Networks 2017 (The Sixth\n"
- "International Conference on Complex Networks and Their Applications),\n"
- "Springer, vol 689, p 229. https://doi.org/10.1007/978-3-319-72150-7_19\n\n"
- "@param no_of_communities: The number of communities to be found. Must be\n"
- " greater than 0 and fewer than number of vertices in the graph.\n"
- "@return: a list with the community membership of each vertex.\n"
- "@note: The graph must be simple and connected. Edge directions will be\n"
- " ignored if the graph is directed.\n"
- "@note: Time complexity: O(|E|)\n"},
-
   /**********************/
   /* INTERNAL FUNCTIONS */
   /**********************/