github.com/qiuhoude/go-web@v0.0.0-20220223060959-ab545e78f20d/algorithm/datastructures/graph/a_star_test.go (about)

     1  package graph
     2  
     3  import (
     4  	"testing"
     5  )
     6  
     7  func buildMap() [][]uint {
     8  	// 8 * 6
     9  	m := make([][]uint, 6)
    10  	for i := range m {
    11  		m[i] = make([]uint, 8)
    12  	}
    13  	//m[0][4] = 1
    14  	m[1][4] = 1
    15  	m[2][4] = 1
    16  	m[3][4] = 1
    17  	m[4][4] = 1
    18  	//m[5][4] = 1
    19  	return m
    20  }
    21  
    22  func TestGenMap(t *testing.T) {
    23  	m := buildMap()
    24  	printMap(m)
    25  }
    26  
    27  /*
    28  0,0,0,0,0,0,0,0
    29  0,0,0,0,1,0,0,0
    30  0,0,0,0,1,0,0,0
    31  0,0,s,0,1,0,t,0
    32  0,0,0,0,1,0,0,0
    33  0,0,0,0,1,0,0,0
    34  */
    35  
    36  func TestAstarSearch(t *testing.T) {
    37  	m := buildMap()
    38  	AstarSearch(2, 3, 6, 3, m)
    39  }