Given a network graph in the graph project, construct a route from a sender to a receiver.

The route will need to consider per-hop fees, disabled status, and capacity. The default implementation should seek to minimize routing fees along the path.

The function should return a list of short channel IDs for the path.