On Fri, May 09, 2014 at 01:12:14PM +0100, Roger Leigh wrote:
> On Fri, May 09, 2014 at 01:07:02PM +0200, Ulrich Lauther wrote:
> > On Fri, May 09, 2014 at 10:48:08AM +0100, Denis M. Wilson wrote:
> > > The method used in TeX is the shortest path in a directed acyclic graph.
> > > This is a well-und
On Fri, May 09, 2014 at 01:07:02PM +0200, Ulrich Lauther wrote:
> On Fri, May 09, 2014 at 10:48:08AM +0100, Denis M. Wilson wrote:
> > The method used in TeX is the shortest path in a directed acyclic graph.
> > This is a well-understood problem. There seems unfortunately to be
> > nothing useful i
On Fri, May 09, 2014 at 10:48:08AM +0100, Denis M. Wilson wrote:
> The method used in TeX is the shortest path in a directed acyclic graph.
> This is a well-understood problem. There seems unfortunately to be
> nothing useful in the STL. The DAG would need to be a new data type.
>
To build and use
The method used in TeX is the shortest path in a directed acyclic graph.
This is a well-understood problem. There seems unfortunately to be
nothing useful in the STL. The DAG would need to be a new data type.
The real problem is assigning the values in the DAG. Something of the
sort must already b
On Thu, May 08, 2014 at 04:17:16PM -0400, Doug McIlroy wrote:
[...]
> I fully agree with the first paragraph. However, as there is essentially no
> limit on the amount (or kind) of path-dependent state that may be needed
> to calculate each partial solution, I see forking as the easiest way to
> im
