Switch to English?
Yes
Переключитись на українську?
Так
Переключиться на русскую?
Да
Przełączyć się na polską?
Tak
Condition: Develop a program that reads numbers N, M (1 < N, M < 256) from the keyboard - the number of vertices and edges of the graph; a sequence of M pairs of integers - edges of the graph. The program stores the graph - an adjacency list and performs an algorithm on it - to determine whether the given graph is a tree or a forest.
Work details
Added 6 June 2024
187 views
Freelancer
Viktoriia Roslav
Ukraine Kharkiv
No reviews

Available for hire Available for hire
On the service 2 years