Trendaavat aiheet
#
Bonk Eco continues to show strength amid $USELESS rally
#
Pump.fun to raise $1B token sale, traders speculating on airdrop
#
Boop.Fun leading the way with a new launchpad on Solana.
This new algorithm is only faster for sparse graphs (few edges per vertex).
As an example, a graph with 10^7 vertices and only 1-2 edges per vertex might be 2-3x faster.
Very cool!
8.8. klo 23.30
Huge computer science result:
A Tsinghua professor JUST discovered the fastest shortest path algorithm for graphs in 40yrs.
This improves on Turing award winner Tarjan’s O(m + nlogn) with Dijkstra’s, something every Computer Science student learns in college.
1,32K
Johtavat
Rankkaus
Suosikit