if it has some well-known name that I could
> | have Googled, I'll just call it a dependency queue. It's like a
> | priority queue except instead of a strict ordering of items by
> | priority, there is only a topological ordering (like you would have in
> | a directed acyclic graph)
"Carl Banks" <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]
| I'm looking for any information about a certain kind of dynamic data
| structure. Not knowing if it has some well-known name that I could
| have Googled, I'll just call it a dependency queu
Carl Banks wrote:
> I'm looking for any information about a certain kind of dynamic data
> structure. Not knowing if it has some well-known name that I could
> have Googled, I'll just call it a dependency queue. It's like a
> priority queue except instead of a
I'm looking for any information about a certain kind of dynamic data
structure. Not knowing if it has some well-known name that I could
have Googled, I'll just call it a dependency queue. It's like a
priority queue except instead of a strict ordering of items by
priority,
