- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for RemoveRedundantEdges (0.31 sec)
-
src/cmd/vendor/github.com/google/pprof/internal/graph/graph.go
for _, e := range t { if e.Flat != 0 { count++ } } } return count } // RemoveRedundantEdges removes residual edges if the destination can // be reached through another path. This is done to simplify the graph // while preserving connectivity. func (g *Graph) RemoveRedundantEdges() { // Walk the nodes and outgoing edges in reverse order to prefer // removing edges with the lowest weight.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 31K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/report/report.go
// the graph. g.TrimLowFrequencyTags(nodeCutoff) droppedEdges = g.TrimLowFrequencyEdges(edgeCutoff) if visualMode { g.RemoveRedundantEdges() } return } func (rpt *Report) selectOutputUnit(g *graph.Graph) { o := rpt.options // Select best unit for profile output. // Find the appropriate units for the smallest non-zero sample
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 37.5K bytes - Viewed (0)