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.
Tag: alternativesComparisons
Code:
<alternativesComparisons>
<pairs>
<pair>
<initial><alternativeID>[...]</alternativeID></initial>
<terminal><alternativeID>[...]</alternativeID></terminal>
</pair>
[...]
</pairs>
</alternativesComparisons>
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.
Tag: methodParameters
Code:
<methodParameters>
<parameter name="cluster">
<value>
<boolean>%1</boolean>
</value>
</parameter>
<parameter name="transitiveReduction">
<value>
<boolean>%2</boolean>
</value>
</parameter>
<parameter name="shape">
<value>
<label>%3</label>
</value>
</parameter>
<parameter name="arrows">
<value>
<label>%4</label>
</value>
</parameter>
</methodParameters>
Hasse diagram.
Tag: alternativeValue
Code:
<alternativeValue mcdaConcept="hasseDiagram">
<alternativesSet>
<element>
<alternativeID>[...]</alternativeID>
</element>
[...]
</alternativesSet>
<value>
<image>[PNG as BASE64]</image>
</value>
</alternativeValue>
Messages generated by the program.
For further technical details on the web service underlying this program, have a look at its documentation here.