Provider: | PUT |
---|---|
Version: | 0.2 |
Draws Hasse diagram - visualization of transitive reduction of a finite partially ordered set. Service developed by Krzysztof Ciomek (Poznan University of Technology, under supervision of Milosz Kadzinski).
(For outputs, see below)
A list of alternatives.
Necessary assignment based preference relation between alternatives.
<alternativeID>a1</alternativeID> <column>
<alternativeID>a2</alternativeID> <values><value><real>0.0</real></value></values>
</column> <column>
<alternativeID>a7</alternativeID> <values><value><real>0.0</real></value></values>
</column> […]
</row> […]
</alternativesMatrix>
Diagram drawing parameters.
Parameter values can be defined via the GUI or the XMCDA file, by default via GUI.
Name: cluster
Whether to cluster elements which have same parents and children and are connected all to all.
Name: transitiveReduction
Whether to perform transitive reduction.
Name: shape
Shape of diagram nodes.
Name: arrows
Direction of arrows.
</value>
</values>
</parameter> <parameter name=”transitiveReduction”>
- <values>
- <value>
- <boolean>%2</boolean>
</value>
</values>
</parameter> <parameter name=”shape”>
- <values>
- <value>
- <label>%3</label>
</value>
</values>
</parameter> <parameter name=”arrows”>
- <values>
- <value>
- <label>%4</label>
</value>
</values>
</parameter>
</programParameters>
Hasse diagram.
Messages generated by the program.
For further technical details on the web service underlying this program, have a look at its documentation here.