Free tools
Run it. Get results.
Free tools for networks, security, maps, money, maths and more. No sign-up, nothing to install.
No tool matches that. Try another word.
Network tools
DNS tools
Security tools
Developer tools
Math tools
Discrete mathematics
Food & drink
Everyday tools
Money tools
Space tools
Science tools
About the Euler path & circuit solver
An Euler path and circuit solver: whether a graph has a route using every edge exactly once, and the route itself (Hierholzer's algorithm), numbered on the drawing; plus Euler's totient φ(n), Euler's theorem and Euler's formula V − E + F = 2.
How to use it
- Type the edges, e.g. A-B, B-C, C-A.
- Read whether there's an Euler path or circuit, and the route.
- Or switch to the totient and theorem, or to V − E + F = 2.
Questions
When does a graph have an Euler circuit?
When it's connected and every vertex has an even degree. With exactly two odd-degree vertices it has an Euler path between them.
What is Euler's theorem?
If a and n share no factor, a^φ(n) ≡ 1 (mod n), where φ(n) counts the numbers up to n coprime with n.
Logligent
Is your computer or server being attacked right now?
These tools answer one question at a time. Logligent watches your devices around the clock, and tells you the moment something isn't right.
- Every log line read as it arrives: brute force, web attacks, attack tools, malware and break-ins found and explained in plain words.
- Attackers blocked: by hand, automatically, or with the community blocklist of addresses attacking other customers.
- Security and health scores: for each device, with what to fix first.
- Told when something's wrong: a device stops reporting, a disk fills up, a new threat appears.
- Servers and personal computers: Linux, Windows, macOS and FreeBSD, with one small Collector.
Install in a minute (Linux, macOS, FreeBSD):
curl -fsSL https://logligent.com/install.sh | sudo sh -s -- --key lgk_…
Free plan, no credit card. Read the docs