- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 44 for Geddes (0.21 sec)
-
maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraph.java
List<MetadataGraphEdge> edges = getIncidentEdges(vTo); if (edges == null || edges.isEmpty()) { return null; } List<MetadataGraphEdge> res = new ArrayList<>(edges.size()); for (MetadataGraphEdge e : edges) { if (e.getSource().equals(vFrom)) { res.add(e); }
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Thu Oct 05 18:41:13 GMT 2023 - 13.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
} @Override @Test public void edges_checkReturnedSetMutability() { Set<String> edges = network.edges(); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> edges.add(E12)); addEdge(N1, N2, E12); assertThat(network.edges()).containsExactlyElementsIn(edges); } @Override @Test
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 19.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
} @Override @Test public void edges_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); Set<String> edges = network.edges(); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> edges.add(E12)); addEdge(N1, N2, E12); assertThat(network.edges()).containsExactlyElementsIn(edges); } @Override @Test
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
&& network.allowsParallelEdges() && network.edges().size() > network.asGraph().edges().size()) { return true; } return hasCycle(network.asGraph()); } /** * Performs a traversal of the nodes reachable from {@code node}. If we ever reach a node we've * already visited (following only outgoing edges and without reusing edges), we know there's a * cycle in the graph. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
return AbstractNetwork.this.nodes(); } @Override public Set<EndpointPair<N>> edges() { if (allowsParallelEdges()) { return super.edges(); // Defer to AbstractGraph implementation. } // Optimized implementation assumes no parallel edges (1:1 edge to EndpointPair mapping). return new AbstractSet<EndpointPair<N>>() { @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Mar 13 18:17:09 GMT 2024 - 10.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
} @Override @Test public void edges_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); Set<String> edges = network.edges(); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> edges.add(E12)); addEdge(N1, N2, E12); assertThat(network.edges()).containsExactlyElementsIn(edges); } @Override @Test
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* <li>graphs that do/don't allow self-loops * <li>graphs whose nodes/edges are insertion-ordered, sorted, or unordered * <li>graphs whose edges have associated values * </ul> * * <p>{@code ValueGraph}, as a subtype of {@code Graph}, explicitly does not support parallel edges, * and forbids implementations or extensions with parallel edges. If you need parallel edges, use
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
} @Override @Test public void edges_checkReturnedSetMutability() { Set<String> edges = network.edges(); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> edges.add(E12)); addEdge(N1, N2, E12); assertThat(network.edges()).containsExactlyElementsIn(edges); } @Override @Test
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 18.9K bytes - Viewed (0) -
.github/actions/people/app/main.py
discussion_nodes: List[DiscussionsNode] = [] discussion_edges = get_graphql_question_discussion_edges(settings=settings) while discussion_edges: for discussion_edge in discussion_edges: discussion_nodes.append(discussion_edge.node) last_edge = discussion_edges[-1] discussion_edges = get_graphql_question_discussion_edges( settings=settings, after=last_edge.cursor )
Python - Registered: Sun Apr 28 07:19:10 GMT 2024 - Last Modified: Tue Mar 26 17:38:21 GMT 2024 - 19.2K bytes - Viewed (1) -
android/guava/src/com/google/common/graph/Network.java
* terms</a>): * * <ul> * <li>directed graphs * <li>undirected graphs * <li>graphs that do/don't allow parallel edges * <li>graphs that do/don't allow self-loops * <li>graphs whose nodes/edges are insertion-ordered, sorted, or unordered * <li>graphs whose edges are unique objects * </ul> * * <h3>Building a {@code Network}</h3> *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 21.1K bytes - Viewed (0)