public boolean isFound() {
        return found;
    }
@Test
    public void testCalcEdgeKeyDetailsBackward() {
        Weighting weighting = new SpeedWeighting(carAvSpeedEnc);
        Path p = new Dijkstra(pathDetailGraph, weighting, TraversalMode.NODE_BASED).calcPath(5, 1);
        assertTrue(p.isFound());

        Map<String, List<PathDetail>> details = PathDetailsFromEdges.calcDetails(p, carManager, weighting,
                List.of(EDGE_KEY), new PathDetailsBuilderFactory(), 0, pathDetailGraph);
        List<PathDetail> edgeKeyDetails = details.get(EDGE_KEY);

        assertEquals(4, edgeKeyDetails.size());
        assertEquals(3, edgeKeyDetails.get(0).getValue());
        assertEquals(7, edgeKeyDetails.get(1).getValue());
        assertEquals(5, edgeKeyDetails.get(2).getValue());
        assertEquals(1, edgeKeyDetails.get(3).getValue());
    }