Download Tulip User Manual

Functionalities
• A leaf is an "ending node".
Algorithm documentation9
3.2.2. Color Algorithms :
3.2.2.1. Metric Mapping :
The metric mapping algorithm can be used to re-color the nodes of the graph after using a measure (
Section 3.2.3, “Measure” ) algorithm.
This Algorithm takes 5 parameters :
• Property : Property is a metric value. It is used to affect scalar values to graph items.
• Colormodel : Color can be either 1 or 0. 1 for RGB interpolation and 0 for HSV interpolation.
• Type : If type is checked, the color mapping will be uniform, which means that if you have 2
nodes with the property value equals to 0, there will be 2 nodes colored in "color1" . If type is not checked,
the color quantification will be linear, which means that if you have 2 nodes with the property value equals to
0, there will be 1 node colored in "color1" and an other with a lighter color1.
• Color1 : Color1 will be the color of the node that has the lowest value (according to the Property
field)
• Color2 : Color2 will be the color of the node that has the highest value (according to the Property
field)
Let’s take an example :
As you can see here is a graph where no metric values has been computed.
9 ../../doxygen/allPlugins.html#SpanningTreeSelection
38