Skip to content

Fix incorrect Euler path/cycle conditions and complexity statements#1

Open
RounakChoudhary wants to merge 1 commit into
vipul79321:mainfrom
RounakChoudhary:main
Open

Fix incorrect Euler path/cycle conditions and complexity statements#1
RounakChoudhary wants to merge 1 commit into
vipul79321:mainfrom
RounakChoudhary:main

Conversation

@RounakChoudhary

Copy link
Copy Markdown

This PR fixes several incorrect statements in the explanation of Euler paths and cycles.

Changes include:

  • Correct conditions for Euler path and Euler cycle in directed graphs
  • Correct conditions for Euler path/cycle in undirected graphs
  • Correct time complexity of Hierholzer's algorithm when using multiset adjacency
  • Clarified connectivity requirements
  • Minor wording improvements

These corrections align the documentation with standard graph theory definitions.

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.

1 participant