Article View: comp.lang.c++.leda
Article #76Re: HyperGraph in LEDA??
From: Boris Mitelman
Date: Sat, 09 Sep 1995 07:43
Date: Sat, 09 Sep 1995 07:43
23 lines
1465 bytes
1465 bytes
Vi Chi Chan (billy@eecg.toronto.edu) wrote: : hi there, : I am trying to implement some circuit design tools. : while looking around for good data structure library for graph, : I came across LEDA. : however, my program requires me to store and manipulate hypergraph : (one with multi-point nets) instead of just 2-point net graph. : I am wondering if LEDA can do that... : if no, is it possible to do little modification to make it work? : I appreciate any suggestions and comments. : Thank you all in advance. For tools implementation LEDA is unlikely to be efficient. For hypergraphs LEDA is not convenient. You can try to represent your hyperedges by node sets. However, does LEDA's "node_set" have the functions you need? If not, is it easy to create these functions? Another option is to redefine "edge_struct" in graph_objects.h, and to modify most of the LEDA functions for graphs :). Even if it was easy, it wouldn't be a good OO choice :). IMHO, you'll have to start from scratch. Regards, Boris.
Technical Details
Message-ID:
<42rgil$ti5@harbinger.cc.monash.edu.au>Path:
arc1-ca.pugleaf.net!broncho.ct.monash.edu.au!borisReferences:
<1995Sep7.122852.6339@jarvis.cs.toronto.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!broncho.ct.monash.edu.au!boris From: boris@broncho.ct.monash.edu.au (Boris Mitelman) Newsgroups: comp.lang.c++.leda Subject: Re: HyperGraph in LEDA?? Date: 9 Sep 1995 07:43:17 GMT Organization: Monash University Message-ID: <42rgil$ti5@harbinger.cc.monash.edu.au> References: <1995Sep7.122852.6339@jarvis.cs.toronto.edu> NNTP-Posting-Host: broncho.ct.monash.edu.au X-Newsreader: TIN [version 1.2 PL2]