Match

Hamiltonian Path

visits every vertex exactly once.

Space complexity of adjacency matrix is

$O(n^2)$

Eulerian Path

Space complexity of adjacency list is

visits every edge exactly once.$|$

$O(n+m)$