Find shortest path between two nodes using BFS on the undirected graph. Returns the path as a list of NodeIds including start and end. Returns listOf(from) when from == to. Returns an empty list when no path exists.
listOf(from)