Article View: comp.graphics.misc
Article #1Net datastructure
From: L.J. van Alphen
Date: Tue, 10 Oct 1995 13:59
Date: Tue, 10 Oct 1995 13:59
24 lines
1365 bytes
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
Technical Details
Message-ID:
<45du77$961@aztec.co.za>Path:
arc1-ca.pugleaf.net!aztec.co.za!usenetShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!aztec.co.za!usenet From: "L.J. van Alphen" <lja@ccii.co.za> Newsgroups: comp.graphics.misc,comp.lang.c++,comp.programming Subject: Net datastructure Date: 10 Oct 1995 13:59:03 GMT Organization: CCII Systems Message-ID: <45du77$961@aztec.co.za> NNTP-Posting-Host: lja.ccii.co.za Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Mailer: Mozilla 1.1N (Windows; I; 16bit)