- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 1,737 for Nodes (0.07 sec)
-
guava/src/com/google/common/graph/AbstractNetwork.java
public abstract class AbstractNetwork<N, E> implements Network<N, E> { @Override public Graph<N> asGraph() { return new AbstractGraph<N>() { @Override public Set<N> nodes() { return AbstractNetwork.this.nodes(); } @Override public Set<EndpointPair<N>> edges() { if (allowsParallelEdges()) { return super.edges(); // Defer to AbstractGraph implementation. }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 13 18:17:09 UTC 2024 - 10.4K bytes - Viewed (0) -
src/internal/dag/alg.go
func (g *Graph) TransitiveReduction() { // For i -> j -> k, if i -> k exists, delete it. for _, i := range g.Nodes { for _, j := range g.Nodes { if g.HasEdge(i, j) { for _, k := range g.Nodes { if g.HasEdge(j, k) { g.DelEdge(i, k) } } } } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Aug 04 15:31:44 UTC 2022 - 1.3K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractBaseGraph.java
return InvalidatableSet.of( set, () -> nodes().contains(node), () -> String.format(NODE_REMOVED_FROM_GRAPH, node)); } protected final <T> Set<T> nodePairInvalidatableSet(Set<T> set, N nodeU, N nodeV) { return InvalidatableSet.of( set, () -> nodes().contains(nodeU) && nodes().contains(nodeV), () -> String.format(NODE_PAIR_REMOVED_FROM_GRAPH, nodeU, nodeV));
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 7.2K bytes - Viewed (0) -
guava/src/com/google/common/graph/EndpointPairIterator.java
* Visited Nodes = {N1} * EndpointPair [N2, N1] - skip * EndpointPair [N2, N3] - return * Visited Nodes = {N1, N2} * EndpointPair [N3, N1] - skip * EndpointPair [N3, N2] - skip * Visited Nodes = {N1, N2, N3} * EndpointPair [N4, N4] - return * Visited Nodes = {N1, N2, N3, N4} * </pre> */ private static final class Undirected<N> extends EndpointPairIterator<N> {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jul 09 17:31:04 UTC 2021 - 5K bytes - Viewed (0) -
cmd/kubeadm/app/phases/upgrade/health.go
err = wait.PollUntilContextTimeout(ctx, time.Second*1, timeout, true, func(_ context.Context) (bool, error) { nodes, err = client.CoreV1().Nodes().List(context.Background(), listOptions) if err != nil { klog.V(2).Infof("Could not list Nodes with field selector %q: %v", fieldSelector, err) lastError = err return false, nil } return true, nil }) if err != nil {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Apr 26 09:18:02 UTC 2024 - 8.8K bytes - Viewed (0) -
tensorflow/c/experimental/grappler/grappler.cc
TF_SetStatus(status, TF_OK, ""); const std::unordered_set<std::string>& nodes = reinterpret_cast<const tensorflow::grappler::GrapplerItem*>(item) ->NodesToPreserve(); *num_values = nodes.size(); *storage_size = 0; for (const std::string& str : nodes) { *storage_size += str.size(); } }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Sep 06 19:12:29 UTC 2023 - 15K bytes - Viewed (0) -
tensorflow/compiler/jit/extract_outside_compilation_pass.cc
} // Resets "_device_ordinal" attr to placeholder value for related nodes // (XlaRecvAtHost nodes; XlaSendFromHost nodes; If/While/FuncCall nodes // containing XlaRecvAtHost/XlaSendFromHost). Status ResetDeviceOrdinalToPlaceholderValue(Graph* g) { AttrValue device_ordinal_value; device_ordinal_value.set_placeholder("_device_ordinal"); for (Node* n : g->nodes()) { if (!HasNodeAttr(n->def(), kXlaHasHostTransferAttrName)) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 104.7K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/podtopologyspread/scoring_test.go
tests := []struct { name string pod *v1.Pod existingPods []*v1.Pod nodes []*v1.Node failedNodes []*v1.Node // nodes + failedNodes = all nodes objs []runtime.Object want framework.NodeScoreList enableNodeInclusionPolicy bool enableMatchLabelKeys bool }{
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Dec 15 03:30:06 UTC 2023 - 60K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractValueGraph.java
implements ValueGraph<N, V> { @Override public Graph<N> asGraph() { return new AbstractGraph<N>() { @Override public Set<N> nodes() { return AbstractValueGraph.this.nodes(); } @Override public Set<EndpointPair<N>> edges() { return AbstractValueGraph.this.edges(); } @Override public boolean isDirected() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 17 13:59:28 UTC 2023 - 4.3K bytes - Viewed (0) -
pkg/scheduler/internal/cache/snapshot_test.go
pods []*v1.Pod nodes []*v1.Node expectedNodesInfos []*framework.NodeInfo expectedNumNodes int expectedPodsWithAffinity int expectedPodsWithAntiAffinity int expectedUsedPVCSet sets.Set[string] }{ { name: "no pods no nodes", pods: nil, nodes: nil, }, { name: "single pod single node",
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jul 05 08:00:25 UTC 2023 - 12K bytes - Viewed (0)