expert-portfolio.jpg

expert_portfolio3.jpg

eq.jpg

Samuel Farkas - Showroom tab

recommends

Certain graph problems deal with finding a path between two vertices  such that each edge is traversed exactly once, or finding a path between  two vertices while visiting **each vertex** exactly once. These paths are better known as **Euler path** and **Hamiltonian path** respectively. 

The Euler path problem was first proposed in the 1700’s. 

**Euler paths and circuits :** 

- An Euler path is a path that uses every edge of a graph **exactly once**.
- An Euler circuit is a circuit that uses every edge of a graph exactly once.
- An Euler path starts and ends at different vertices.
- An Euler circuit starts and ends at the same vertex.


Samuel Farkas

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title

Placeholder Title