The modified deep first search algorithm: functional implementation

The modified deep first search algorithm: functional implementation

The article includes the modified deep first search algorithm (DFS) that allows, at a single traversal of a graph, to check its connectivity/biconnectivity, highlight the cut vertices, and build the spanning tree, the biconnected components, and the fundamental set of cycles. The proposed algori...

Full description

Saved in:
Bibliographic Details
Main Author: Constantin Ciubotaru
Format: Article
Language:English
Published: Vladimir Andrunachievici Institute of Mathematics and Computer Science 2025-04-01
Series:Computer Science Journal of Moldova
Subjects:
undirected and biconnected graphs
spanning tree
$dfs$
cut vertices
fundamental cycles
functional programming
Online Access:https://www.math.md/files/csjm/v33-n1/v33-n1-(pp129-140).pdf
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://www.math.md/files/csjm/v33-n1/v33-n1-(pp129-140).pdf

Similar Items