this repo has no description

Add README

+25
+25
README.md
··· 1 + # eyewall 2 + 3 + (WIP) App to crawl the bluesky post graph and find outlier graph components. 4 + 5 + There are three post graphs: 6 + 7 + - reply-only 8 + - quote-only 9 + - reply-quote 10 + 11 + We want to find weakly-connected components in all three graphs with: 12 + 13 + - a large number of nodes 14 + - a large depth (max path length from source to sink) 15 + - a large width (max size of an "antichain", or equivalently by [Dilworth's theorem](https://en.wikipedia.org/wiki/Dilworth%27s_theorem) the min number of chains needed to cover the subgraph) 16 + 17 + and maybe some other statistics. 18 + 19 + 20 + This allows you to find the largest/longest/widest reply trees, quote trees, and reply-quote subgraphs. 21 + 22 + 23 + ## Limitations 24 + 25 + Only knows about posts that are related via post graph, and nothing about posts that are semantically related but not graph-ically related (i.e. it doesn't see "subtweets").