Problem $4$

Task: Consider all pairs $($n$1,$ n$2)$ of nodes that are both blue, and that have a path of length $1$ or more from n$1$ to n$2.$ Find the lengths of the shortest and longest paths between n$1$ and n$2.$ Your result should have four columns: n$1,$ n$2,$ the length of the shortest path, and the length of the longest path. Sort by n$1,$ then n$2.$

Problem $5$

Task: Find all pairs $($n$1,$ n$2)$ such that n$1$ is yellow, and there is a path of length $1$ or more from n$1$ to n$2$ that alternates yellow and blue nodes. Sort by n$1,$ then n$2.$

I'll start working on the SQL queries for these problems using recursive WITH statements in SQLite.