Hi,
I'm developing a small application
I have:
2 main lists ordered by code numbers in trees. Let's call them A and B
1 relation (M-N) list called C between A and B
2 notes lists X and Y connected respectively to A and B
I want to use TVirtualStringTree to display the main lists.
On selecting an item in the list I want to show the connection with the
other list and the notes of the item.
As I don't want to use a database to hold the data, what should be the
best way to implement it? What kind of structure should I use. I'm
thinking about Tlist in a lower layer where the virtualstringtree
components can access through pointers.
Any suggestions?
