Search questions…
⌘
K
English
Tiếng Việt
日本語
한국어
Español
العربية
বাংলা
čeština
Dansk
Deutsch
Ελληνικά
Suomi
Français
Gaeilge
ગુજરાતી
Hausa
हिन्दी
Hrvatski
Magyar
Bahasa Indonesia
Italiano
Basa Jawa
ქართული
Lietuvių
मराठी
Melayu
Malti
नेपाली
Nederlands
Norsk
ਪੰਜਾਬੀ
Polski
Português
Română
Русский
Slovenščina
Shqip
Svenska
Kiswahili
தமிழ்
తెలుగు
ภาษาไทย
Türkçe
اردو
简体中文
flow
Home
Topics
Categories
Learning paths
Search
Home
/
#Graphs
#Graphs
9 questions
How do you represent a graph: adjacency list vs adjacency matrix?
Data Structures
#complexity
Middle
›
What are weighted and directed graphs, and what problems do they model?
Data Structures
#complexity
Senior
›
What is a disjoint-set (union-find) structure with path compression and union by rank?
Data Structures
#complexity
Senior
›
What is breadth-first search (BFS)?
Algorithms
#graphs
Middle
›
What is depth-first search (DFS)?
Algorithms
#graphs
Middle
›
How do Dijkstra and Bellman-Ford find shortest paths?
Algorithms
#graphs
Senior
›
What is topological sorting?
Algorithms
#graphs
Senior
›
How do Kruskal and Prim build a minimum spanning tree?
Algorithms
#graphs
Senior
›
What is union-find and where is it used?
Algorithms
#graphs
Senior
›