AI engineering glossary · Data structures algorithms
What is bipartite graph?
Bipartite graph: A graph whose vertices can be split into two groups so that every edge joins a vertex in one group to a vertex in the other. It can be tested by colouring vertices with two colours using traversal.
Bipartite graph: an example
Students on one side and courses on the other, with edges for enrolment, form a bipartite graph because no edge joins two students.
Related terms
More Data structures algorithms terms
- Bloom filter
- Breadth-first search
- Bubble sort
- Call stack
- Circular buffer
- Coin change problem
- Collision
- Comparison sort
Where you learn it
Bipartite graph is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.