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

added pseudocode for fleury's algorithm #23

Conversation

abhi-jeet-kumar
Copy link
Collaborator

  • Added pseudocode for Fleury's algorithm

@iuliagroza
Copy link
Owner

iuliagroza commented Feb 26, 2024

Awesome and super clean implementation! 🔥

One nit (& optional) suggestion: There are indeed no rules defined for pseudocode syntax, however, other pseudocode implementations from this repo usually follow this syntax for for-loops (see Dijkstra.txt), where the step is defined and other stop conditions are separated by commas.

Feel free to proceed as you wish and merge this PR.

@abhi-jeet-kumar
Copy link
Collaborator Author

abhi-jeet-kumar commented Feb 26, 2024

Hey, I have made some changes again. re-review, please.
though for lines like for neighbor in G[current] I haven't made any changes to keep it simple.

Also, i cannot merge this PR because I don't have write access to your repo.

@abhi-jeet-kumar
Copy link
Collaborator Author

Got write access. Thanks @iuliagroza . I am merging this PR

@abhi-jeet-kumar abhi-jeet-kumar merged commit acc56e4 into iuliagroza:master Feb 26, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants