Your vault has a graph. But you can only stare at it. Obsidian's graph view is beautiful, but it can't answer questions — "Which notes have the most links?" "How many hops between these two concepts?" ...

Explore more than 30 algorithms with step by step visualization simplifying the learning process and making it more engaging for a better understanding.

4月30日，是Robert Tarjan的78岁生日，目前他还在普林斯顿带博士生。 1986年他和John Hopcroft共享图灵奖，到今年正好40年。 如果你家孩子在打信奥，"Tarjan"这个名字一定见过。 求强连通分量的Tarjan算法、并查集路径压缩、Splay树、Fibonacci堆、Link-cut tree。这些散落在 ...

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...

Chinese computer scientists have solved a 40-year-old mathematics bottleneck, an advance that might help boost performance in hi-tech areas ranging from chip design and telecommunications to drone ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle the easiest pieces first. But this kind of sorting has a cost.

The dynamic equivalence problem illustrates trade-offs that we often see when designing algorithms. There are two operations we’d like to perform, find and union, and we can optimize either to have ...

Abstract: The reliability and performance of concurrency are severely affected by deadlocks in concurrent systems. An efficient deadlock detection algorithm is needed to ensure that any deadlock cases ...

The original version of this story appeared in Quanta Magazine. If you’ve been making the same commute for a long time, you’ve probably settled on what seems like the best route. But “best” is a ...