|Boolean expressions represented as directed graph firstname.lastname@example.org (Steve Jones) (2002-05-27)|
|Re: Boolean expressions represented as directed graph email@example.com (VBDis) (2002-05-31)|
|Re: Boolean expressions represented as directed graph firstname.lastname@example.org (Kenn Heinrich) (2002-05-31)|
|From:||"Steve Jones" <email@example.com>|
|Date:||27 May 2002 21:09:51 -0400|
|Posted-Date:||27 May 2002 21:09:51 EDT|
I'm working on a visual designer which uses a directed graph to
represent boolean expressions. In the graph vertexes represent
variables and the edges the relationship between them.
A simple example:
A -+-> B -> C -+-> J
+-> X -> Y -+
would equate to:
J = A and ( ( B and C) or ( X and Y ) )
Put simply, vertexes connected by more than one path are OR'ed together.
Vertexes connected by a single path are AND'ed
I'm looking for some insight on the approach I might take in traversing the
graph to convert it to the text form.
Return to the
Search the comp.compilers archives again.