User:Quequero/Facebook Friends Search Algorithm

From UIC

• Simplest method to find (not track down) a cycle in an undirected graph is to count the number of vertices (|V|) and the number of edges (|E|), if |E| > |V|-1 the graph contains at least one cycle (interesting to note that if |E| = |V|-1 then the graph has precisely one MST (Mimimum Spanning Tree), the graph itself).
• Strongly connected components for neighbor search?
• DFS for friends?
• Connected components