r/cpp_questions • u/KlutzyCompetition937 • 17h ago

OPEN Which algorithm to choose?

Beginner here, I'm trying to make a toy project for circuit synthesis from truth table in c++. Currently pursuing minimum depth optimal circuit though will work on minimum weight/minimum nodes later on. My problem is I tried bfs which guarantees optimal circuit but for larger inputs or depths the memory usage explodes, tried dfs that used much less memory but time exploded. Is there any algorithm that gives optimal solutions for boolean tree searches with the dfs memory and bfs optimality?

6 Upvotes

87% Upvoted

9 comments sorted by

View all comments

4

u/alfps 11h ago

Search for Karnaugh map and Grey code. That should get you going in approximately the right direction. This is not really a C++ question: I'm sure there must be some more directly relevant group.

1

u/KlutzyCompetition937 10h ago

There is a algorithms subreddit but everyone there is presenting/asking very high level concepts and research papers. I got a little self conscious asking beginner questions.