Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update graph concept to avoid compile error when failing #9

Draft
wants to merge 3 commits into
base: master
Choose a base branch
from

Conversation

BenBrock
Copy link

No description provided.

@@ -85,7 +85,7 @@ class index_adjacency : public unipartite_graph_base, public indexed_struct_of_a
* @brief Constructor of index_adjacency. Require the type of the graph to be unipartite.
* Create an empty index_adjacency.
*/
index_adjacency(std::array<size_t, 1> N, size_t M = 0) requires(std::is_same<unipartite_graph_base, unipartite_graph_base>::value) : unipartite_graph_base(N), base(N[0], M) {}
index_adjacency(std::array<size_t, 1> N, size_t M = 0) requires(std::is_same<unipartite_graph_base, unipartite_graph_base>::value) : unipartite_graph_base(N[0]), base(N[0], M) {}
Copy link
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Hi @lums658 , should unipartite_graph_base be accepting N[0] here instead of an array? I don't see a constructor that accepts a range, only an integer.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant