Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for addEdge (0.03 sec)

  1. 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;
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Wed Jul 23 17:27:08 UTC 2025
    - 13K bytes
    - Viewed (0)
  2. 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);
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Wed Jul 23 17:27:08 UTC 2025
    - 7.4K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/graph/Graphs.java

          for (E edge : network.outEdges(node)) {
            N successorNode = network.incidentNodes(edge).adjacentNode(node);
            if (subgraph.nodes().contains(successorNode)) {
              subgraph.addEdge(node, successorNode, edge);
            }
          }
        }
        return subgraph;
      }
    
      /** Creates a mutable copy of {@code graph} with the same nodes and edges. */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 22.7K bytes
    - Viewed (0)
  4. guava/src/com/google/common/graph/Graphs.java

          for (E edge : network.outEdges(node)) {
            N successorNode = network.incidentNodes(edge).adjacentNode(node);
            if (subgraph.nodes().contains(successorNode)) {
              subgraph.addEdge(node, successorNode, edge);
            }
          }
        }
        return subgraph;
      }
    
      /** Creates a mutable copy of {@code graph} with the same nodes and edges. */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 23.3K bytes
    - Viewed (0)
Back to top