1

As I understand, Decision graph is a directed graph where each vertex is a "Question" (decision to make), and each edge is an "Answer" (decision made for the vertex this edge is coming from). The terminal nodes of that graph is a solution.

Problem: With this structure - each "Answer" can lead only to a single consequent "Question". However in my real-world problem "Answer" can lead to multiple consequent "Questions".

What is the right data structure and algorithms for such kind of decision making , finding optimal solution problems.

0 Answers0