# ES242. Data Structures and Algorithms I. Week 04 Lab

## ES242. Data Structures and Algorithms I.

##### Lab 04

Theme: Graph Representations and Euler Tours

## List of Practice Problems

- Weird Journey - if you already know how to check if a graph is connected, go for this! Otherwise you could come back to it after learning BFS/DFS :)
- ROOKPATH - can you figure out how to model this problem as finding an Euler Tour?
- Mashtali: a Space Oddysey - at least one method of solving this question involves constructing an Euler tour (but it is less direct than the previous problem), revisit it once you have figured out how to.