DOTD: Eulerian Walk

15 Apr 2016

An Eulerian walk through a graph visits each edge exactly once.

Share on Facebook
Share on Twitter
Share on LinkedIn
Please reload

Please reload

Related Posts
PhDomics by Fatima