Which topics of graphs are important for INOI ???
Which of these DFS applications is important:->
- Finding Connected Components
- Cycle Detection
- Topological Sorting
- Finding Strongly Connected Components (SCC)
- Detecting Bipartite Graphs
- Articulation Points and Bridges
- Finding Back Edges (Cycle Detection)
- Path Finding
What variations of dijikstra , bellman ford , floyd warshall algorithms are important??
Any other important algorithms for INOI ??