langreiter.com plain, simple: 2002-03-05-factDuJour

LANGREITER.COM plain, simple

START

INDEX

2002-03-05-factDuJour

CREATED BY chris • LAST EDITED BY chris 8292 days AGO

Faktum du Jour: "We can know if a graph is traversable by looking at the number of even and odd nodes."

"There are many useful applications to Euler Circuits and [create Euler Path]s. In mathematics, networks can be used to solve many difficult problems, like the Königsberg Bridge problem. They can also be used to by mail carriers who want to have a route where they don't retrace any of their previous steps. Euler circuits and paths are also useful to painters, garbage collectors, airplane pilots and all world navigators, like you!"