A graph is a set of vertices connected by edges (directed or undirected, weighted or unweighted), stored as an adjacency matrix or list. Key algorithms: BFS, DFS, Dijkstra, Bellman–Ford, Prim, Kruskal, topological sort.
Loading subject content…
Loading subject content…
A graph is a set of vertices connected by edges (directed or undirected, weighted or unweighted), stored as an adjacency matrix or list. Key algorithms: BFS, DFS, Dijkstra, Bellman–Ford, Prim, Kruskal, topological sort.