research
Wednesday, May 18, 2005
transitive closure algorithm
http://www.boost.org/libs/graph/doc/transitive_closure.html
The time complexity (worst-case) is
O(|V||E|)
.
posted by Q.Wang at
7:10 PM
0 Comments:
Post a Comment
<< Home
About Me
Name:
Q.Wang
View my complete profile
Previous Posts
mono
iMode
random number generation
literate programming
euclidean graph
graph tools
xml and grid computing in today's zdnet
scientific linux
InfiniBand
maximum common graph
0 Comments:
Post a Comment
<< Home