tag:blogger.com,1999:blog-8935780327334775165.post7381002999550153742..comments2023-08-07T22:48:57.800+08:00Comments on Entity Crisis: Walking a GraphUnknownnoreply@blogger.comBlogger3125tag:blogger.com,1999:blog-8935780327334775165.post-65908525232261466252007-03-17T15:21:00.000+09:002007-03-17T15:21:00.000+09:00Oops, yes, the perils of cut and paste. :) That me...Oops, yes, the perils of cut and paste. :) That method certainly won't work as expected!Simon Wittberhttps://www.blogger.com/profile/02730025645144151014noreply@blogger.comtag:blogger.com,1999:blog-8935780327334775165.post-25873767468957321362007-03-17T00:52:00.000+09:002007-03-17T00:52:00.000+09:00That's certainly an interesting block of code. I w...That's certainly an interesting block of code. I wouldn't have expected Composite.remove to call extend.fumanchuhttps://www.blogger.com/profile/12100140919727858844noreply@blogger.comtag:blogger.com,1999:blog-8935780327334775165.post-43059890526637846452007-03-17T00:01:00.000+09:002007-03-17T00:01:00.000+09:00So, who wants to help build a super fast depth fir...<I>So, who wants to help build a super fast depth first traversal algorithm? :-)</I><BR/><BR/>I would find this quite interesting. I'm currently trying various implementation techniques for the Rete algorithm (which also uses a DAG) to be used in a small (100% Python) Rule Engine.<BR/><BR/>I've not yet started to worry about speed since I'm still trying to get all of the Rete functionality in place but when I do, I'd most definitely be interested in trading tips and tricks... or possibly just copy whatever you concluded is the best :-)Johan Lindberghttps://www.blogger.com/profile/13455767001846504270noreply@blogger.com