ok, I'll fork from phobos and get down to busyness. On Sat, May 12, 2012 at 10:39 PM, H. S. Teoh <[email protected]> wrote:
> On Sat, May 12, 2012 at 10:25:15PM +0400, Gor Gyolchanyan wrote: > > Ok. I gotta implement it anyway - I need it for my project. Might as > > well submit it. > > Are you gonna work on this too? If so - we should coordinate our > > efforts. > > Well, I'd _like_ to work on it, but I'm supposed to be working on the > new AA implementation as well, and time hasn't been on my side. :-( > > Having said that, though, putting the code up on github should be > helpful -- you'll be able to find other volunteers who can help. > > > --T > > > On Sat, May 12, 2012 at 9:20 PM, H. S. Teoh <[email protected]> > wrote: > > > > > On Sat, May 12, 2012 at 09:16:21PM +0400, Gor Gyolchanyan wrote: > > > > What do you think about this, The Phobos Crew? > > > > > > Doesn't matter, just write the code and submit a pull request. :-) > > > > > > > > > > On Sat, May 12, 2012 at 9:06 PM, H. S. Teoh <[email protected]> > > > wrote: > > > > > > > > > On Sat, May 12, 2012 at 02:53:24PM +0400, Gor Gyolchanyan wrote: > > > > > > I've been trying to find a D* lite too, but with no luck. > > > > > > Having a fast graph traversal algorithms are useful for a ton of > very > > > > > > powerful use cases, besides path planning. > > > > > > I'm starting to think, that we're gonna have to implement it > > > ourselves. > > > > > > Which in turn will require us to implement a graph data > structure. > > > > > > Right now I need a good graph data structure for my project, so I > > > have > > > > > > a direct interest in getting this done. > > > > > > How about we chip in and develop an std..graphs module for Phobos > > > with > > > > > > different traversal and shortest-path algorithms? > > > > > [...] > > > > > > > > > > +1. With D's generic programming abilities, we *should* have a > generic > > > > > graph interface. Perhaps something along the lines of the range > > > > > interface (compile-time duck-typing). It'd be nice to have advanced > > > > > graph algorithms implemented in a generic way that can be used for > a > > > > > variety of applications. > > > > > > > > > > Personally I'd love to have a generic graph-coloring algorithm. > > > > > > > > > > > > > > > T > > > > > > > > > > -- > > > > > "Outlook not so good." That magic 8-ball knows everything! I'll ask > > > about > > > > > Exchange Server next. -- (Stolen from the net) > > > > > > > > > > > > > > > > > > > > > -- > > > > Bye, > > > > Gor Gyolchanyan. > > > > > > -- > > > What do you get if you drop a piano down a mineshaft? A flat minor. > > > > > > > > > > > -- > > Bye, > > Gor Gyolchanyan. > > -- > Prosperity breeds contempt, and poverty breeds consent. -- Suck.com > -- Bye, Gor Gyolchanyan.
