A new technique breaks Dijkstra's 70-year-old record: it finds routes faster in huge networks, changing graph theory forever.

Classic Graph Convolutional Networks (GCNs) often learn node representation holistically, which would ignore the distinct impacts from different neighbors when aggregating their features to update a ...