We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Lex BFS is a variant of the breadth first search. It is used to detect whether a Graph is chordal. Both algorithms are described there :
http://en.wikipedia.org/wiki/Lexicographic_breadth-first_search
Nathann
Component: graph theory
Author: Nathann Cohen
Reviewer: Robert Miller
Merged: sage-4.3.rc1
Issue created by migration from https://trac.sagemath.org/ticket/7541
The text was updated successfully, but these errors were encountered:
Sorry, something went wrong.
Looks good!
changed successor to neighbor_out
Attachment: trac_7541.patch.gz
rlmill
No branches or pull requests
Lex BFS is a variant of the breadth first search. It is used to detect whether a Graph is chordal. Both algorithms are described there :
http://en.wikipedia.org/wiki/Lexicographic_breadth-first_search
Nathann
Component: graph theory
Author: Nathann Cohen
Reviewer: Robert Miller
Merged: sage-4.3.rc1
Issue created by migration from https://trac.sagemath.org/ticket/7541
The text was updated successfully, but these errors were encountered: