ConceptWCC / Weakly Connected Components / algo.WCC
Weakly Connected Components
A graph algorithm that partitions mutually reachable nodes into independent subgraphs, commonly used to identify connected groups and isolated modules within a graph structure.
Timeline (last 90 days)
Oct 18
Khoj uses FalkorDB's built-in graph algorithms: it runs weakly connected components on the director-company graph to find hidden cliques, and uses betweenness centrality to identify key directors that bridge different companies.
Unverified50%