Re: finding 'mimimal' SQL statements
From: Jan Hidders <hidders_at_REMOVE.THIS.win.tue.nl>
Date: 27 Dec 2000 14:04:12 GMT
Message-ID: <92csss$9ql$1_at_news.tue.nl>
Date: 27 Dec 2000 14:04:12 GMT
Message-ID: <92csss$9ql$1_at_news.tue.nl>
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.
First find a spanning tree on the complete graph, then keep removing the leaf vertices not in the subset until there are no more.
-- Jan HiddersReceived on Wed Dec 27 2000 - 15:04:12 CET