DFS and BFS finder + Graph connectivity
Альтернативный экзамен :: Реализация программы-калькулятора для вычисления характеристик случайных графов / Alternative exam :: Implementation of program for calculating characteristics of random graphs
Compute a Eulerian trail (Eulerian path) through a graph iff one exists
Реализация программы-калькулятора для вычисления характеристик случайных графов // Implementation of program for calculating characteristics of random graphs
Add a description, image, and links to the graph-connectivity topic page so that developers can more easily learn about it.
To associate your repository with the graph-connectivity topic, visit your repo's landing page and select "manage topics."