Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • Users
  • Groups
Skins
  • Light
  • Brite
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Brand Logo

WTF-Beta

  1. Home
  2. Categories
  3. Off Key - General Discussion
  4. Surpassing Dijkstra

Surpassing Dijkstra

Scheduled Pinned Locked Moved Off Key - General Discussion
2 Posts 2 Posters 30 Views
  • Oldest to Newest
  • Newest to Oldest
  • Most Votes
Reply
  • Reply as topic
Log in to reply
This topic has been deleted. Only users with topic management privileges can see it.
  • AxtremusA Offline
    AxtremusA Offline
    Axtremus
    wrote on last edited by
    #1

    The paper:

    https://arxiv.org/html/2504.17033v2

    Abstract:
    IMG_0124.jpeg

    Team in China came up with faster algorithm to find single-source shortest path. Before this, the fastest algorithm was developed by Dijkstra and published in 1984. Dijkstra’s name are in many Mathematics and Computer Science text books for this reason. I would venture to guess that anyone who has a Computer Science or Computer Engineering degree today knows Dijkstra’s name (though few will remember the algorithm itself). So surpassing Dijkstra’s algorithm after 41 years is a big deal.

    wtgW 1 Reply Last reply
    • AxtremusA Axtremus

      The paper:

      https://arxiv.org/html/2504.17033v2

      Abstract:
      IMG_0124.jpeg

      Team in China came up with faster algorithm to find single-source shortest path. Before this, the fastest algorithm was developed by Dijkstra and published in 1984. Dijkstra’s name are in many Mathematics and Computer Science text books for this reason. I would venture to guess that anyone who has a Computer Science or Computer Engineering degree today knows Dijkstra’s name (though few will remember the algorithm itself). So surpassing Dijkstra’s algorithm after 41 years is a big deal.

      wtgW Offline
      wtgW Offline
      wtg
      wrote on last edited by
      #2

      @Axtremus said in Surpassing Dijkstra:

      I would venture to guess that anyone who has a Computer Science or Computer Engineering degree today knows Dijkstra’s name (though few will remember the algorithm itself).

      That would be me and you are correct on all counts. We used the book Structured Programming in some class or another; he was one of the co-authors.

      When the world wearies and society ceases to satisfy, there is always the garden - Minnie Aumônier

      1 Reply Last reply
      Reply
      • Reply as topic
      Log in to reply
      • Oldest to Newest
      • Newest to Oldest
      • Most Votes


      Powered by NodeBB | Contributors
      • Login

      • Don't have an account? Register

      • Login or register to search.
      • First post
        Last post
      0
      • Categories
      • Recent
      • Tags
      • Popular
      • Users
      • Groups