- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 265 for Edges (0.04 sec)
-
src/cmd/vendor/github.com/google/pprof/internal/graph/graph.go
} // edgeEntropyScore computes the entropy value for a set of edges // coming in or out of a node. Entropy (as defined in information // theory) refers to the amount of information encoded by the set of // edges. A set of edges that have a more interesting distribution of // samples gets a higher score. func edgeEntropyScore(n *Node, edges EdgeMap, self int64) float64 { score := float64(0) total := self
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 31K bytes - Viewed (0) -
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); }
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Thu Oct 05 18:41:13 UTC 2023 - 13.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/StandardImmutableGraphAdditionalTest.java
assertThat(graph.nodes()).containsExactly("A"); assertThat(graph.edges()).isEmpty(); } @Test public void immutableGraphBuilder_putEdgeFromNodes() { ImmutableGraph<String> graph = GraphBuilder.directed().<String>immutable().putEdge("A", "B").build(); assertThat(graph.nodes()).containsExactly("A", "B"); assertThat(graph.edges()).containsExactly(EndpointPair.ordered("A", "B")); } @Test
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Jan 09 20:24:43 UTC 2020 - 4.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/StandardImmutableGraphAdditionalTest.java
assertThat(graph.nodes()).containsExactly("A"); assertThat(graph.edges()).isEmpty(); } @Test public void immutableGraphBuilder_putEdgeFromNodes() { ImmutableGraph<String> graph = GraphBuilder.directed().<String>immutable().putEdge("A", "B").build(); assertThat(graph.nodes()).containsExactly("A", "B"); assertThat(graph.edges()).containsExactly(EndpointPair.ordered("A", "B")); } @Test
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Jan 09 20:24:43 UTC 2020 - 4.5K bytes - Viewed (0) -
tensorflow/compiler/jit/xla_cluster_util.cc
// * replace edges to "Enter" nodes, and edges from "Exit" nodes with edges // to/from the corresponding frame node. In essence, we collapse the loop // into a single node for the purpose of cycle detection in the enclosing // graph. // * the body of the loop should now be disconnected from the rest of the // graph; we make it acyclic by breaking loop backedges (edges outgoing from // "NextIteration" nodes.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 29 08:39:39 UTC 2024 - 21.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/trim.go
// These blocks were inserted to remove critical edges. func trim(f *Func) { n := 0 for _, b := range f.Blocks { if !trimmableBlock(b) { f.Blocks[n] = b n++ continue } bPos := b.Pos bIsStmt := bPos.IsStmt() == src.PosIsStmt // Splice b out of the graph. NOTE: `mergePhi` depends on the // order, in which the predecessors edges are merged here. p, i := b.Preds[0].b, b.Preds[0].i
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 4.2K bytes - Viewed (0) -
src/runtime/mklockrank.go
var b bytes.Buffer g.TransitiveReduction() // Add cyclic edges for visualization. for k := range cyclicRanks { g.AddEdge(k, k) } // Reverse the graph. It's much easier to read this as // a "<" partial order than a ">" partial order. This // ways, locks are acquired from the top going down // and time moves forward over the edges instead of // backward. g.Transpose() generateDot(&b, g)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:47:01 UTC 2024 - 9.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/ImmutableNetworkTest.java
assertThat(network.edges()).isEmpty(); } @Test public void immutableNetworkBuilder_putEdgeFromNodes() { ImmutableNetwork<String, Integer> network = NetworkBuilder.directed().<String, Integer>immutable().addEdge("A", "B", 10).build(); assertThat(network.nodes()).containsExactly("A", "B"); assertThat(network.edges()).containsExactly(10);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun May 05 18:02:35 UTC 2019 - 5.5K bytes - Viewed (0) -
tensorflow/compiler/jit/extract_outside_compilation_pass.cc
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 104.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractDirectedNetworkConnections.java
*/ @ElementTypesAreNonnullByDefault abstract class AbstractDirectedNetworkConnections<N, E> implements NetworkConnections<N, E> { /** Keys are edges incoming to the origin node, values are the source node. */ final Map<E, N> inEdgeMap; /** Keys are edges outgoing from the origin node, values are the target node. */ final Map<E, N> outEdgeMap; private int selfLoopCount;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.5K bytes - Viewed (0)