Browsing by Author "Ciubotaru, Constantin"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Thumbnail Image
    Item
    Some Applications of the Depth-First Search Algorithm for Undirected Graphs [Articol]
    (2024) Ciubotaru, Constantin
    Applications of the deep first search algorithm (DFS) have been developed that allow at a single traversal of the graph: a) to check the connectivity/biconnectivity of the graph, b) to build the spanning tree, c) to highlight the cut vertices, d) to calculate the biconnected components, e) to build the fundamental set of cycles.The proposed algorithms were programmed and tested.