Hi:
I am doing research on relationship of online
communities with each other.
For example, how book reading clubs are related with
Amazon.com's affiliate
program. With modeling using graph (node as community
and edge as relationship between two nodes),
I need an efficient algorithm for generating all
strongly connected
subgraphs (i.e., a subgraph that is SCC) of a given
directed graph. Any
help on this will be greatly appreciated. I feel that
this is possible,
but not an expert in combinatorial algorithm. Sincere
thanks in advance.
--Min
=====
__________________________________________________
Do You Yahoo!?
Bid and sell for free at http://auctions.yahoo.com
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|