Sign in
Contact us
MLOps
Product
Pricing
Learn
Resources
Case studies, videos, and reports
Docs
Platform technical documentation
Events
Webinars, talks, and trade shows
Blog
Try It For Free
Get Your Demo
MLOps
Product
Pricing
Learn
Resources
Case studies, videos, and reports
Docs
Platform technical documentation
Events
Webinars, talks, and trade shows
Blog
Sign In
Try it for Free
See a Demo
graph
/
EulerianCycle
/ 0.1.0
Star: 0
Follow: 1
Star: 0
Follow: 1
Overview
Docs
Discussion
Source Code
Docs
Overview
Docs
Discussion
Source Code
README.md
This algorithm will check whether a graph is Eulerian (hence it contains an Eulerian cycle), and if so, return a list of vertices making up the Eulerian cycle.
An Eulerian circuit is a circuit which traverses each edge exactly once.