🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Thread View: comp.graphics.misc
1 messages
1 total messages Started by L.J. van Alphen Tue, 10 Oct 1995 13:59
Net datastructure
#1
Author: L.J. van Alphen
Date: Tue, 10 Oct 1995 13:59
24 lines
1365 bytes
I am writing software in C++ to impliment a man-machine interface for a 
CAD-like environment
where the user can place objects on the worksheet. These objects 
represent processing 
elements and have connection ports. The user will drag and route 
connections between
these ports. A connection can also be made from a port to any portion of 
an existing 
connection segment. When the connection nodes are dragged, the segments 
should also 
move around. When segments are deleted, they must only delete up to a 
node where 
other connections are connected. Similar to a PCB routing program. 

My question is this:
What is the most efficient way (class structure) of representing this 
'network'.
Should each segment be an object with a pointer to the node representing 
each endpoint?
Should these object be sorted in any particular way.

ARe there any suggestions or references out there?

L.J. van Alphen
Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads