Mini-exam 2 over sections 3.1, 3.2, and chapter 4. 
<P>

Well-defined algorithms:
<ul>
<li>Breadth first search algorithm for</li>
<ul>
<li>Determining all reachable vertices from w.</li>

<li>Dijkstra's algorithm  for finding shortest paths from w to any other vertex.</li>
</ul>


<li>To find Euler tours</li>
<ul>
<li>Fleury</li>
<li>Hierholzer</li>
</ul>
<li>Chinese Postman Problem</li>


<li>Finding a Hamiltonian cycle in a tournament</li>

<li>Greedy algorithm for finding a Hamiltonian cycle or path - for special case when graph is a complete graph.</li>
</ul>



Partial algorithm:
<ul>
<li>Improving Hamiltonian path (example: 2-OPT) - for special case when graph is a complete graph.</li>
</ul>