- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 309 for graphs (0.67 sec)
-
android/guava-tests/test/com/google/common/graph/EndpointPairTest.java
// ordered endpoints not compatible with undirected graph assertThat(edges).doesNotContain(EndpointPair.ordered(N1, N2)); assertThat(edges).doesNotContain(EndpointPair.unordered(N2, N2)); // edge not present assertThat(edges).doesNotContain(EndpointPair.unordered(N3, N4)); // nodes not in graph } @Test public void endpointPair_directed_contains() {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 9.5K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractUndirectedNetworkConnections.java
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ package com.google.common.graph; import static com.google.common.base.Preconditions.checkNotNull; import static com.google.common.base.Preconditions.checkState; import static java.util.Objects.requireNonNull; import java.util.Collections;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 2.7K bytes - Viewed (0) -
compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraphEdge.java
* under the License. */ package org.apache.maven.repository.metadata; import org.apache.maven.artifact.ArtifactScopeEnum; /** * metadata graph edge - combination of version, scope and depth define * an edge in the graph * * */ @Deprecated public class MetadataGraphEdge { String version; ArtifactScopeEnum scope; int depth = -1; int pomOrder = -1;
Registered: Sun Sep 07 03:35:12 UTC 2025 - Last Modified: Fri Jan 10 08:42:00 UTC 2025 - 4.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EndpointPair.java
return new Unordered<>(nodeV, nodeU); } /** Returns an {@link EndpointPair} representing the endpoints of an edge in {@code graph}. */ static <N> EndpointPair<N> of(Graph<?> graph, N nodeU, N nodeV) { return graph.isDirected() ? ordered(nodeU, nodeV) : unordered(nodeU, nodeV); } /** Returns an {@link EndpointPair} representing the endpoints of an edge in {@code network}. */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 8.1K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/sso/aad/AzureAdAuthenticator.java
processMemberOf(user, groupList, roleList, "https://graph.microsoft.com/v1.0/me/memberOf"); user.setGroups(groupList.stream().distinct().toArray(n -> new String[n])); user.setRoles(roleList.stream().distinct().toArray(n -> new String[n])); } /** * Processes member-of information from Microsoft Graph API. * @param user The Azure AD user.
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Aug 28 09:13:08 UTC 2025 - 37.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/TreeTraverser.java
* * {@snippet : * TreeTraverser<NodeType> traverser = TreeTraverser.using(node -> node.getChildNodes()); * } * * @author Louis Wasserman * @since 15.0 * @deprecated Use {@link com.google.common.graph.Traverser} instead. All instance methods have * their equivalent on the result of {@code Traverser.forTree(tree)} where {@code tree} * implements {@code SuccessorsFunction}, which has a similar API as {@link #children} or can be
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 8.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/UndirectedMultiNetworkConnections.java
* See the License for the specific language governing permissions and * limitations under the License. */ package com.google.common.graph; import static com.google.common.base.Preconditions.checkState; import static com.google.common.graph.GraphConstants.INNER_CAPACITY; import static com.google.common.graph.GraphConstants.INNER_LOAD_FACTOR; import com.google.common.collect.HashMultiset; import com.google.common.collect.ImmutableMap;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 3.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/package-info.java
* limitations under the License. */ /** * An API for representing graph (node and edge) data. It is analogous to the Java Collections * Framework APIs for lists, maps, sets, etc. * * <p>This package is a part of the open-source <a href="https://github.com/google/guava">Guava</a> * library. */ @CheckReturnValue @NullMarked package com.google.common.graph; import com.google.errorprone.annotations.CheckReturnValue;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Dec 21 14:50:24 UTC 2024 - 1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/DefaultNetworkImplementationsTest.java
*/ package com.google.common.graph; import static com.google.common.graph.TestUtil.EdgeType.DIRECTED; import static com.google.common.graph.TestUtil.EdgeType.UNDIRECTED; import static com.google.common.graph.TestUtil.assertNodeNotInGraphErrorMessage; import static com.google.common.truth.Truth.assertThat; import static org.junit.Assert.assertThrows; import com.google.common.graph.TestUtil.EdgeType; import java.util.Arrays;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 7.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeTraverser.java
* * {@snippet : * TreeTraverser<NodeType> traverser = TreeTraverser.using(node -> node.getChildNodes()); * } * * @author Louis Wasserman * @since 15.0 * @deprecated Use {@link com.google.common.graph.Traverser} instead. All instance methods have * their equivalent on the result of {@code Traverser.forTree(tree)} where {@code tree} * implements {@code SuccessorsFunction}, which has a similar API as {@link #children} or can be
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 8.3K bytes - Viewed (0)