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.

Sign up for GitHub

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

Jump to bottom

Implement Girth #86

Open
markusbaumeister opened this issue Jun 25, 2018 · 1 comment
Open

Implement Girth #86

markusbaumeister opened this issue Jun 25, 2018 · 1 comment
Assignees
@ReymondAkpanya
Labels
design enhancement help wanted

Comments

@markusbaumeister
Copy link
Collaborator

A method to compute the girth should be implemented. This is the length of the shortest closed duplicate-free vertex-edge-path that does not run around triangles (for example: the boundary of a triangle does not count).

Variations: Also return the path. Return all of these paths.
@TomGoertzen
Copy link
Collaborator

Is this the shortest waist?

@ReymondAkpanya ReymondAkpanya self-assigned this Dec 19, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@ReymondAkpanya ReymondAkpanya

Labels
design enhancement help wanted
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@markusbaumeister @ReymondAkpanya @TomGoertzen