ShannonGraph (Averest) | Averest

ShannonGraph Type

Namespace: Averest.Analysis
Assembly: Averest.dll
Parent Module: SatSolver
Base Type: obj
All Interfaces: IEquatable<ShannonGraph> , IStructuralEquatable , IComparable<ShannonGraph> , IComparable , IStructuralComparable

Shannon graphs are unreduced and unordered binary decision diagrams. Additionally, we add negations to allow a linear representation of equivalences.

Union cases

Union case	Description
`LeafFalse` Full Usage: `LeafFalse`
`LeafTrue` Full Usage: `LeafTrue`
`NodeITE(AtomIndex, ShannonGraph, ShannonGraph)` Full Usage: `NodeITE(AtomIndex, ShannonGraph, ShannonGraph)` Parameters: Item1 : `AtomIndex` Item2 : `ShannonGraph` Item3 : `ShannonGraph`	Item1 : `AtomIndex` Item2 : `ShannonGraph` Item3 : `ShannonGraph`
`NodeNeg ShannonGraph` Full Usage: `NodeNeg ShannonGraph` Parameters: Item : `ShannonGraph`	Item : `ShannonGraph`

Instance members

Instance member	Description
`this.IsLeafFalse` Full Usage: `this.IsLeafFalse` Returns: `bool`	Returns: `bool`
`this.IsLeafTrue` Full Usage: `this.IsLeafTrue` Returns: `bool`	Returns: `bool`
`this.IsNodeITE` Full Usage: `this.IsNodeITE` Returns: `bool`	Returns: `bool`
`this.IsNodeNeg` Full Usage: `this.IsNodeNeg` Returns: `bool`	Returns: `bool`