Get started

The following tutorial will guide you on how to use the basic features of DD-suite, which includes:

1. Create a problem instance

2. Create and manipulate a DD

3. Use your DD for optimization purposes either via:

   3.1. Shortest/longest path algorithm

   3.2. Cutting plane approach

4. Export DD graph and metrics

This tutorial considers the knapsack problem as our running example. All the code is provided in the Example folders for both the Python and C++ implementations.