+ 1


I want a program with good explanation on graphs . <Redacted. No personal contact information please>

7th Apr 2018, 2:41 PM
Amidkhon - avatar
2 Answers
There are many many algorithms on graphs. Here are a few that you can search. Dfs, bfs, spfa, Dijkstra, Floyd, bellman Ford. There are Prim and Krystal for msts. To represent graphs. Just represent the node and it's adjacent. Or just use a list of edges. solo learn uses a graph to maintain followers. Person A follows person B which means that A is connected to B
10th Sep 2019, 1:18 AM
Leon Yang
Leon Yang - avatar