fix: improve Dijkstra algorithm with proper min-heap implementation #231
Workflow file for this run
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # https://github.com/golangci/golangci-lint | |
| name: CI tool kit | |
| on: | |
| pull_request: | |
| jobs: | |
| CITK: | |
| name: Code style and tests | |
| runs-on: ubuntu-latest | |
| strategy: | |
| fail-fast: false | |
| steps: | |
| - uses: actions/checkout@v4 | |
| with: | |
| fetch-depth: 0 | |
| - name: Setup Go | |
| uses: actions/setup-go@v5 | |
| with: | |
| go-version: "^1.18" | |
| - name: Checkout branch | |
| run: | | |
| git fetch origin master:master | |
| - name: Install citk tool | |
| run: | | |
| go install github.com/tjgurwara99/citk@latest | |
| - name: Run citk tool | |
| run: | | |
| citk check -l go -b master |