[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[igraph] Algorithms for Acyclic Digraphs

From: Michael Bommarito
Subject: [igraph] Algorithms for Acyclic Digraphs
Date: Wed, 29 Jul 2009 11:13:25 -0700 (PDT)
User-agent: G2/1.0

Another item for the wishlist that I'd be willing to help develop: a
shortest path algorithm for acyclic digraphs.  Since this is linear
time if you know the ordering, and linear time to get the ordering,
any other algorithms that use shortest path calculations could see
significant speed boosts.

reply via email to

[Prev in Thread] Current Thread [Next in Thread]