Graphs Data Structure Questions

Which of the following operations is typically less efficient with an edge list representation compared to an adjacency matrix?

In an undirected graph represented using an incidence matrix, what would be the sum of the values in a single column?

Which of the following algorithms can handle negative weights in a weighted graph without issues?

Social media platforms utilize graph analysis to detect communities or clusters of users with shared interests. What graph concept is employed to identify these densely connected groups?

Which algorithm is more suitable for finding the shortest path in a graph with negative edge weights?

Prim's algorithm for finding the MST starts with an arbitrary vertex. Does the choice of the starting vertex affect the final MST found?

If a graph has negative weight cycles, what can we say about finding the shortest path?

Which graph traversal algorithm is most efficient for detecting cycles in a directed graph, crucial for identifying dependencies in a project management system?

You are tasked with designing a system to schedule tasks with dependencies between them. What graph data structure would be most appropriate to represent these dependencies?

In a weighted graph representing a road network with construction delays (represented by negative weights), what does finding the 'shortest path' mean?