Questions

• Connected components:
• What do you think would happen if you ran the strongly connected component algorithm on an undirected projected graph?
• How will the community structure of the test graph change if we add a relationship from D to C? Or if we remove the relationship from D to E?
• Label propagation:
• Update our algorithm implementation to take into account seeds, that is, prior knowledge about the node community.