assertNotNull(res.getExcidentEdges(v1), "no edges in the resulting graph after resolver");

        assertEquals(4, res.getVertices().size(), "wrong # of vertices in the resulting graph after resolver");
        assertEquals(
                2,
                res.getExcidentEdges(v1).size(),
                "wrong # of excident edges in the resulting graph entry after resolver");

        }

        visited.add(from);

        List<MetadataGraphEdge> exitList = graph.getExcidentEdges(from);
        // String s = "|---> "+from.getMd().toString()+" - "+(exitList == null ? -1 : exitList.size()) + " exit links";
        if (exitList != null && exitList.size() > 0) {
            for (MetadataGraphEdge e : graph.getExcidentEdges(from)) {
                visit(e.getTarget(), visited, graph);
            }
        }

    }

    public List<MetadataGraphEdge> getIncidentEdges(MetadataGraphVertex vertex) {
        checkEdges();
        return incidentEdges.get(vertex);
    }

    public List<MetadataGraphEdge> getExcidentEdges(MetadataGraphVertex vertex) {
        checkEdges();
        return excidentEdges.get(vertex);
    }

    public boolean isVersionedVertices() {
        return versionedVertices;
    }

            //                            }
            //                        }
            //                    );

            List<MetadataGraphEdge> exits = graph.getExcidentEdges(node);

            if (exits != null && exits.size() > 0) {
                MetadataGraphEdge[] sortedExits = exits.toArray(new MetadataGraphEdge[0]);
                Arrays.sort(sortedExits, (e1, e2) -> {