---
title: Knuth's Simpath algorithm
slug: knuth-s-simpath-algorithm
qid: 
snapshot: enwiki-001355366447
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1355366447
tags: [23221441, 23468805, 24723435, 25574325, 26709281, 28696367, 29176300]
---

# Knuth's Simpath algorithm

> [!note] Provenance
> Snapshot `enwiki-001355366447` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1355366447> · Licensed CC BY-SA 4.0

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

Simpath is an algorithm introduced by Donald Knuth that constructs a zero-suppressed decision diagram (ZDD) representing all simple paths between two vertices in a given graph. ==References== ==External links== Graphillion library which implements the algorithm for manipulating large sets of paths and other structures. A CWEB implementation by Donald Knuth.
