Movies and Demos for ULP Trees
The movies on this page are recorded demos of the GraphSET examples given on the Screenshots and Examples page.
Each movie is available in two formats:
- Most Windows users should be able to play the AVI format using Windows Media Player. This requires the Microsoft MPEG-4 Video Codec V3. On most Windows installations, this codec is available by default. If not, the codec can be freely downloaded from Microsoft's website.
- For all other users a MPEG-1 format is provided that Quicktime and most standard Linux video players can play.
The AVI version of the movies run at the full original resolution of 952 by 745 pixels at 30 frames per second and are smaller in size ranging from 1MB to 5MB.
The MPEG version of the movies run at a lower resolution of 720 by 576 pixels and at a slower bitrate of 1152. These files are roughly 2 to 3 larger than the AVI files from which they were converted. They range in size from 3MB to 12MB.
Drawing ULP Trees
The following movies illustrate the drawing algorithms for the ULP trees. Each figures has two movies.
The first movie runs the animated drawing algorithm for the given figure.
The second movie alters the tracks numbers of the vertices in the figures and redraws the tree accordingly.
Figure 2 - Caterpillar on 30 Levels

Figure 2 Drawn: |
![]() |
![]() |
Figure 2 Altered: |
![]() |
![]() |
Figure 3 - Radius-2 Star on 29 Levels

Figure 3 Drawn: |
![]() |
![]() |
Figure 3 Altered: |
![]() |
![]() |
Figure 7 - Degree-3 Spider on 20 Levels

Figure 7 Drawn: |
![]() |
![]() |
Figure 7 Altered: |
![]() |
![]() |
Figure 8 - Degree-3 Spider Worst Case

Figure 8 Drawn: |
![]() |
![]() |
Figure 8 Altered: |
![]() |
![]() |
Figure 11 - Caterpillar on 8 Levels

Figure 11 Drawn: |
![]() |
![]() |
Figure 11 Altered: |
![]() |
![]() |
Recognizing ULP Trees
The following movies illustrate the recognition algorithms for the ULP trees.
Recognizing ULP Trees with Distinct Lables
This movie illustrates the ULP recognition algorithms for the case of distinct labels by adding and deleting edges from Figures 2, 3, and 7 above.Recognition with Distinct Labels: |
![]() |
![]() |
Recognizing ULP Trees with Duplicate Lables
This movie illustrates the ULP recognition algorithm for the case of duplicate labels by adding and deleting edges from Figures 11 above.Recognition with Duplicate Labels: |
![]() |
![]() |