addEdge(projectVertex, vertex, project, projectMap, force, safe);
                }
            }
        }
    }

    private void addEdge(
            Vertex fromVertex,
            Vertex toVertex,
            MavenProject fromProject,
            Map<String, MavenProject> projectMap,
            boolean force,
            boolean safe)

    }

    final Map<String, Vertex> vertices = new LinkedHashMap<>();

    public Vertex getVertex(String id) {
        return vertices.get(id);
    }

    public Collection<Vertex> getVertices() {
        return vertices.values();
    }

    Vertex addVertex(String label) {
        return vertices.computeIfAbsent(label, Vertex::new);
    }

    void addEdge(Vertex from, Vertex to) throws CycleDetectedException {

        return vertices;
    }

    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;
    }

    static void addEdge(Graph graph, String v1, String v2) throws CycleDetectedException {
        Vertex vx1 = graph.addVertex(v1);
        Vertex vx2 = graph.addVertex(v2);
        graph.addEdge(vx1, vx2);
    }

    static boolean hasEdge(Graph graph, String v1, String v2) {
        Vertex vx1 = graph.getVertex(v1);
        Vertex vx2 = graph.getVertex(v2);
        return vx1 != null && vx2 != null && vx1.children.contains(vx2);

    }

    final Map<String, Vertex> vertices = new LinkedHashMap<>();

    public Vertex getVertex(String id) {
        return vertices.get(id);
    }

    public Collection<Vertex> getVertices() {
        return vertices.values();
    }

    Vertex addVertex(String label) {
        return vertices.computeIfAbsent(label, Vertex::new);
    }

    void addEdge(Vertex from, Vertex to) throws CycleDetectedException {

    }

    // ---------------------------------------------------------------------
    public int compareTo(MetadataGraphVertex vertex) {
        if (vertex == null || vertex.getMd() == null) {
            return 1;
        }

        ArtifactMetadata vmd = vertex.getMd();

        if (vmd == null) {
            if (md == null) {
                return 0;
            } else {
                return 1;

            return null; // no edges - nothing to worry about
        }

        final TreeSet<MetadataGraphVertex> vertices = graph.getVertices();

        try {
            // edge case - single vertex graph
            if (vertices.size() == 1) {
                return new MetadataGraph(entry);
            }

            final ArtifactScopeEnum requestedScope = ArtifactScopeEnum.checkScope(scope);

                    }
                    cycle.removeLast();
                    stateMap.put(v, DfsState.VISITED);
                } else if (state == DfsState.VISITING) {
                    // we are already visiting this vertex, this mean we have a cycle
                    int pos = cycle.lastIndexOf(v);
                    List<String> ret = cycle.subList(pos, cycle.size());
                    ret.add(v);
                    return ret;

kvarhelst
kven
kvi
kvifor
me
medan
mi
mine
mykje
no
nokon
noka
nokor
noko
nokre
si
sia
sidan
so
somt
somme
um
upp
vere
vore
verte
vort
varte

müssen Sie ein Modell haben, dessen Attribute alle als optional gekennzeichnet sind (mit Defaultwerten oder `None`).

    Um zu unterscheiden zwischen Modellen für **Aktualisierungen**, mit lauter optionalen Werten, und solchen für die **Erzeugung**, mit benötigten Werten, können Sie die Techniken verwenden, die in [Extramodelle](extra-models.md){.internal-link target=_blank} beschrieben wurden....