Sort graph choices by job

Place each graph job into the choice that best fits it. Edge list Adjacency list Adjacency matrix or pair index BFS traversal Import a nightly file of source-target relationships Run a batch audit over every relationship exactly once Show all accounts reachable directly from one user Expand neighbors repeatedly in a sparse delegation graph Answer many questions of the form: does edge A -> B exist? Represent a dense graph where most vertex pairs are connected Find the fewest-hop path in an unweighted network Visit nodes in increasing distance layers from a starting node

Sign up free — one personalized lesson every day, matched to your role and goals.

Already have an account? Sign in