import java.util.List;

public interface Courier {

    double[][] findShortestPaths(double[][] adjacency);

    List<Order> maximizeProfit(double[][] paths, List<Order> orders, int home);

}