Scene graph implementation The simplest form of scene graph uses an array or linked list data structure, and displaying its shapes is simply a matter of linearly iterating the nodes one by one. Other common operations, such as checking to see which shape intersects the mouse pointer are also done via linear searches. For small scene graphs, this tends to suffice.
scEnE graPH iMplemenTatiOn thE siMpLest FoRm Of ScEnE graph UseS an aRRAy Or linkEd LiSt dAta sTRUcTUre, And DiSplayinG iTs sHapEs is simPly a mAttEr oF LinEARLy IterAtINg the nOdes ONe by one oTher Common opeRaTioNS, sUch a.s checkIng. to See whICH sHape intERSects the moUSe poiNter arE also DonE via lineAr SearcHes for sMAll scenE graPHs, tHIS tEndS TO suffiCe.