Dijkstra为什么不能有负权
走在路上突然想到这个问题，但是一时没想出来。
所以其实就抓住Dijstra和Bellman-Ford的最关键区别 - Dijkstra的节点在出堆之后就不再考虑了，而B-F每一次都对所有节点操作 - 来构造反例。思路是使某一节点出堆之后还能被更新（且不是负环的情况，因为负环本来就不可能有解。）
You May Also Enjoy
Software Engineering - What is “Just Right”?
3 minute read
Lessons Learned
Learning Redis Streams
2 minute read
XREAD [COUNT count] [BLOCK milliseconds] STREAMS key [key …] id [id …] Some details: If COUNT is unset, it reads EVERYTHING. The ID field is an EXCLUSIV...
How to achieve read-write separation using redis replication with Sentinels & the go-redis library?
2 minute read
Problem Want to read from replicas and only write to the master, to reduce master loads. Solution Create read-only clients using NewFailOverClient(opt) with ...
使用gomock和httptest测试api
less than 1 minute read
Mock