feat: added first benchmark

Author: ntamas

README.md

@@ -29,6 +29,12 @@ things may break randomly, or they may not even work.
 4. Run `poetry run pytest` to run the unit tests, or `poetry run python` to run
    a Python interpreter where you can `import igraph_ctypes`
 
+## Benchmarking
+
+Benchmarks will be placed in `benchmarks` and they will compare the "old",
+official Python interface of igraph with this new implementation. To run the
+benchmarks, type `poetry run richbench benchmarks`.
+
 ## Caveats
 
 - Apparently you'll need to ensure that the igraph shared library is built

benchmarks/bench_shortest_path.py

@@ -0,0 +1,30 @@
+from random import randint
+
+from igraph import Graph as LegacyGraph
+
+from igraph_ctypes.constructors import create_square_lattice
+from igraph_ctypes.paths import get_shortest_path
+
+n, k = 1000, 100
+
+sources = [randint(0, n - 1) for _ in range(k)]
+targets = [randint(0, n - 1) for _ in range(k)]
+pairs = list(zip(sources, targets))
+
+old_g = LegacyGraph.Lattice([n, n])
+new_g = create_square_lattice([n, n])
+
+
+def with_old_igraph():
+    for u, v in pairs:
+        old_g.get_shortest_paths(u, v)
+
+
+def with_new_igraph():
+    for u, v in pairs:
+        get_shortest_path(new_g, u, v)
+
+
+__benchmarks__ = [
+    (with_old_igraph, with_new_igraph, "Finding shortest path in grid graph")
+]