feat: added a few more functions

Author: ntamas

src/igraph_ctypes/constructors.py

@@ -1,11 +1,12 @@
-from typing import Iterable, Optional, Union
+from typing import Iterable, Union
 
 from .graph import Graph
-from ._internal.functions import create, famous, square_lattice
+from ._internal.functions import create, famous, grg_game, square_lattice
 
 __all__ = (
     "create_empty_graph",
     "create_famous_graph",
+    "create_geometric_random_graph",
     "create_graph_from_edge_list",
     "create_square_lattice",
 )
@@ -75,3 +76,14 @@ def create_square_lattice(
     return Graph(
         _wrap=square_lattice(dimvector, nei, directed, mutual, periodic_per_dim)
     )
+
+
+def create_geometric_random_graph(n: int, radius: float, torus: bool = False):
+    """Creates a geometric random graph.
+
+    Parameters:
+        n: the number of vertices in the graph
+        radius: connection distance; two vertices will be connected if they are
+            closer to each other than this threshold
+    """
+    return Graph(_wrap=grg_game(n, radius, torus)[0])

src/igraph_ctypes/conversion.py

@@ -0,0 +1,10 @@
+from igraph_ctypes._internal.functions import get_edgelist
+
+from .graph import Graph
+from .types import IntArray
+
+__all__ = ("get_edge_list",)
+
+
+def get_edge_list(graph: Graph) -> IntArray:
+    return get_edgelist(graph).reshape((-1, 2))

src/igraph_ctypes/enums.py

@@ -5,6 +5,7 @@
 #
 # TODO(ntamas): maybe this file should be autogenerated as well?
 
+from ._internal.enums import Connectedness
 from ._internal.enums import NeighborMode
 
-__all__ = ("NeighborMode",)
+__all__ = ("Connectedness", "NeighborMode")

src/igraph_ctypes/paths.py

@@ -2,11 +2,12 @@
 
 from typing import Iterable, Optional
 
-from .enums import NeighborMode
+from .enums import Connectedness, NeighborMode
 from .graph import Graph
 from .types import IntArray, VertexLike
 
 from ._internal.functions import (
+    connected_components,
     get_shortest_path,
     get_shortest_path_bellman_ford,
     get_shortest_path_dijkstra,
@@ -15,6 +16,11 @@
 __all__ = ("shortest_path",)
 
 
+def components(graph: Graph, mode: Connectedness = Connectedness.WEAK):
+    membership, _, _ = connected_components(graph, mode)
+    return membership
+
+
 def shortest_path(
     graph: Graph,
     source: VertexLike,

test/test_properties.py

@@ -0,0 +1,35 @@
+from numpy import array
+from numpy.testing import assert_array_equal
+
+from igraph_ctypes.constructors import create_square_lattice
+from igraph_ctypes.conversion import get_edge_list
+
+
+def test_get_edge_list():
+    g = create_square_lattice([4, 3])
+
+    edges = get_edge_list(g)
+    assert_array_equal(
+        edges,
+        array(
+            [
+                [0, 1],
+                [0, 4],
+                [1, 2],
+                [1, 5],
+                [2, 3],
+                [2, 6],
+                [3, 7],
+                [4, 5],
+                [4, 8],
+                [5, 6],
+                [5, 9],
+                [6, 7],
+                [6, 10],
+                [7, 11],
+                [8, 9],
+                [9, 10],
+                [10, 11],
+            ]
+        ),
+    )