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

        Map<String, List<PathDetail>> details = PathDetailsFromEdges.calcDetails(p, carManager, weighting,
                List.of(INTERSECTION), new PathDetailsBuilderFactory(), 0, pathDetailGraph);
        assertEquals(1, details.size());

        List<PathDetail> intersectionDetails = details.get(INTERSECTION);
        assertEquals(4, intersectionDetails.size());

        Map<String, Object> intersectionMap = new HashMap<>();
        intersectionMap.put("out", 0);
        intersectionMap.put("entries", List.of(true));
        intersectionMap.put("bearings", List.of(90));

        assertEquals(intersectionMap, intersectionDetails.get(0).getValue());

        intersectionMap.clear();
        intersectionMap.put("out", 0);
        intersectionMap.put("in", 1);
        intersectionMap.put("entries", List.of(true, false));
        intersectionMap.put("bearings", List.of(90, 270));

        assertEquals(intersectionMap, intersectionDetails.get(1).getValue());
    }