ruby-igraph 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 6c8d42e6329374a6359c9deb97da1e291b0f84c1cce87b3f8c73fcbf3ac7e61c
+  data.tar.gz: 5c6b774458e03ed53839816b2176f7842048bbed670b1fc021937c51cda19521
+SHA512:
+  metadata.gz: 237622ee6be6276813a854ac7c25c51c6be5a7c1815c4c3e70db9c2d01512b7e9845d07f848b2b080c6e09f61ef70f6fdfabae191e6187757eacf00b9dd28b30
+  data.tar.gz: 0f35eec9240147790701f796f8be3b299f6704db28335715b0b6f5006cb4e743c003b681dcf22d03400d580eebee431b06fa2c2437bfda0e5212c2a696218ec3

data/README.md

@@ -0,0 +1,73 @@
+# ruby-igraph
+
+[![test](https://github.com/kojix2/ruby-igraph/actions/workflows/test.yml/badge.svg)](https://github.com/kojix2/ruby-igraph/actions/workflows/test.yml)
+[![Lines of Code](https://img.shields.io/endpoint?url=https%3A%2F%2Ftokei.kojix2.net%2Fbadge%2Fgithub%2Fkojix2%2Fruby-igraph%2Flines)](https://tokei.kojix2.net/github/kojix2/ruby-igraph)
+
+Ruby bindings for the igraph library - a collection of network analysis tools.
+
+## Installation
+
+Install the igraph C library first:
+
+```bash
+# macOS
+brew install igraph
+
+# Ubuntu/Debian
+sudo apt-get install libigraph-dev
+
+# Other systems: see https://igraph.org/c/doc/igraph-Installation.html
+```
+
+Then install the gem:
+
+```bash
+gem install ruby-igraph
+```
+
+## Usage
+
+```ruby
+require 'igraph'
+
+# Create a simple graph
+graph = IGraph::LibIGraph::Graph.new
+IGraph::LibIGraph.igraph_empty(graph.pointer, 3, false)
+
+# Add edges
+edges = IGraph::LibIGraph::VectorIntStruct.new
+IGraph::LibIGraph.igraph_vector_int_init(edges.pointer, 4)
+IGraph::LibIGraph.igraph_vector_int_set(edges.pointer, 0, 0)
+IGraph::LibIGraph.igraph_vector_int_set(edges.pointer, 1, 1)
+IGraph::LibIGraph.igraph_vector_int_set(edges.pointer, 2, 1)
+IGraph::LibIGraph.igraph_vector_int_set(edges.pointer, 3, 2)
+
+IGraph::LibIGraph.igraph_create(graph.pointer, edges.pointer, 3, false)
+
+# Get basic properties
+vcount = IGraph::LibIGraph.igraph_vcount(graph.pointer)  # => 3
+ecount = IGraph::LibIGraph.igraph_ecount(graph.pointer)  # => 2
+
+# Clean up
+IGraph::LibIGraph.igraph_vector_int_destroy(edges.pointer)
+IGraph::LibIGraph.igraph_destroy(graph.pointer)
+```
+
+## Development
+
+```bash
+git clone https://github.com/kojix2/ruby-igraph
+cd ruby-igraph
+bundle install
+rake test
+```
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub.
+
+## License
+
+This project was built with love using the vibe coding method.
+
+[MIT License](https://opensource.org/licenses/MIT).

data/lib/igraph/libigraph/bipartite.rb

@@ -0,0 +1,13 @@
+require "ffi"
+require_relative "datatype"
+require_relative "vector"
+
+module IGraph
+  module LibIGraph
+    # igraph_error_t igraph_is_bipartite(const igraph_t *graph, igraph_bool_t *res, igraph_vector_bool_t *type);
+    attach_function :igraph_is_bipartite, %i[pointer pointer pointer], :int
+
+    # igraph_error_t igraph_maximum_bipartite_matching(const igraph_t* graph, const igraph_vector_bool_t* types, igraph_integer_t* matching_size, igraph_real_t* matching_weight, igraph_vector_int_t* matching, const igraph_vector_t* weights, igraph_real_t eps);
+    attach_function :igraph_maximum_bipartite_matching, %i[pointer pointer pointer pointer pointer pointer double], :int
+  end
+end

data/lib/igraph/libigraph/centrality.rb

@@ -0,0 +1,31 @@
+require "ffi"
+require_relative "datatype"
+require_relative "vector"
+
+module IGraph
+  module LibIGraph
+    # igraph_error_t igraph_betweenness(const igraph_t *graph, igraph_vector_t *res, const igraph_vs_t vids, igraph_bool_t directed, const igraph_vector_t *weights);
+    attach_function :igraph_betweenness, %i[pointer pointer pointer bool pointer], :int
+
+    # igraph_error_t igraph_pagerank(const igraph_t *graph, igraph_pagerank_algo_t algo, igraph_vector_t *vector, igraph_real_t *value, const igraph_vs_t vids, igraph_bool_t directed, igraph_real_t damping, const igraph_vector_t *weights, igraph_arpack_options_t *options);
+    attach_function :igraph_pagerank, %i[pointer int pointer pointer pointer bool double pointer pointer], :int
+
+    # igraph_error_t igraph_closeness(const igraph_t *graph, igraph_vector_t *res, igraph_vector_int_t *reachable_count, igraph_bool_t *all_reachable, const igraph_vs_t vids, igraph_neimode_t mode, const igraph_vector_t *weights, igraph_bool_t normalized);
+    attach_function :igraph_closeness, %i[pointer pointer pointer pointer pointer int pointer bool], :int
+
+    # igraph_error_t igraph_eigenvector_centrality(const igraph_t *graph, igraph_vector_t *vector, igraph_real_t *value, igraph_bool_t directed, igraph_bool_t scale, const igraph_vector_t *weights, igraph_arpack_options_t *options);
+    attach_function :igraph_eigenvector_centrality, %i[pointer pointer pointer bool bool pointer pointer], :int
+
+    # igraph_error_t igraph_hub_and_authority_scores(const igraph_t *graph, igraph_vector_t *hub_vector, igraph_vector_t *authority_vector, igraph_real_t *value, igraph_bool_t scale, const igraph_vector_t *weights, igraph_arpack_options_t *options);
+    attach_function :igraph_hub_and_authority_scores, %i[pointer pointer pointer pointer bool pointer pointer], :int
+
+    # igraph_error_t igraph_harmonic_centrality(const igraph_t *graph, igraph_vector_t *res, const igraph_vs_t vids, igraph_neimode_t mode, const igraph_vector_t *weights, igraph_bool_t normalized);
+    attach_function :igraph_harmonic_centrality, %i[pointer pointer pointer int pointer bool], :int
+
+    # igraph_error_t igraph_hub_score(const igraph_t *graph, igraph_vector_t *vector, igraph_real_t *value, igraph_bool_t scale, const igraph_vector_t *weights, igraph_arpack_options_t *options);
+    attach_function :igraph_hub_score, %i[pointer pointer pointer bool pointer pointer], :int
+
+    # igraph_error_t igraph_authority_score(const igraph_t *graph, igraph_vector_t *vector, igraph_real_t *value, igraph_bool_t scale, const igraph_vector_t *weights, igraph_arpack_options_t *options);
+    attach_function :igraph_authority_score, %i[pointer pointer pointer bool pointer pointer], :int
+  end
+end

data/lib/igraph/libigraph/constants.rb

@@ -0,0 +1,82 @@
+module IGraph
+  module LibIGraph
+    # Graph directedness
+    IGRAPH_UNDIRECTED = 0
+    IGRAPH_DIRECTED = 1
+
+    # Loop handling
+    IGRAPH_NO_LOOPS = 0
+    IGRAPH_LOOPS = 1
+    IGRAPH_LOOPS_TWICE = 1
+    IGRAPH_LOOPS_ONCE = 2
+
+    # Multiple edges
+    IGRAPH_NO_MULTIPLE = 0
+    IGRAPH_MULTIPLE = 1
+
+    # Ordering
+    IGRAPH_ASCENDING = 0
+    IGRAPH_DESCENDING = 1
+
+    # Optimization
+    IGRAPH_MINIMUM = 0
+    IGRAPH_MAXIMUM = 1
+
+    # Neighbor modes
+    IGRAPH_OUT = 1
+    IGRAPH_IN = 2
+    IGRAPH_ALL = 3
+
+    # Connectedness
+    IGRAPH_WEAK = 1
+    IGRAPH_STRONG = 2
+
+    # Adjacency matrix modes
+    IGRAPH_ADJ_DIRECTED = 0
+    IGRAPH_ADJ_UNDIRECTED = 1
+    IGRAPH_ADJ_UPPER = 2
+    IGRAPH_ADJ_LOWER = 3
+    IGRAPH_ADJ_MIN = 4
+    IGRAPH_ADJ_PLUS = 5
+    IGRAPH_ADJ_MAX = 6
+
+    # Star graph modes
+    IGRAPH_STAR_OUT = 0
+    IGRAPH_STAR_IN = 1
+    IGRAPH_STAR_UNDIRECTED = 2
+    IGRAPH_STAR_MUTUAL = 3
+
+    # Tree modes
+    IGRAPH_TREE_OUT = 0
+    IGRAPH_TREE_IN = 1
+    IGRAPH_TREE_UNDIRECTED = 2
+
+    # Matrix storage
+    IGRAPH_ROW_MAJOR = 0
+    IGRAPH_COLUMN_MAJOR = 1
+
+    # Vertex selector types
+    IGRAPH_VS_ALL = 0
+    IGRAPH_VS_ADJ = 1
+    IGRAPH_VS_NONE = 2
+    IGRAPH_VS_1 = 3
+    IGRAPH_VS_VECTORPTR = 4
+    IGRAPH_VS_VECTOR = 5
+    IGRAPH_VS_RANGE = 6
+    IGRAPH_VS_NONADJ = 7
+
+    # Edge selector types
+    IGRAPH_ES_ALL = 0
+    IGRAPH_ES_ALLFROM = 1
+    IGRAPH_ES_ALLTO = 2
+    IGRAPH_ES_INCIDENT = 3
+    IGRAPH_ES_NONE = 4
+    IGRAPH_ES_1 = 5
+    IGRAPH_ES_VECTORPTR = 6
+    IGRAPH_ES_VECTOR = 7
+    IGRAPH_ES_RANGE = 8
+    IGRAPH_ES_PAIRS = 9
+    IGRAPH_ES_PATH = 10
+    IGRAPH_ES_ALL_BETWEEN = 12
+  end
+end

data/lib/igraph/libigraph/constructors.rb

@@ -0,0 +1,34 @@
+require "ffi"
+require_relative "datatype"
+require_relative "vector"
+
+module IGraph
+  module LibIGraph
+    # igraph_error_t igraph_create(igraph_t *graph, const igraph_vector_int_t *edges, igraph_integer_t n, igraph_bool_t directed);
+    attach_function :igraph_create, %i[pointer pointer long_long bool], :int
+
+    # igraph_error_t igraph_full(igraph_t *graph, igraph_integer_t n, igraph_bool_t directed, igraph_bool_t loops);
+    attach_function :igraph_full, %i[pointer long_long bool bool], :int
+
+    # igraph_error_t igraph_star(igraph_t *graph, igraph_integer_t n, igraph_star_mode_t mode, igraph_integer_t center);
+    attach_function :igraph_star, %i[pointer long_long int long_long], :int
+
+    # igraph_error_t igraph_ring(igraph_t *graph, igraph_integer_t n, igraph_bool_t directed, igraph_bool_t mutual, igraph_bool_t circular);
+    attach_function :igraph_ring, %i[pointer long_long bool bool bool], :int
+
+    # igraph_error_t igraph_adjacency(igraph_t *graph, const igraph_matrix_t *adjmatrix, igraph_adjacency_t mode, igraph_loops_t loops);
+    attach_function :igraph_adjacency, %i[pointer pointer int int], :int
+
+    # igraph_error_t igraph_small(igraph_t *graph, igraph_integer_t n, igraph_bool_t directed, int first, ...);
+    attach_function :igraph_small, %i[pointer long_long bool int varargs], :int
+
+    # igraph_error_t igraph_wheel(igraph_t *graph, igraph_integer_t n, igraph_wheel_mode_t mode, igraph_integer_t center);
+    attach_function :igraph_wheel, %i[pointer long_long int long_long], :int
+
+    # igraph_error_t igraph_kary_tree(igraph_t *graph, igraph_integer_t n, igraph_integer_t children, igraph_tree_mode_t type);
+    attach_function :igraph_kary_tree, %i[pointer long_long long_long int], :int
+
+    # igraph_error_t igraph_atlas(igraph_t *graph, igraph_integer_t number);
+    attach_function :igraph_atlas, %i[pointer long_long], :int
+  end
+end

data/lib/igraph/libigraph/datatype.rb

@@ -0,0 +1,22 @@
+require "ffi"
+
+require_relative "vector"
+
+module IGraph
+  module LibIGraph
+    class Graph < FFI::Struct
+      layout(
+        :n, :long_long,           # igraph_integer_t
+        :directed, :bool,         # igraph_bool_t (bool)
+        :from, VectorIntStruct,   # igraph_vector_int_t (embedded)
+        :to, VectorIntStruct,     # igraph_vector_int_t (embedded)
+        :oi, VectorIntStruct,     # igraph_vector_int_t (embedded)
+        :ii, VectorIntStruct,     # igraph_vector_int_t (embedded)
+        :os, VectorIntStruct,     # igraph_vector_int_t (embedded)
+        :is, VectorIntStruct,     # igraph_vector_int_t (embedded)
+        :attr, :pointer,          # void*
+        :cache, :pointer          # igraph_i_property_cache_t*
+      )
+    end
+  end
+end

data/lib/igraph/libigraph/error.rb

@@ -0,0 +1,34 @@
+module IGraph
+  module LibIGraph
+    # Error codes
+    IGRAPH_SUCCESS = 0
+    IGRAPH_FAILURE = 1
+    IGRAPH_ENOMEM = 2
+    IGRAPH_PARSEERROR = 3
+    IGRAPH_EINVAL = 4
+    IGRAPH_EXISTS = 5
+    IGRAPH_EINVEVECTOR = 6
+    IGRAPH_EINVVID = 7
+    IGRAPH_NONSQUARE = 8
+    IGRAPH_EINVMODE = 9
+    IGRAPH_EFILE = 10
+    IGRAPH_UNIMPLEMENTED = 12
+    IGRAPH_INTERRUPTED = 13
+    IGRAPH_DIVERGED = 14
+    IGRAPH_ENEGLOOP = 37
+    IGRAPH_EINTERNAL = 38
+    IGRAPH_EDIVZERO = 42
+    IGRAPH_EOVERFLOW = 55
+    IGRAPH_EUNDERFLOW = 58
+    IGRAPH_ERWSTUCK = 59
+    IGRAPH_STOP = 60
+    IGRAPH_ERANGE = 61
+    IGRAPH_ENOSOL = 62
+
+    # const char *igraph_strerror(const igraph_error_t igraph_errno);
+    attach_function :igraph_strerror, [:int], :string
+
+    # igraph_error_t igraph_error(const char *reason, const char *file, int line, igraph_error_t igraph_errno);
+    attach_function :igraph_error, %i[string string int int], :int
+  end
+end

data/lib/igraph/libigraph/games.rb

@@ -0,0 +1,30 @@
+require "ffi"
+require_relative "datatype"
+require_relative "vector"
+
+module IGraph
+  module LibIGraph
+    # igraph_error_t igraph_erdos_renyi_game_gnp(igraph_t *graph, igraph_integer_t n, igraph_real_t p, igraph_bool_t directed, igraph_bool_t loops);
+    attach_function :igraph_erdos_renyi_game_gnp, %i[pointer long_long double bool bool], :int
+
+    # igraph_error_t igraph_erdos_renyi_game_gnm(igraph_t *graph, igraph_integer_t n, igraph_integer_t m, igraph_bool_t directed, igraph_bool_t loops);
+    attach_function :igraph_erdos_renyi_game_gnm, %i[pointer long_long long_long bool bool], :int
+
+    # igraph_error_t igraph_barabasi_game(igraph_t *graph, igraph_integer_t n, igraph_real_t power, igraph_integer_t m, const igraph_vector_int_t *outseq, igraph_bool_t outpref, igraph_real_t A, igraph_bool_t directed, igraph_barabasi_algorithm_t algo, const igraph_t *start_from);
+    attach_function :igraph_barabasi_game,
+                    %i[pointer long_long double long_long pointer bool double bool int pointer], :int
+
+    # igraph_error_t igraph_watts_strogatz_game(igraph_t *graph, igraph_integer_t dim, igraph_integer_t size, igraph_integer_t nei, igraph_real_t p, igraph_bool_t loops, igraph_bool_t multiple);
+    attach_function :igraph_watts_strogatz_game, %i[pointer long_long long_long long_long double bool bool],
+                    :int
+
+    # igraph_error_t igraph_k_regular_game(igraph_t *graph, igraph_integer_t no_of_nodes, igraph_integer_t k, igraph_bool_t directed, igraph_bool_t multiple);
+    attach_function :igraph_k_regular_game, %i[pointer long_long long_long bool bool], :int
+
+    # igraph_error_t igraph_growing_random_game(igraph_t *graph, igraph_integer_t n, igraph_integer_t m, igraph_bool_t directed, igraph_bool_t citation);
+    attach_function :igraph_growing_random_game, %i[pointer long_long long_long bool bool], :int
+
+    # igraph_error_t igraph_tree_game(igraph_t *graph, igraph_integer_t n, igraph_bool_t directed, igraph_random_tree_t method);
+    attach_function :igraph_tree_game, %i[pointer long_long bool int], :int
+  end
+end

data/lib/igraph/libigraph/interface.rb

@@ -0,0 +1,73 @@
+require "ffi"
+require_relative "datatype"
+require_relative "vector"
+
+module IGraph
+  module LibIGraph
+    # igraph_vs_t structure for vertex selectors
+    # Simplified definition - union data treated as opaque bytes
+    # Actual C structure:
+    # typedef struct igraph_vs_t {
+    #     igraph_vs_type_t type;
+    #     union { ... } data;  // 16 bytes on 64-bit systems
+    # } igraph_vs_t;
+    class VertexSelector < FFI::Struct
+      layout(
+        :type, :int,                    # igraph_vs_type_t (4 bytes)
+        :padding, [:uint8, 4],          # Padding to align to 8-byte boundary
+        :data, [:uint8, 16]             # Union data (16 bytes)
+      )
+    end
+    # igraph_error_t igraph_empty(igraph_t *graph, igraph_integer_t n, igraph_bool_t directed);
+    attach_function :igraph_empty, %i[pointer long_long bool], :int
+
+    # void igraph_destroy(igraph_t *graph);
+    attach_function :igraph_destroy, [:pointer], :void
+
+    # igraph_integer_t igraph_vcount(const igraph_t *graph);
+    attach_function :igraph_vcount, [:pointer], :long_long
+
+    # igraph_integer_t igraph_ecount(const igraph_t *graph);
+    attach_function :igraph_ecount, [:pointer], :long_long
+
+    # igraph_bool_t igraph_is_directed(const igraph_t *graph);
+    attach_function :igraph_is_directed, [:pointer], :bool
+
+    # igraph_error_t igraph_add_edges(igraph_t *graph, const igraph_vector_int_t *edges, void *attr);
+    attach_function :igraph_add_edges, %i[pointer pointer pointer], :int
+
+    # igraph_error_t igraph_add_vertices(igraph_t *graph, igraph_integer_t nv, void *attr);
+    attach_function :igraph_add_vertices, %i[pointer long_long pointer], :int
+
+    # igraph_error_t igraph_neighbors(const igraph_t *graph, igraph_vector_int_t *neis, igraph_integer_t vid, igraph_neimode_t mode);
+    attach_function :igraph_neighbors, %i[pointer pointer long_long int], :int
+
+    # Vertex selector functions
+    # igraph_error_t igraph_vs_all(igraph_vs_t *vs);
+    attach_function :igraph_vs_all, [:pointer], :int
+
+    # void igraph_vs_destroy(igraph_vs_t *vs);
+    attach_function :igraph_vs_destroy, [:pointer], :void
+
+    # igraph_error_t igraph_degree(const igraph_t *graph, igraph_vector_int_t *res, const igraph_vs_t vids, igraph_neimode_t mode, igraph_bool_t loops);
+    attach_function :igraph_degree, [:pointer, :pointer, VertexSelector.by_value, :int, :bool], :int
+
+    # igraph_error_t igraph_delete_edges(igraph_t *graph, igraph_es_t edges);
+    attach_function :igraph_delete_edges, %i[pointer int], :int
+
+    # igraph_error_t igraph_delete_vertices(igraph_t *graph, const igraph_vs_t vertices);
+    attach_function :igraph_delete_vertices, [:pointer, VertexSelector.by_value], :int
+
+    # igraph_error_t igraph_edge(const igraph_t *graph, igraph_integer_t eid, igraph_integer_t *from, igraph_integer_t *to);
+    attach_function :igraph_edge, %i[pointer long_long pointer pointer], :int
+
+    # igraph_error_t igraph_edges(const igraph_t *graph, igraph_es_t eids, igraph_vector_int_t *edges);
+    attach_function :igraph_edges, %i[pointer int pointer], :int
+
+    # igraph_error_t igraph_get_eid(const igraph_t *graph, igraph_integer_t *eid, igraph_integer_t from, igraph_integer_t to, igraph_bool_t directed, igraph_bool_t error);
+    attach_function :igraph_get_eid, %i[pointer pointer long_long long_long bool bool], :int
+
+    # igraph_error_t igraph_incident(const igraph_t *graph, igraph_vector_int_t *eids, igraph_integer_t vid, igraph_neimode_t mode);
+    attach_function :igraph_incident, %i[pointer pointer long_long int], :int
+  end
+end

data/lib/igraph/libigraph/matrix.rb

@@ -0,0 +1,48 @@
+require "ffi"
+require_relative "vector"
+
+module IGraph
+  module LibIGraph
+    # igraph_matrix_t structure (embedded, not pointer)
+    class MatrixStruct < FFI::Struct
+      layout(
+        :data, VectorStruct,   # igraph_vector (embedded)
+        :nrow, :long_long,     # igraph_integer_t
+        :ncol, :long_long      # igraph_integer_t
+      )
+    end
+
+    # For standalone matrix operations
+    class Matrix < FFI::Struct
+      layout(
+        :data, VectorStruct,   # igraph_vector (embedded)
+        :nrow, :long_long,     # igraph_integer_t
+        :ncol, :long_long      # igraph_integer_t
+      )
+    end
+
+    # igraph_error_t igraph_matrix_init(igraph_matrix_t *m, igraph_integer_t nrow, igraph_integer_t ncol);
+    attach_function :igraph_matrix_init, %i[pointer long_long long_long], :int
+
+    # void igraph_matrix_destroy(igraph_matrix_t *m);
+    attach_function :igraph_matrix_destroy, [:pointer], :void
+
+    # igraph_integer_t igraph_matrix_nrow(const igraph_matrix_t *m);
+    attach_function :igraph_matrix_nrow, [:pointer], :long_long
+
+    # igraph_integer_t igraph_matrix_ncol(const igraph_matrix_t *m);
+    attach_function :igraph_matrix_ncol, [:pointer], :long_long
+
+    # double igraph_matrix_get(const igraph_matrix_t *m, igraph_integer_t row, igraph_integer_t col);
+    attach_function :igraph_matrix_get, %i[pointer long_long long_long], :double
+
+    # void igraph_matrix_set(igraph_matrix_t *m, igraph_integer_t row, igraph_integer_t col, double value);
+    attach_function :igraph_matrix_set, %i[pointer long_long long_long double], :void
+
+    # void igraph_matrix_null(igraph_matrix_t *m);
+    attach_function :igraph_matrix_null, [:pointer], :void
+
+    # void igraph_matrix_fill(igraph_matrix_t *m, double e);
+    attach_function :igraph_matrix_fill, %i[pointer double], :void
+  end
+end

data/lib/igraph/libigraph/operators.rb

@@ -0,0 +1,22 @@
+require "ffi"
+require_relative "datatype"
+require_relative "vector"
+
+module IGraph
+  module LibIGraph
+    # igraph_error_t igraph_disjoint_union(igraph_t *res, const igraph_t *left, const igraph_t *right);
+    attach_function :igraph_disjoint_union, %i[pointer pointer pointer], :int
+
+    # igraph_error_t igraph_union(igraph_t *res, const igraph_t *left, const igraph_t *right, igraph_vector_int_t *edge_map1, igraph_vector_int_t *edge_map2);
+    attach_function :igraph_union, %i[pointer pointer pointer pointer pointer], :int
+
+    # igraph_error_t igraph_intersection(igraph_t *res, const igraph_t *left, const igraph_t *right, igraph_vector_int_t *edge_map1, igraph_vector_int_t *edge_map2);
+    attach_function :igraph_intersection, %i[pointer pointer pointer pointer pointer], :int
+
+    # igraph_error_t igraph_difference(igraph_t *res, const igraph_t *orig, const igraph_t *sub);
+    attach_function :igraph_difference, %i[pointer pointer pointer], :int
+
+    # igraph_error_t igraph_complementer(igraph_t *res, const igraph_t *graph, igraph_bool_t loops);
+    attach_function :igraph_complementer, %i[pointer pointer bool], :int
+  end
+end

data/lib/igraph/libigraph/paths.rb

@@ -0,0 +1,24 @@
+require "ffi"
+require_relative "datatype"
+require_relative "vector"
+require_relative "matrix"
+
+module IGraph
+  module LibIGraph
+    # igraph_error_t igraph_distances(const igraph_t *graph, igraph_matrix_t *res, const igraph_vs_t from, const igraph_vs_t to, igraph_neimode_t mode);
+    attach_function :igraph_distances, %i[pointer pointer int int int], :int
+
+    # igraph_error_t igraph_get_shortest_paths_dijkstra(const igraph_t *graph, igraph_vector_int_list_t *vertices, igraph_vector_int_list_t *edges, igraph_integer_t from, const igraph_vs_t to, const igraph_vector_t *weights, igraph_neimode_t mode, igraph_vector_int_t *predecessors, igraph_vector_int_t *inbound_edges);
+    attach_function :igraph_get_shortest_paths_dijkstra,
+                    %i[pointer pointer pointer long_long int pointer int pointer pointer], :int
+
+    # igraph_error_t igraph_diameter(const igraph_t *graph, igraph_real_t *res, igraph_integer_t *from, igraph_integer_t *to, igraph_bool_t directed, igraph_bool_t unconn);
+    attach_function :igraph_diameter, %i[pointer pointer pointer pointer bool bool], :int
+
+    # igraph_error_t igraph_radius(const igraph_t *graph, igraph_real_t *radius, igraph_neimode_t mode);
+    attach_function :igraph_radius, %i[pointer pointer int], :int
+
+    # igraph_error_t igraph_eccentricity(const igraph_t *graph, igraph_vector_t *res, const igraph_vs_t vids, igraph_neimode_t mode);
+    attach_function :igraph_eccentricity, %i[pointer pointer int int], :int
+  end
+end

data/lib/igraph/libigraph/structural.rb

@@ -0,0 +1,58 @@
+require "ffi"
+require_relative "datatype"
+require_relative "vector"
+
+module IGraph
+  module LibIGraph
+    # igraph_error_t igraph_density(const igraph_t *graph, igraph_real_t *res, igraph_bool_t loops);
+    attach_function :igraph_density, %i[pointer pointer bool], :int
+
+    # igraph_error_t igraph_girth(const igraph_t *graph, igraph_real_t *girth, igraph_vector_int_t *circle);
+    attach_function :igraph_girth, %i[pointer pointer pointer], :int
+
+    # igraph_error_t igraph_has_loop(const igraph_t *graph, igraph_bool_t *res);
+    attach_function :igraph_has_loop, %i[pointer pointer], :int
+
+    # igraph_error_t igraph_has_multiple(const igraph_t *graph, igraph_bool_t *res);
+    attach_function :igraph_has_multiple, %i[pointer pointer], :int
+
+    # igraph_error_t igraph_count_loops(const igraph_t *graph, igraph_integer_t *loop_count);
+    attach_function :igraph_count_loops, %i[pointer pointer], :int
+
+    # igraph_error_t igraph_is_simple(const igraph_t *graph, igraph_bool_t *res);
+    attach_function :igraph_is_simple, %i[pointer pointer], :int
+
+    # igraph_error_t igraph_is_tree(const igraph_t *graph, igraph_bool_t *res, igraph_integer_t *root, igraph_neimode_t mode);
+    attach_function :igraph_is_tree, %i[pointer pointer pointer int], :int
+
+    # igraph_error_t igraph_is_acyclic(const igraph_t *graph, igraph_bool_t *res);
+    attach_function :igraph_is_acyclic, %i[pointer pointer], :int
+
+    # igraph_error_t igraph_is_forest(const igraph_t *graph, igraph_bool_t *res, igraph_vector_int_t *roots, igraph_neimode_t mode);
+    attach_function :igraph_is_forest, %i[pointer pointer pointer int], :int
+
+    # igraph_error_t igraph_maxdegree(const igraph_t *graph, igraph_integer_t *res, igraph_vs_t vids, igraph_neimode_t mode, igraph_bool_t loops);
+    attach_function :igraph_maxdegree, %i[pointer pointer int int bool], :int
+
+    # igraph_error_t igraph_mean_degree(const igraph_t *graph, igraph_real_t *res, igraph_bool_t loops);
+    attach_function :igraph_mean_degree, %i[pointer pointer bool], :int
+
+    # igraph_error_t igraph_reciprocity(const igraph_t *graph, igraph_real_t *res, igraph_bool_t ignore_loops, igraph_reciprocity_t mode);
+    attach_function :igraph_reciprocity, %i[pointer pointer bool int], :int
+
+    # igraph_error_t igraph_is_complete(const igraph_t *graph, igraph_bool_t *res);
+    attach_function :igraph_is_complete, %i[pointer pointer], :int
+
+    # igraph_error_t igraph_are_adjacent(const igraph_t *graph, igraph_integer_t v1, igraph_integer_t v2, igraph_bool_t *res);
+    attach_function :igraph_are_adjacent, %i[pointer long_long long_long pointer], :int
+
+    # igraph_error_t igraph_is_connected(const igraph_t *graph, igraph_bool_t *res, igraph_connectedness_t mode);
+    attach_function :igraph_is_connected, %i[pointer pointer int], :int
+
+    # igraph_error_t igraph_average_path_length(const igraph_t *graph, igraph_real_t *res, igraph_real_t *unconn_pairs, igraph_bool_t directed, igraph_bool_t unconn);
+    attach_function :igraph_average_path_length, %i[pointer pointer pointer bool bool], :int
+
+    # igraph_error_t igraph_constraint(const igraph_t *graph, igraph_vector_t *res, igraph_vs_t vids, const igraph_vector_t *weights);
+    attach_function :igraph_constraint, %i[pointer pointer int pointer], :int
+  end
+end

data/lib/igraph/libigraph/topology.rb

@@ -0,0 +1,17 @@
+require "ffi"
+require_relative "datatype"
+require_relative "vector"
+
+module IGraph
+  module LibIGraph
+    # igraph_error_t igraph_topological_sorting(const igraph_t *graph, igraph_vector_int_t *res, igraph_neimode_t mode);
+    attach_function :igraph_topological_sorting, %i[pointer pointer int], :int
+
+    # igraph_error_t igraph_isomorphic(const igraph_t *graph1, const igraph_t *graph2, igraph_bool_t *iso);
+    attach_function :igraph_isomorphic, %i[pointer pointer pointer], :int
+
+    # igraph_error_t igraph_isomorphic_vf2(const igraph_t *graph1, const igraph_t *graph2, const igraph_vector_int_t *vertex_color1, const igraph_vector_int_t *vertex_color2, const igraph_vector_int_t *edge_color1, const igraph_vector_int_t *edge_color2, igraph_bool_t *iso, igraph_vector_int_t *map12, igraph_vector_int_t *map21, igraph_isohandler_t *isohandler, igraph_isocompat_t *node_compat_fn, igraph_isocompat_t *edge_compat_fn, void *arg);
+    attach_function :igraph_isomorphic_vf2,
+                    %i[pointer pointer pointer pointer pointer pointer pointer pointer pointer pointer pointer pointer pointer], :int
+  end
+end

data/lib/igraph/libigraph/transitivity.rb

@@ -0,0 +1,19 @@
+require "ffi"
+require_relative "datatype"
+require_relative "vector"
+
+module IGraph
+  module LibIGraph
+    # igraph_error_t igraph_transitivity_undirected(const igraph_t *graph, igraph_real_t *res, igraph_transitivity_mode_t mode);
+    attach_function :igraph_transitivity_undirected, %i[pointer pointer int], :int
+
+    # igraph_error_t igraph_transitivity_local_undirected(const igraph_t *graph, igraph_vector_t *res, const igraph_vs_t vids, igraph_transitivity_mode_t mode);
+    attach_function :igraph_transitivity_local_undirected, %i[pointer pointer int int], :int
+
+    # igraph_error_t igraph_transitivity_avglocal_undirected(const igraph_t *graph, igraph_real_t *res, igraph_transitivity_mode_t mode);
+    attach_function :igraph_transitivity_avglocal_undirected, %i[pointer pointer int], :int
+
+    # igraph_error_t igraph_transitivity_barrat(const igraph_t *graph, igraph_vector_t *res, const igraph_vs_t vids, const igraph_vector_t *weights, const igraph_transitivity_mode_t mode);
+    attach_function :igraph_transitivity_barrat, %i[pointer pointer int pointer int], :int
+  end
+end

data/lib/igraph/libigraph/vector.rb

@@ -0,0 +1,87 @@
+require "ffi"
+
+module IGraph
+  module LibIGraph
+    # igraph_vector_t structure (double vector)
+    class VectorStruct < FFI::Struct
+      layout(
+        :stor_begin, :pointer, # double*
+        :stor_end,   :pointer, # double*
+        :end,        :pointer  # double*
+      )
+    end
+
+    # igraph_vector_int_t structure (int vector)
+    class VectorIntStruct < FFI::Struct
+      layout(
+        :stor_begin, :pointer, # int*
+        :stor_end,   :pointer, # int*
+        :end,        :pointer  # int*
+      )
+    end
+
+    # igraph_vector_bool_t structure (bool vector)
+    class VectorBoolStruct < FFI::Struct
+      layout(
+        :stor_begin, :pointer, # bool*
+        :stor_end,   :pointer, # bool*
+        :end,        :pointer  # bool*
+      )
+    end
+
+    class VectorInt < FFI::Struct
+      layout(
+        :stor_begin, :pointer, # int*
+        :stor_end,   :pointer, # int*
+        :end,        :pointer  # int*
+      )
+    end
+
+    # igraph_error_t igraph_vector_int_init(igraph_vector_int_t *v, igraph_integer_t size);
+    attach_function :igraph_vector_int_init, %i[pointer long_long], :int
+
+    # void igraph_vector_int_destroy(igraph_vector_int_t *v);
+    attach_function :igraph_vector_int_destroy, [:pointer], :void
+
+    # igraph_integer_t igraph_vector_int_size(const igraph_vector_int_t *v);
+    attach_function :igraph_vector_int_size, [:pointer], :long_long
+
+    # int igraph_vector_int_get(const igraph_vector_int_t *v, igraph_integer_t pos);
+    attach_function :igraph_vector_int_get, %i[pointer long_long], :int
+
+    # void igraph_vector_int_set(igraph_vector_int_t *v, igraph_integer_t pos, int value);
+    attach_function :igraph_vector_int_set, %i[pointer long_long int], :void
+
+    # igraph_vector_t (double vector) functions
+    # igraph_error_t igraph_vector_init(igraph_vector_t *v, igraph_integer_t size);
+    attach_function :igraph_vector_init, %i[pointer long_long], :int
+
+    # void igraph_vector_destroy(igraph_vector_t *v);
+    attach_function :igraph_vector_destroy, [:pointer], :void
+
+    # igraph_integer_t igraph_vector_size(const igraph_vector_t *v);
+    attach_function :igraph_vector_size, [:pointer], :long_long
+
+    # double igraph_vector_get(const igraph_vector_t *v, igraph_integer_t pos);
+    attach_function :igraph_vector_get, %i[pointer long_long], :double
+
+    # void igraph_vector_set(igraph_vector_t *v, igraph_integer_t pos, double value);
+    attach_function :igraph_vector_set, %i[pointer long_long double], :void
+
+    # igraph_vector_bool_t functions
+    # igraph_error_t igraph_vector_bool_init(igraph_vector_bool_t *v, igraph_integer_t size);
+    attach_function :igraph_vector_bool_init, %i[pointer long_long], :int
+
+    # void igraph_vector_bool_destroy(igraph_vector_bool_t *v);
+    attach_function :igraph_vector_bool_destroy, [:pointer], :void
+
+    # igraph_integer_t igraph_vector_bool_size(const igraph_vector_bool_t *v);
+    attach_function :igraph_vector_bool_size, [:pointer], :long_long
+
+    # bool igraph_vector_bool_get(const igraph_vector_bool_t *v, igraph_integer_t pos);
+    attach_function :igraph_vector_bool_get, %i[pointer long_long], :bool
+
+    # void igraph_vector_bool_set(igraph_vector_bool_t *v, igraph_integer_t pos, bool value);
+    attach_function :igraph_vector_bool_set, %i[pointer long_long bool], :void
+  end
+end

data/lib/igraph/libigraph.rb

@@ -0,0 +1,44 @@
+module IGraph
+  module LibIGraph
+    extend FFI::Library
+
+    begin
+      ffi_lib IGraph.lib_path
+    rescue LoadError => e
+      raise LoadError, "#{e}\nCould not find #{IGraph.lib_path}"
+    end
+
+    # @!macro attach_function
+    #   @!scope class
+    #   @!method $1(${2--2})
+    #   @return [${-1}] the return value of $0
+    def self.attach_function(*)
+      super
+    rescue FFI::NotFoundError => e
+      warn e.message if $VERBOSE
+    end
+
+    # IGRAPH_EXPORT void IGraphconst char **version_string,
+    #                                   int *major,
+    #                                   int *minor,
+    #                                   int *subminor);
+    attach_function :igraph_version, %i[pointer pointer pointer pointer], :void
+  end
+end
+
+# Load all binding modules
+require_relative "libigraph/constants"
+require_relative "libigraph/error"
+require_relative "libigraph/datatype"
+require_relative "libigraph/vector"
+require_relative "libigraph/matrix"
+require_relative "libigraph/constructors"
+require_relative "libigraph/interface"
+require_relative "libigraph/games"
+require_relative "libigraph/structural"
+require_relative "libigraph/paths"
+require_relative "libigraph/centrality"
+require_relative "libigraph/bipartite"
+require_relative "libigraph/topology"
+require_relative "libigraph/operators"
+require_relative "libigraph/transitivity"

data/lib/igraph/version.rb

@@ -0,0 +1,3 @@
+module IGraph
+  VERSION = "0.0.1"
+end

data/lib/igraph.rb

@@ -0,0 +1,50 @@
+require "ffi"
+
+require_relative "igraph/version"
+
+module IGraph
+  class Error < StandardError; end
+
+  class << self
+    attr_accessor :lib_path
+
+    def search_igraph(name = nil)
+      name ||= "libigraph.#{FFI::Platform::LIBSUFFIX}"
+      lib_path = if ENV["IGRAPHDIR"]
+                   File.expand_path(name, ENV["IGRAPHDIR"])
+                 else
+                   File.expand_path("../vendor/#{name}", __dir__)
+                 end
+      return lib_path if File.exist?(lib_path)
+
+      begin
+        require "pkg-config"
+        lib_dir = PKGConfig.variable("igraph", "libdir")
+        lib_path = File.expand_path(name, lib_dir)
+      rescue PackageConfig::NotFoundError
+        warn "igraph.pc was not found in the pkg-config search path."
+      end
+      return lib_path if File.exist?(lib_path)
+
+      warn "igraph shared library '#{name}' not found."
+    end
+
+    def search_igraph_windows
+      ENV["IGRAPHDIR"] ||= [
+        RubyInstaller::Runtime.msys2_installation.msys_path,
+        RubyInstaller::Runtime.msys2_installation.mingwarch
+      ].join(File::ALT_SEPARATOR)
+      path = File.expand_path("bin/libigraph.dll", ENV["IGRAPHDIR"])
+      RubyInstaller::Runtime.add_dll_directory(File.dirname(path))
+      path
+    end
+  end
+
+  self.lib_path = if Object.const_defined?(:RubyInstaller)
+                    search_igraph_windows
+                  else
+                    search_igraph
+                  end
+
+  autoload :LibIGraph, "igraph/libigraph"
+end

metadata

@@ -0,0 +1,86 @@
+--- !ruby/object:Gem::Specification
+name: ruby-igraph
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- kojix2
+bindir: bin
+cert_chain: []
+date: 1980-01-02 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: ffi
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: pkg-config
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+email:
+- 2xijok@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- README.md
+- lib/igraph.rb
+- lib/igraph/libigraph.rb
+- lib/igraph/libigraph/bipartite.rb
+- lib/igraph/libigraph/centrality.rb
+- lib/igraph/libigraph/constants.rb
+- lib/igraph/libigraph/constructors.rb
+- lib/igraph/libigraph/datatype.rb
+- lib/igraph/libigraph/error.rb
+- lib/igraph/libigraph/games.rb
+- lib/igraph/libigraph/interface.rb
+- lib/igraph/libigraph/matrix.rb
+- lib/igraph/libigraph/operators.rb
+- lib/igraph/libigraph/paths.rb
+- lib/igraph/libigraph/structural.rb
+- lib/igraph/libigraph/topology.rb
+- lib/igraph/libigraph/transitivity.rb
+- lib/igraph/libigraph/vector.rb
+- lib/igraph/version.rb
+licenses:
+- MIT
+metadata:
+  msys2_mingw_dependencies: igraph
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 3.2.0
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.6.9
+specification_version: 4
+summary: Library for the analysis of networks
+test_files: []