Jump to content

Knuth's Simpath algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Rebooted (talk | contribs) at 22:32, 11 July 2014. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Simpath is an algorithm introduced by Donald Knuth that constructs a Zero-suppressed decision diagram (ZDD) representing all paths between two vertices in a given graph[1].

  1. ^ Knuth, Donald (2009). The Art of Computer Programming, Volume 4, Fascicle 1. Addison-Wesley Professional: Boston, MA, USA.