Does the eulerian-path find all possible cycles?

Open
#883 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
25/100
Issue type
Feature
Clarity
Needs clarification
Activity status
Stale
Tech stack
javascript
Domain
data

Research direction

Start by reading the hamiltonian-cycle module and the eulerian path module to compare what each currently returns. Determine whether the Eulerian implementation enumerates all possible cycles, and define the expected result and coverage needed before considering the change complete.

Written by the indexing model from the issue text.

Description

It appears the hamiltonian-cycle module finds all possible cycles. Does the eulerian path module find all possible cycles, or just one? If not, how would you modify it to find all possible cycles? I would like to try and redo this Hamiltonian cycle de Bruijn sequence finder using Eulerian paths instead :). Thank you for all your work on this!

Dominant language
JavaScript
Stars
197k
Forks
31k
PR merge metrics
No merged PRs in 30d

Contributor guide

Open the contributing guide

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from trekhleb/javascript-algorithms

All issues in trekhleb/javascript-algorithms

Similar issues

More JavaScript issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.