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

Adding LexDFS and LexBFS #13

Open
ekanshjha opened this issue Dec 21, 2018 · 2 comments
Open

Adding LexDFS and LexBFS #13

ekanshjha opened this issue Dec 21, 2018 · 2 comments

Comments

@ekanshjha
Copy link

It'll be awesome to see the implementation for lexicographically DFS and BFS.
@rafalk342
Copy link

It's actually quite simple to implement LexDFS in O(min(n^2, n+mloglog(n))).
It can also be implemented in linear time for cocomparability graphs as described here:
https://arxiv.org/pdf/1404.5996.pdf

@Dhairysheel-Deshmukh
Copy link

I would like to implement lex DFS and Lex BFS

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@rafalk342 @ekanshjha @Dhairysheel-Deshmukh