Re: Help needed for ada package

tmoran@xxxxxxx wrote: 

  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?

I thought the requirement was only to visit all the associates of the highest rated individual. If you have to visit associates of associates of associates of ... then it becomes a little more time intensive.

--
Jeffrey Carter
"Now go away or I shall taunt you a second time."
Monty Python and the Holy Grail
E-mail: jeffrey_r_carter-nr [commercial-at]
        raytheon [period | full stop] com
.

Relevant Pages

  • Re: Help needed for ada package
    ... > visiting each of her associates would be approx O. ... IIRC Warshall's algorithm for transitive closure is O. ...
    (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)
  • 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)
  • Re: Encryption/Decryption in Delphi :: |-|ow
    ... IIRC, the normal testing of a strong algorithm involves providing the clear ... Also, IIRC, a one time pad is not virtually impossible to crack, it _is_ ...
    (comp.lang.pascal.delphi.misc)