On Apr 2, 8:33 pm, Scott David Daniels <[EMAIL PROTECTED]> wrote:
> bukzor wrote:
> > Can someone point me in the direction of a good solution of this? I'm
> > using it to construct a SQL query compiler,
> > Given a directed graph and a list of points in the graph, what is the
> > minimal subg
bukzor wrote:
> Can someone point me in the direction of a good solution of this? I'm
> using it to construct a SQL query compiler,
> Given a directed graph and a list of points in the graph, what is the
> minimal subgraph that contains them all? It is preferable that the
> subgraph is a tree.
bukzor wrote:
> Can someone point me in the direction of a good solution of this? I'm
> using it to construct a SQL query compiler, where each node is a table
> and each edge is a join. I'm planning on using the NetworkX library if
> possible.
> https://networkx.lanl.gov/reference/networkx/
>
>
>
On Apr 1, 3:46 pm, bukzor <[EMAIL PROTECTED]> wrote:
> Can someone point me in the direction of a good solution of this? I'm
> using it to construct a SQL query compiler, where each node is a table
> and each edge is a join. I'm planning on using the NetworkX library if
> possible.https://networkx.
Can someone point me in the direction of a good solution of this? I'm
using it to construct a SQL query compiler, where each node is a table
and each edge is a join. I'm planning on using the NetworkX library if
possible.
https://networkx.lanl.gov/reference/networkx/
Given a directed graph and a
