- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 179 for edge (0.04 sec)
-
android/guava/src/com/google/common/graph/PredecessorsFunction.java
@Beta @DoNotMock("Implement with a lambda, or use GraphBuilder to build a Graph with the desired edges") @ElementTypesAreNonnullByDefault public interface PredecessorsFunction<N> { /** * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing * {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.1K bytes - Viewed (0) -
src/main/webapp/WEB-INF/view/login/newpassword.jsp
<html> <head profile="http://a9.com/-/spec/opensearch/1.1/"> <meta charset="utf-8"> <meta name="viewport" content="width=device-width, initial-scale=1"> <meta http-equiv="X-UA-Compatible" content="IE=edge"> <title><la:message key="labels.login.title" /></title> <link href="${fe:url('/css/admin/bootstrap.min.css')}" rel="stylesheet" type="text/css" />
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Sat Oct 26 01:07:52 UTC 2024 - 3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
*/ @Beta @DoNotMock("Implement with a lambda, or use GraphBuilder to build a Graph with the desired edges") @ElementTypesAreNonnullByDefault public interface SuccessorsFunction<N> { /** * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing * {@code node}'s outgoing edges in the direction (if any) of the edge. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraphBuilder.java
* #from(ValueGraph)}. * @since 20.0 */ @Beta @ElementTypesAreNonnullByDefault public final class ValueGraphBuilder<N, V> extends AbstractGraphBuilder<N> { /** Creates a new instance with the specified edge directionality. */ private ValueGraphBuilder(boolean directed) { super(directed); } /** Returns a {@link ValueGraphBuilder} for building directed graphs. */
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Jun 03 01:21:31 UTC 2022 - 8K bytes - Viewed (0) -
guava/src/com/google/common/reflect/AbstractInvocationHandler.java
} private static boolean isProxyOfSameInterfaces(Object arg, Class<?> proxyClass) { return proxyClass.isInstance(arg) // Equal proxy instances should mostly be instance of proxyClass // Under some edge cases (such as the proxy of JDK types serialized and then deserialized) // the proxy type may not be the same. // We first check isProxyClass() so that the common case of comparing with non-proxy objects
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Jan 05 17:43:40 UTC 2022 - 5.2K 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) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 3.9K bytes - Viewed (0) -
guava/src/com/google/common/graph/PredecessorsFunction.java
@Beta @DoNotMock("Implement with a lambda, or use GraphBuilder to build a Graph with the desired edges") @ElementTypesAreNonnullByDefault public interface PredecessorsFunction<N> { /** * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing * {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.1K bytes - Viewed (0) -
tensorflow/c/c_api_function_test.cc
const tensorflow::FunctionDef& fdef, const std::vector<EdgeSpec>& e_edges, // expected edges const std::vector<EdgeSpec>& c_edges, // expected ctrl edges bool is_exact_edges = true) { // Build a set of edges from fdef std::set<EdgeSpec> a_edges; // actual edges // Get edges from inputs to body nodes and between body nodes for (const NodeDef& node_def : fdef.node_def()) {
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Thu Jul 20 22:08:54 UTC 2023 - 63.6K bytes - Viewed (0) -
src/main/webapp/WEB-INF/view/index.jsp
<html> <head profile="http://a9.com/-/spec/opensearch/1.1/"> <meta charset="utf-8"> <meta name="viewport" content="width=device-width, initial-scale=1"> <meta http-equiv="X-UA-Compatible" content="IE=edge"> <title><la:message key="labels.search_title" /></title> <c:if test="${osddLink}"> <link rel="search" type="application/opensearchdescription+xml" href="${fe:url('/osdd')}"
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Sat Oct 26 01:07:52 UTC 2024 - 6.9K bytes - Viewed (0) -
src/main/webapp/WEB-INF/view/profile/index.jsp
<html> <head profile="http://a9.com/-/spec/opensearch/1.1/"> <meta charset="utf-8"> <meta name="viewport" content="width=device-width, initial-scale=1"> <meta http-equiv="X-UA-Compatible" content="IE=edge"> <title><la:message key="labels.profile.title" /></title> <link href="${fe:url('/css/admin/bootstrap.min.css')}" rel="stylesheet" type="text/css" />
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Sat Oct 26 01:07:52 UTC 2024 - 3.6K bytes - Viewed (0)