Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 11 - 15 of 15 for addEdges (0.04 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. impl/maven-core/src/main/java/org/apache/maven/internal/impl/Graph.java

        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 {
            from.children.add(to);
            to.parents.add(from);
            List<String> cycle = findCycle(to);
            if (cycle != null) {
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Fri Oct 25 12:31:46 GMT 2024
    - 4.6K bytes
    - Click Count (0)
  2. compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraph.java

            {
                ArtifactMetadata md = node.getMd();
                MetadataGraphEdge e =
                        new MetadataGraphEdge(md.version, md.resolved, md.artifactScope, md.artifactUri, depth, pomOrder);
                addEdge(parentVertex, vertex, e);
            } else {
                entry = vertex;
            }
    
            MetadataTreeNode[] kids = node.getChildren();
            if (kids == null || kids.length < 1) {
                return;
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Wed Jul 23 17:27:08 GMT 2025
    - 13K bytes
    - Click Count (0)
  3. compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolver.java

                        MetadataGraphVertex newV = res.addVertex(newMd);
                        MetadataGraphVertex sourceV = res.addVertex(edge.getSource().getMd());
    
                        res.addEdge(sourceV, newV, edge);
                    }
                }
                return findLinkedSubgraph(res);
            } catch (MetadataResolutionException e) {
                throw new GraphConflictResolutionException(e);
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Wed Jul 23 17:27:08 GMT 2025
    - 7.4K bytes
    - Click Count (0)
  4. guava-tests/test/com/google/common/graph/TraverserTest.java

        MutableNetwork<String, Integer> network = NetworkBuilder.directed().build();
        network.addEdge("a", "b", 11);
    
        Traverser.forTree(network); // Does not throw
      }
    
      @Test
      public void forTree_withUndirectedNetwork_throws() throws Exception {
        MutableNetwork<String, Integer> network = NetworkBuilder.undirected().build();
        network.addEdge("a", "b", 11);
    
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Sep 30 17:09:51 GMT 2025
    - 47.4K bytes
    - Click Count (2)
  5. impl/maven-core/src/test/remote-repo/org/codehaus/plexus/plexus-utils/1.1/plexus-utils-1.1.jar

    java.io.Serializable { private java.util.Map vertexMap; private 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...
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Fri Oct 25 12:31:46 GMT 2024
    - 164.6K bytes
    - Click Count (0)
Back to Top