- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 113 for Edge (0.12 sec)
-
guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
static final String ERROR_ADDED_SELF_LOOP = "Should not be allowed to add a self-loop edge."; static final String ERROR_ADDED_PARALLEL_EDGE = "Should not be allowed to add a parallel edge."; static final String ERROR_ADDED_EXISTING_EDGE = "Reusing an existing edge to connect different nodes succeeded"; /** Creates and returns an instance of the graph to be tested. */
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 33K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
static final String ERROR_ADDED_SELF_LOOP = "Should not be allowed to add a self-loop edge."; static final String ERROR_ADDED_PARALLEL_EDGE = "Should not be allowed to add a parallel edge."; static final String ERROR_ADDED_EXISTING_EDGE = "Reusing an existing edge to connect different nodes succeeded"; /** Creates and returns an instance of the graph to be tested. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 32.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
/** * Returns the nodes which are the endpoints of {@code edge} in this network. * * @throws IllegalArgumentException if {@code edge} is not an element of this network */ EndpointPair<N> incidentNodes(E edge); /** * Returns a live view of the edges which have an {@link #incidentNodes(Object) incident node} in * common with {@code edge}. An edge is not considered adjacent to itself. *
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) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
() -> networkAsMutableNetwork.addEdge(N1, N2, EDGE_NOT_IN_GRAPH)); assertThat(e).hasMessageThat().contains(ERROR_PARALLEL_EDGE); e = assertThrows( IllegalArgumentException.class, () -> networkAsMutableNetwork.addEdge(N2, N1, EDGE_NOT_IN_GRAPH)); assertThat(e).hasMessageThat().contains(ERROR_PARALLEL_EDGE); } @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) -
maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolverTest.java
"wrong edge v1-v2 in the resulting graph after resolver"); assertEquals( 1, res.getIncidentEdges(v3).size(), "wrong # of edges v1-v3 in the resulting graph after resolver"); assertEquals( "1.1", res.getIncidentEdges(v3).get(0).getVersion(), "wrong edge v1-v3 in the resulting graph after resolver");
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu Apr 25 05:46:50 GMT 2024 - 8.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TestUtil.java
static final String ERROR_ELEMENT_REMOVED = "used to generate this set"; private static final String NODE_STRING = "Node"; private static final String EDGE_STRING = "Edge"; enum EdgeType { UNDIRECTED, DIRECTED; } private TestUtil() {} static void assertNodeNotInGraphErrorMessage(Throwable throwable) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TestUtil.java
static final String ERROR_ELEMENT_REMOVED = "used to generate this set"; private static final String NODE_STRING = "Node"; private static final String EDGE_STRING = "Edge"; enum EdgeType { UNDIRECTED, DIRECTED; } private TestUtil() {} static void assertNodeNotInGraphErrorMessage(Throwable throwable) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardNetwork.java
} return connections; } final N checkedReferenceNode(E edge) { N referenceNode = edgeToReferenceNode.get(edge); if (referenceNode == null) { checkNotNull(edge); throw new IllegalArgumentException(String.format(EDGE_NOT_IN_GRAPH, edge)); } return referenceNode; } final boolean containsNode(N node) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.9K bytes - Viewed (0) -
.github/actions/people/app/main.py
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 ) return discussion_nodes def get_discussions_experts(
Python - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Tue Mar 26 17:38:21 GMT 2024 - 19.2K bytes - Viewed (1) -
android/guava/src/com/google/common/graph/GraphConstants.java
static final String EDGE_ALREADY_EXISTS = "Edge %s already exists in the graph."; static final String ENDPOINTS_MISMATCH = "Mismatch: endpoints' ordering is not compatible with directionality of the graph"; /** Singleton edge value for {@link Graph} implementations backed by {@link ValueGraph}s. */ enum Presence { EDGE_EXISTS }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.1K bytes - Viewed (0)