<
>
<
> The chart is not really "correct" there: What Im, looking for are all (or at least the greatest) subgraphs that connect all to all of its component nodes bidirectionally (i.e. where each vertex represents that A trusts B and vice-versa, meaning that all nodes trust all nodes). In the chart above, @gmaxwell and @suchmoon are clearly not in that situation with the rest.
Besides, the Network charting tool, as it is, is good for representing unidirectional vertices, but not bidirectional vertex with the data as I have it represented there. Perhaps if I were to create another representation, with a database that loaded only bidirectional vertex it would lead to a clearer representation (I may look into it later on). What the above char is showing are only unidirectional vertex representations currently (my char was correct only because I checked that all those relations I marked as bidirectional were so).
-> Something like this would be better:
https://www.google.com/fusiontables/DataSource?docid=18y8mSJwCj7jWpaVGZoVFyXE4WpSPaaQQTJr_3Uf0-> All vertices are bidirectional (A trusts B and B trusts A).
-> Hover over a node to get a clearer view of the vertices.
-> Since the filter already has 5 different names added to it, to work on another different set you need to reset the filter by deleting it (with the cross) and adding it back on from the filter dropdown.
-> Enter a number of nodes greater than the max nodes (top left of chart) to see all nodes.
Full reciprocal bidirectional relationships (the larger the node, the more reciprocal relationships):
<
> Once you figured it out, will you share your algorithm? I can't think of a good way to do this.
If I manage to succeed..., which I'm now rather doubtful. Ive only got partial results so far and fear Im missing out combinations. Ill keep on it when I can get some linear time to do so. Not sure if this is going to be an np-complete kind of problem
Edit: I've tried a different alternative which looks good, based on native SQL Server node and vertex treatment. So far I've derived all complete subgraph (all trust all) for up to 6 nodes, deduplicating paths too (with unpivot and cursors...).
Just for test purposes, the complete (all trust all) largest subgraphs Ive managed to detect with you as a node are:
@Actmyname, @DarkStar_, @hilariousandco, @LoyceV, @suchmoon (charted in the above link)
@Actmyname, @hilariousandco, @LoyceV, @suchmoon, @The Pharmacist
Edit: found one more: @hilariousandco, @LoyceV, @marlboroza, @suchmoon, @The Pharmacist
I feel so out of it. I don't think I am in any trust or merit circles.<
>
Found this small all trust all "trust circle": @Jet Cash, @TMAN, @The Pharmacist, @Vod. My algorithm skipped it, but changing parameters it eventually detected it (which means it's not working too well yet).
These are all the 6 node complete subgraphs (all trust all)- derived with the new algoritm approach:
Funny , gysca , leancuisine , Operatr , P4ndoraBox7 , tennozer
CanadaBits , Funny , gysca , Operatr , P4ndoraBox7 , tennozer
CanadaBits , Funny , leancuisine , Operatr , tennozer , vCardVideo
CanadaBits , leancuisine , Operatr , P4ndoraBox7 , tennozer , vCardVideo
CanadaBits , Funny , leancuisine , P4ndoraBox7 , tennozer , vCardVideo
CanadaBits , Funny , gysca , leancuisine , Operatr , tennozer
devidLeench , natka , pisston , ssuchy , swetka , taktik
CanadaBits , gysca , leancuisine , Operatr , P4ndoraBox7 , tennozer
CanadaBits , Funny , gysca , leancuisine , Operatr , P4ndoraBox7
CanadaBits , Funny , leancuisine , Operatr , P4ndoraBox7 , tennozer
Bazinga442 , Deena , DutchFinity , endlasuresh , gwsukabokepjepang , Thule
CanadaBits , Funny , gysca , leancuisine , P4ndoraBox7 , tennozer
Funny , leancuisine , Operatr , P4ndoraBox7 , tennozer , vCardVideo
marlboroza , owlcatz , qwk , suchmoon , The Pharmacist , xtraelv
CanadaBits , Funny , Operatr , P4ndoraBox7 , tennozer , vCardVideo
CanadaBits , Funny , leancuisine , Operatr , P4ndoraBox7 , vCardVideo
Note that some are really subsets of a 7 node subgraph.
