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
Implement Bixby and Wagner's Almost Linear-Time Algorithm for Graph Realization #20834
Comments
Branch: u/tara/graphicness_test |
Commit: |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:8
Just a quick observation as I'm looking at the current code: the filename should be changed to reflect the actual authors of the algorithm. |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:10
Replying to @sagetrac-Stefan:
Yep. |
comment:11
Replying to @sagetrac-git:
I don't know how I introduced this runtime error. The function does need to be reworked to make sure that any of the edges in |
Changed branch from u/tara/graphicness_test to u/gh-neilthiessen/graphicness_test |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. This was a forced push. New commits:
|
comment:16
Remember to fill in your full name in the |
Currently, the plan is to create a new class for the decomposition,
and use this to rewrite the
is_graphic
function, so that we canreturn a graph that realizes the matroid.
CC: @sagetrac-Stefan @sagetrac-yomcat
Component: matroid theory
Branch/Commit: u/gh-neilthiessen/graphicness_test @
6332117
Issue created by migration from https://trac.sagemath.org/ticket/20834
The text was updated successfully, but these errors were encountered: