Re: finding 'mimimal' SQL statements

This sounds interesting enough. Can you be a lil more explanatory. An example would be helpful.
Thanks
Aakash

Marc Biemond wrote:

> During my work as an IT engineer I came across the following problem. In
> order to generate 'minimal' SQL statements, I need to find all spanning
> trees of a subset of vertices in an undirected graph.
>
> I use a directed graph without cycles to represent a database scheme.
>
> Although I found some articles on algorithms for finding all the spanning
> trees in a graph, these techniques do not apply to the more general issue of
> finding spanning trees of subsets of vertices, as far as I know.
>
> If someone can give me some pointers on these issues, please email me.
>
> Thanks in advance,
> Marc Biemond.
  Received on Tue Dec 26 2000 - 23:37:59 CET