Re: Help needed for ada package

> visiting each of her associates would be approx O(log N).
And visiting all the associates of each of those ...
IIRC Warshall's algorithm for transitive closure is O(n**3).
Is there a faster way?
.

Relevant Pages

  • Re: Help needed for ada package
    ... IIRC Warshall's algorithm for transitive closure is O. ... raytheon com. ...
    (comp.lang.ada)
  • Re: Help needed: Is Quick-Union-Find the right solution to this problem ?
    ... >> or an array of char structs to solve the issue. ... Google "Warshall algorithm" or ... >"transitive closure" to find lots of competing explanations of the ... >> The adjacency matrix must be mantained and updated according to user ...
    (comp.programming)
  • Re: Median algorithm
    ... > How I can find median in T= Oint the worst case? ... The algorithm is called "`k'th smallest selection" and, IIRC, is described ...
    (comp.programming)
  • Car suggestions
    ... He's got approx £700 IIRC to buy a car ... Best bet IMO is something like V6 Omega or a Cosworth ...
    (uk.rec.cars.modifications)
  • Re: By value or by reference?
    ... >> IIRC, by reference. ... It uses a copy on write algorithm. ... I've heard theoretical rumblings about ...
    (comp.lang.python)