pub fn shortest_path( graph: &CodeGraph, from: u64, to: u64, edge_types: &[EdgeType], ) -> Option<Vec<u64>>
Find the shortest path between two nodes using BFS.
Returns None if no path exists.
None