Eulerian Path:
An Euler path is a path that uses every edge in a graph with no repeats. Being a path, it does not have to return to the starting vertex.
Thank you for reading this post, don't forget to subscribe!If the path starts and ends at the same vertex, then it is called an Euler circuit.
Eulerian Circuit:
An Euler circuit is a circuit that uses every edge in a graph with no repeats. Being a circuit, it must start and end at the same vertex.
Hamiltonian Path:
A Hamiltonian path also visits every vertex once with no repeats, but does not have to start and end at the same vertex.
Hamiltonian Circuit:
A Hamiltonian circuit is a circuit that visits every vertex once with no repeats. Being a circuit, it must start and end at the same vertex.
