130 likes | 230 Views
This project involves creating L-shaped drawings for maximal outerplanar graphs with a degree less than or equal to 4. The input comprises maximal outerplanar graph G with a degree less than or equal to 4, and the output provides the L-shaped drawing of G. The process involves arranging the graph nodes in a unique L-shaped pattern for easy visualization and analysis.
E N D
L-Shaped Drawing of Maximal Outerplanar graphs of degree <=4
a b e g INPUT: Maximal outerplanar graph G of degree <=4 c d f h g h e f OUTPUT L-Shaped Drawing of G b d a c
a b e g c d f h g e b a c
a b e g c d f h g h e f b d a c
a b e g c d f h g h e f b d a c
a b e g c d f h g h e f b d a c
a b e g c d f h g h e f b d a c
a b e g c d f h g h e f b d a c
a b e g c d f h g h e f b d a c
a b e g g i h c d f h h h i g h e f b d a c
a b e g c d f h g h e f b d a c