OSEC

Neohapsis is currently accepting applications for employment. For more information, please visit our website www.neohapsis.com or email hr@neohapsis.com
 
From: Bin Liu (benbin2001HOTMAIL.COM)
Date: Fri Aug 03 2001 - 09:55:55 CDT

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Hi,

    Would you please tell me where I can find more details about the processing
    time for a n-node Dijkstra's computation . So far, I only know that
    (1) the complexity of the n-node Dijkstra's computation is n*log (n)
    (2) Steve Deering, in his ¡°MOSPF meeting report¡±, presented the following
    statistics: for a 200 routers network, the time to run Dijkstra in a DEC
    5000 (10 MIPS processor) was around 15 milliseconds.

    Similarly, could you tell me how to trace the number of instructions a n-
    node Dijkstra's computation may need.

    Best wishes

    yours
    Ben