MCPcopy Create free account

hub / github.com/VictoriqueMoe/BMSSP / functions

Functions67 in github.com/VictoriqueMoe/BMSSP

⨍ Functions 67◇ Types & classes 8
↓ 43 callersMethodSolve
()
dijkstra/dijkstra.go:24
↓ 27 callersFunctionNewDijkstraAlgorithm
(g *common.Graph, sources []int, boundary *float64)
dijkstra/dijkstra.go:16
↓ 26 callersFunctionNewBMSSPAlgorithm
(g *common.Graph, l int, B float64, S []int)
bmssp/bmssp.go:19
↓ 11 callersMethodInsert
(v int, dist float64)
bmssp/data_structure_d.go:23
↓ 10 callersMethodSolve
()
bmssp/bmssp.go:53
↓ 9 callersMethodLen
()
common/priority_queue.go:5
↓ 9 callersFunctioncreateGridGraph
(rows, cols int)
benchmarks/comparison_test.go:378
↓ 8 callersFunctioncreateLinearGraph
--- Helper Functions ---
dijkstra/dijkstra_test.go:175
↓ 6 callersMethodPush
(x interface{})
common/priority_queue.go:19
↓ 5 callersMethodPull
Pull pops up to M items, draining ties completely.
bmssp/data_structure_d.go:40
↓ 5 callersFunctioncreateLinearGraph
--- Helper Functions ---
bmssp/bmssp_test.go:262
↓ 4 callersMethodInitialize
(M int, B float64)
bmssp/data_structure_d.go:15
↓ 4 callersMethodIsEmpty
()
bmssp/data_structure_d.go:89
↓ 4 callersMethodPop
()
common/priority_queue.go:26
↓ 4 callersFunctioncreateLinearGraph
--- Graph Generation Utilities ---
benchmarks/comparison_test.go:366
↓ 3 callersFunctioncreateRandomGraph
(n, m int, seed int64)
benchmarks/comparison_test.go:402
↓ 2 callersMethodBatchPrepend
(entries []common.DistEntry)
bmssp/data_structure_d.go:74
↓ 2 callersMethodbaseCase
(B float64, s int)
bmssp/bmssp.go:162
↓ 1 callersMethodbaseCaseSingletonOrSplit
(B float64, S []int)
bmssp/bmssp.go:140
↓ 1 callersMethodbmsspRecursive
(l int, B float64, S []int)
bmssp/bmssp.go:58
↓ 1 callersFunctioncreateCycleGraph
()
dijkstra/dijkstra_test.go:192
↓ 1 callersFunctioncreateCycleGraph
()
bmssp/bmssp_test.go:279
↓ 1 callersFunctioncreateWeightedCompleteGraph
()
dijkstra/dijkstra_test.go:206
↓ 1 callersMethodfindPivots
(B float64, S []int)
bmssp/bmssp.go:207
FunctionBenchmarkComparison_Bounded
(b *testing.B)
benchmarks/comparison_test.go:186
FunctionBenchmarkComparison_GridGraph_Medium
(b *testing.B)
benchmarks/comparison_test.go:98
FunctionBenchmarkComparison_GridGraph_Small
(b *testing.B)
benchmarks/comparison_test.go:77
FunctionBenchmarkComparison_LinearGraph_Large
(b *testing.B)
benchmarks/comparison_test.go:56
FunctionBenchmarkComparison_LinearGraph_Medium
(b *testing.B)
benchmarks/comparison_test.go:35
FunctionBenchmarkComparison_LinearGraph_Small
--- Small/Medium Benchmarks ---
benchmarks/comparison_test.go:14
FunctionBenchmarkComparison_MultiSource
(b *testing.B)
benchmarks/comparison_test.go:165
FunctionBenchmarkComparison_RandomGraph_Dense
(b *testing.B)
benchmarks/comparison_test.go:142
FunctionBenchmarkComparison_RandomGraph_Sparse
(b *testing.B)
benchmarks/comparison_test.go:119
FunctionBenchmarkDijkstra_Bounded
(b *testing.B)
dijkstra/dijkstra_test.go:162
FunctionBenchmarkDijkstra_Large
(b *testing.B)
dijkstra/dijkstra_test.go:142
FunctionBenchmarkDijkstra_Medium
(b *testing.B)
dijkstra/dijkstra_test.go:132
FunctionBenchmarkDijkstra_MultiSource
(b *testing.B)
dijkstra/dijkstra_test.go:152
FunctionBenchmarkDijkstra_Small
--- Benchmarks ---
dijkstra/dijkstra_test.go:122
FunctionBenchmarkLargeScale_Bounded_100k
(b *testing.B)
benchmarks/comparison_test.go:343
FunctionBenchmarkLargeScale_Grid_100k
--- Large Scale Benchmarks (100k+ vertices) --- These are the benchmarks where BMSSP should start showing advantages
benchmarks/comparison_test.go:233
FunctionBenchmarkLargeScale_Grid_1M
(b *testing.B)
benchmarks/comparison_test.go:275
FunctionBenchmarkLargeScale_Grid_250k
(b *testing.B)
benchmarks/comparison_test.go:254
FunctionBenchmarkLargeScale_MultiSource_100k
(b *testing.B)
benchmarks/comparison_test.go:319
FunctionBenchmarkLargeScale_Random_100k
(b *testing.B)
benchmarks/comparison_test.go:296
FunctionBenchmarkMemory_Comparison
(b *testing.B)
benchmarks/comparison_test.go:207
MethodLess
(i, j int)
common/priority_queue.go:9
MethodSolve
Solve executes the algorithm and returns the final distance map.
common/solver.go:5
MethodSwap
(i, j int)
common/priority_queue.go:13
FunctionTestBMSSP_BoundaryConstraint
(t *testing.T)
bmssp/bmssp_test.go:226
FunctionTestBMSSP_CycleGraph
(t *testing.T)
bmssp/bmssp_test.go:193
FunctionTestBMSSP_DifferentRecursionDepths
(t *testing.T)
bmssp/bmssp_test.go:209
FunctionTestBMSSP_DisconnectedGraph
(t *testing.T)
bmssp/bmssp_test.go:164
FunctionTestBMSSP_FractionalWeights
(t *testing.T)
bmssp/bmssp_test.go:95
FunctionTestBMSSP_LargeSparseGraph
(t *testing.T)
bmssp/bmssp_test.go:243
FunctionTestBMSSP_MultiSource
(t *testing.T)
bmssp/bmssp_test.go:149
FunctionTestBMSSP_NoPivots_Successful
(t *testing.T)
bmssp/bmssp_test.go:116
FunctionTestBMSSP_SingleSource
--- Tests for BMSSPAlgorithm ---
bmssp/bmssp_test.go:133
FunctionTestDataStructureD_BasicOperations
(t *testing.T)
bmssp/bmssp_test.go:9
FunctionTestDataStructureD_BatchPrepend
(t *testing.T)
bmssp/bmssp_test.go:47
FunctionTestDataStructureD_TieDrain_NoSplit
(t *testing.T)
bmssp/bmssp_test.go:76
FunctionTestDijkstra_Bounded
(t *testing.T)
dijkstra/dijkstra_test.go:42
FunctionTestDijkstra_CycleGraph
(t *testing.T)
dijkstra/dijkstra_test.go:88
FunctionTestDijkstra_DisconnectedGraph
(t *testing.T)
dijkstra/dijkstra_test.go:63
FunctionTestDijkstra_MultiSource
(t *testing.T)
dijkstra/dijkstra_test.go:25
FunctionTestDijkstra_SimpleGraph
(t *testing.T)
dijkstra/dijkstra_test.go:9
FunctionTestDijkstra_WeightedCompleteGraph
(t *testing.T)
dijkstra/dijkstra_test.go:104
Functionmain
()
main.go:10