quarkus/extensions/vertx-http/deployment/pom.xml
	quarkus/extensions/vertx/deployment/pom.xml
	quarkus/extensions/vertx-http/runtime/pom.xml
	quarkus/extensions/vertx-http/deployment-spi/pom.xml
	quarkus/extensions/mutiny/deployment/pom.xml
	quarkus/extensions/kubernetes/spi/pom.xml
	quarkus/extensions/vertx-http/dev-ui-spi/pom.xml
	quarkus/extensions/vertx-http/dev-ui-resources/pom.xml

            "junit5" : "org.junit.jupiter:junit-jupiter-engine:5.10.0",
            "kotlin": "org.jetbrains.kotlin:kotlin-stdlib:1.9.23",
            "testcontainers": "org.testcontainers:mysql:1.15.3",
            "vertx": "io.vertx:vertx-web:4.4.2",
            "keycloak": "org.keycloak:keycloak-core:24.0.1"
        ])
        .create()),

include::sample[dir="snippets/dependencyManagement/managingTransitiveDependencies-dependencyAlignment/groovy",files="build.gradle[tags=dependencies]"]
====

Because `vert.x` depends on `jackson-core`, we would actually resolve the following dependency versions:

- `jackson-core` version `2.9.5` (brought by `vertx-core`)
- `jackson-databind` version `2.9.5` (by conflict resolution)
- `jackson-annotation` version `2.9.0` (dependency of `jackson-databind:2.9.5`)

However, resolving the `runtimeClasspath` configuration would instead return `groovy 3.0.2`.

The reason for this is that a transitive dependency of `vertx`, which is a `runtimeOnly` dependency, brings a higher version of `groovy`.

		typedVertices[namespace] = namespacedVertices
	}

	vertex := newNamedVertex(vertexType, namespace, name, g.graph.NewNodeID())
	namespacedVertices[name] = vertex
	g.graph.AddNode(vertex)

	return vertex
}

// must be called under write lock
func (g *Graph) deleteVertex_locked(vertexType vertexType, namespace, name string) {
	vertex, exists := g.getVertex_rlocked(vertexType, namespace, name)
	if !exists {

    }

    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 {

    }

    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 {

        Map<String, Vertex> vertices = vertexMap.get(projectKey);

        if (vertices != null) {
            if (isSpecificVersion(version)) {
                Vertex vertex = vertices.get(version);
                if (vertex != null) {
                    addEdge(projectVertex, vertex, project, projectMap, force, safe);
                }
            } else {

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