Re: Propagating data through dependencies

What I meant was that you use all b's to generate the max date for B (used as input for its dependencies) but simply bundle all b's into B's bill. You can't bill them before or after B because they're effectively line items on B. -- You received this message because you are subscribed to t

Re: Propagating data through dependencies

Nice thanks, I didn't know propaganda. I am not sure if it applies to this problem, but it looks interesting so I'll have a look. On Friday, May 16, 2014 12:10:29 AM UTC+2, François Rey wrote: > > I'm not sure I totally understand your use case, but somehow it sounds > like these libraries may

Re: Propagating data through dependencies

Yeah maybe, but both b and B should basically be billed at max of their associated dates, which might affect the things that depend on B. So I don't think b can be dropped completely. On Thursday, May 15, 2014 11:30:35 PM UTC+2, David Pidcock wrote: > > If, say C cannot depend on any b directly,

Re: Propagating data through dependencies

On Thursday, May 15, 2014 11:18:31 PM UTC+2, David Pidcock wrote: > You said b can't be billed after B. But it sounds like it can't be billed > before. > > Say b is ready at 1, can you bill it at 1 and then B at 2? > They should actually be billed at the same time (yeah, I didn't explain that

Re: Propagating data through dependencies

I'm not sure I totally understand your use case, but somehow it sounds like these libraries may be of interest to you: propaganda prismatic graph -- You received this message because you are subscribed to the Google Grou

Propagating data through dependencies

If, say C cannot depend on any b directly, (I.e. C can only depend on B), and your domain rules say you can only bill for all b's when you bill B, then really you have a self contained sub-graph with only one bill date for the root node B. You can simply ignore backfilling the billing date for b

Propagating data through dependencies

You said b can't be billed after B. But it sounds like it can't be billed before. Say b is ready at 1, can you bill it at 1 and then B at 2? Anyway, my first thought was using weights on the edges equal to the duration between the dependencies and use a max cost on the graph. But calculating

Propagating data through dependencies

This is not strictly a Clojure question, but I'll ask it here since I am solving it in Clojure. I have already made one solution which works, but I am interested in whether there are other and better approaches. I have a number of different products and some are dependant on others: A <- B B <