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

A simplicial complex has dimension equal to the size of its maximal s… #336

Merged
merged 6 commits into from
Jul 8, 2024

Commits on Feb 6, 2024

  1. A simplicial complex has dimension equal to the size of its maximal s…

    …et minus one. If, for example, a simplicial complex has dimension one, then, it has simplices of at most two vertices, with at least one having exactly two vertices. Currently, the method was graph_to_clique_complex was considering that the dimension of a simplex is exactly the number of vertices in it. This commit solves this problem. Also, it only copies the edge attributes from the networkx graph if the resulting simplicial complex has dimension greater or equal than one.
    rballeba committed Feb 6, 2024
    Configuration menu
    Copy the full SHA
    7ba5e1a View commit details
    Browse the repository at this point in the history
  2. Configuration menu
    Copy the full SHA
    512db58 View commit details
    Browse the repository at this point in the history
  3. Configuration menu
    Copy the full SHA
    8e97136 View commit details
    Browse the repository at this point in the history

Commits on Feb 16, 2024

  1. Configuration menu
    Copy the full SHA
    74e9431 View commit details
    Browse the repository at this point in the history

Commits on Jul 5, 2024

  1. Merge branch 'main' into main

    ffl096 committed Jul 5, 2024
    Configuration menu
    Copy the full SHA
    4ab6a45 View commit details
    Browse the repository at this point in the history

Commits on Jul 8, 2024

  1. Configuration menu
    Copy the full SHA
    000d4e0 View commit details
    Browse the repository at this point in the history