Graph Theory Basics
Understand graph theory concepts and their applications in computer science. Covers graph types, traversals, shortest paths, spanning trees, coloring, and network flow problems.
Usage
Ask about graph theory concepts, algorithms, or how to model your problem as a graph.
Examples
- "Explain Dijkstra's algorithm with an example"
- "What is the difference between BFS and DFS?"
- "How do I find the minimum spanning tree of a weighted graph?"
Guidelines
- Model your problem as a graph before choosing an algorithm
- Understand the time complexity of graph algorithms for your input size
- Use adjacency lists for sparse graphs and adjacency matrices for dense graphs
- Consider whether your graph is directed, weighted, or has cycles
- Visualize small examples to build intuition before scaling up