| Ticket UUID: | 486547 | |||
| Title: | note for future struct::graph developmen | |||
| Type: | RFE | Version: | None | |
| Submitter: | lvirden | Created on: | 2001-11-28 17:36:06 | |
| Subsystem: | struct :: graph | Assigned To: | andreas_kupries | |
| Priority: | 5 Medium | Severity: | ||
| Status: | Open | Last Modified: | 2003-04-23 07:25:42 | |
| Resolution: | Closed By: | |||
| Closed on: | ||||
| Description: |
Perl has a number of modules dealing with graphs - perhaps some useful code could be garnered by looking at modules such as http://www.cpan.org//authors/id/N/NE/NEILB/ where the author has a collection of modules for reading and writing directed graphs in a variety of formats. | |||
| User Comments: |
andreas_kupries added on 2003-04-12 05:36:29:
Logged In: YES user_id=75003 Raising the priority of the item because its inclusion in the upcoming release was proposed in the Tcllib-devel mailing list. Supporting or contrarian statements should be made on the referenced mailing list for public discussion. mic42 added on 2002-09-10 01:09:17: Logged In: YES user_id=302287 I have finished a c coded version of the tcllib 1.3 version. It can be found at: http://purl.oclc.org/NET/schlenk/tcl/cgraph Michael andreas_kupries added on 2002-02-27 05:35:00: Logged In: YES user_id=75003 there do you = where do you andreas_kupries added on 2002-02-27 03:56:32: Logged In: YES user_id=75003 Whow, there do you use 150 000+ nodes ? Seriously. We have a command per graph. The implementation (= C function) of this command should be shared, and be given a reference to the actual graph structure during registration as true tcl command (ClientData of tcl commands!). In the shared implementation cast the incoming clientdata into the correct pointer to the graph structure and then just use it. nodes, arcs. Use hashtables to map from node and arc names to the structures hold information about them. Interlink these structure. For example an arc structure should contain references to the two nodes the arc is connected too. Same for node structures, should have references to all incoming and outgoing arcs. Possibilities here are dynamically allocated arrays, linked lists, hash tables, Tcl_Obj => list functionality. A C implementation would be great. mic42 added on 2002-02-23 00:36:49: Logged In: YES user_id=302287 I'm currently looking into coding a c version to reduce memory consumption and speed (i like the tcllib interface, but it is a bit slow using 150 000 + Nodes...), perhaps there are some ideas how this could be done. Any help appreciated. | |||
Home
Blog
Docs
Downloads
Tickets
Timeline
Branches
Tags
Wiki