My introduction to the Blockchain and Merkle Tree
Embark on a journey through Blockchain's core, exploring its enticing realm with a dive into Merkle trees. This piece illuminates the path from a gaming intrigue to developing a Go-based Merkle tree, underlining Blockchain's cryptographic elegance and data integrity verification. A must-read for the crypto-curious coder.
Implementation of Dijkstra using heap in Go
Dive into implementing Dijkstra's Algorithm using a min-heap in Go, focusing on the creation of a priority queue to efficiently find the shortest path between nodes. The guide includes detailed code for heap and graph logic, demonstrating a practical approach to Dijkstra's Algorithm in Go.