- Algorithms
- Recursion
- Call Stack
- Iterative Approach
- Memoization
- Head Tail
- Data Structures
- Arrays, Sets
- Time Complexity
- Hash Tables
- Stacks
- Queues
- Linked Lists
- Binary Search Trees
- Tries
- Graphs ♣
- Divide Conquer
- Binary Search
- Quicksort
- Merge Sort
- Karatsuba Multiplication
- Graph Traversal
- Flood Fill
- Depth First Search
- Breadth First Search
- Dijkstra's Algorithm
- Decision Making
- Minimax
Data Structures / Graphs »
A graph is a data structure specialized in relationships. A graph can be implemented as an object oriented class. The name for a node in a graph is vertex. Vertices are the lines (edges) between vertices.
What is a graph? How can we implement a graph? How are nodes called in graph's jargon? What are vertices?
Click to Flip Card