30raiigraph::Graph
edges_to_graph(
size_t double_edges,
const Vertex_* edges,
size_t num_vertices, igraph_bool_t directed) {
31 if constexpr(std::is_same<Vertex_, igraph_integer_t>::value) {
32 igraph_vector_int_t edge_view{};
33 igraph_vector_int_view(&edge_view, edges, double_edges);
34 return raiigraph::Graph(&edge_view, num_vertices, directed);
36 raiigraph::IntegerVector tmp(double_edges);
37 auto& payload = *(tmp.get());
38 for (
size_t x = 0; x < double_edges; ++x) {
39 VECTOR(payload)[x] = edges[x];
41 return raiigraph::Graph(tmp, num_vertices, directed);
raiigraph::Graph edges_to_graph(size_t double_edges, const Vertex_ *edges, size_t num_vertices, igraph_bool_t directed)
Definition edges_to_graph.hpp:30