| Display title | Hierholzer's algorithm |
| Default sort key | Hierholzer's algorithm |
| Page length (in bytes) | 24,881 |
| Namespace ID | 0 |
| Page ID | 20729 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 1 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Page views in the past month | 0 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | Aspen138 (talk | contribs) |
| Date of page creation | 03:55, 24 November 2024 |
| Latest editor | Petelomax (talk | contribs) |
| Date of latest edit | 23:52, 25 November 2024 |
| Total number of edits | 25 |
| Recent number of edits (within past 180 days) | 25 |
| Recent number of distinct authors | 8 |
| Hidden category (1) | This page is a member of a hidden category:
|
| Transcluded templates (8) | Templates used on this page:
|
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Description Hierholzer's Algorithm is an efficient way to find Eulerian circuits in a graph. Task Implement the Hierholze's Algorithm in your language and test... |
