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

            <root>
                <mxCell id="0"/>
                <mxCell id="1" parent="0"/>
                <mxCell id="2" value="" style="rounded=0;whiteSpace=wrap;html=1;fontStyle=1;strokeWidth=4;" parent="1" vertex="1">
                    <mxGeometry x="450" y="-50" width="820" height="970" as="geometry"/>
                </mxCell>

	// nameIdx maps a defined type or (canonical) type parameter to its
	// vertex index.
	nameIdx map[*TypeName]int
}

type monoVertex struct {
	weight int // weight of heaviest known path to this vertex
	pre    int // previous edge (if any) in the above path
	len    int // length of the above path

	// obj is the defined type or type parameter represented by this
	// vertex.
	obj *TypeName
}

type monoEdge struct {
	dst, src int

                            <mxPoint x="800" y="680"/>
                        </Array>
                    </mxGeometry>
                </mxCell>
                <mxCell id="33" value="" style="group" parent="1" vertex="1" connectable="0">
                    <mxGeometry x="-140" y="-75" width="500" height="350" as="geometry"/>
                </mxCell>

    }

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

	// nameIdx maps a defined type or (canonical) type parameter to its
	// vertex index.
	nameIdx map[*TypeName]int
}

type monoVertex struct {
	weight int // weight of heaviest known path to this vertex
	pre    int // previous edge (if any) in the above path
	len    int // length of the above path

	// obj is the defined type or type parameter represented by this
	// vertex.
	obj *TypeName
}

type monoEdge struct {
	dst, src int

java.util.List vertexList; public void DAG(); public java.util.List getVerticies(); public java.util.Set getLabels(); public Vertex addVertex(String); public void addEdge(String, String) throws CycleDetectedExcepti; public void addEdge(Vertex, Vertex) throws CycleDetectedExcepti; public void removeEdge(String, String); public void removeEdge(Vertex, Vertex); public Vertex getVertex(String); public boolean hasEdge(String, String); public java.util.List getChildLabels(String); public java.util.List...

		}
	}

	toString := func(id int) string {
		for _, namespaceName := range g.vertices {
			for _, nameVertex := range namespaceName {
				for _, vertex := range nameVertex {
					if vertex.id == id {
						return vertex.String()
					}
				}
			}
		}
		return ""
	}
	expectGraph := func(expect map[string][]string) {
		t.Helper()
		actual := map[string][]string{}

public String getMessage(); } org/codehaus/plexus/util/dag/Vertex.class package org.codehaus.plexus.util.dag; public synchronized class Vertex implements Cloneable, java.io.Serializable { private String label; java.util.List children; java.util.List parents; public void Vertex(String); public String getLabel(); public void addEdgeTo(Vertex); public void removeEdgeTo(Vertex); public void addEdgeFrom(Vertex); public void removeEdgeFrom(Vertex); public java.util.List getChildren(); public java.util.List...

		// skip adding objects that don't have owner references and aren't referred to.
		if len(node.dependents) == 0 && len(node.owners) == 0 {
			continue
		}
		vertex := NewDOTVertex(node)
		uidToVertex[node.identity.UID] = vertex
		nodes = append(nodes, vertex)
	}
	for _, node := range uidToNode {
		currVertex := uidToVertex[node.identity.UID]
		for _, ownerRef := range node.owners {