Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
The modified deep first search algorithm: functional implementation
Authors: Ciubotaru Constantin
Keywords: undirected and biconnected graphs, spanning tree, $DFS$, cut vertices, fundamental cycles, functional programming.
– 0.32 Mb
Keywords: undirected and biconnected graphs, spanning tree, $DFS$, cut vertices, fundamental cycles, functional programming.
Abstract
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 algorithm was implemented and tested in a functional style using \textsc{Common LISP} language. \footnote{The project SIBIA 011301 has supported a part of this research.ORCID: https://orcid.org/0009-0005-8896-0966>https://orcid.org/0009-0005-8896-0966
Moldova State University,
Vladimir Andrunachievici Institute of Mathematics and Computer Science
E-mail: ,
Moldova State University,
Vladimir Andrunachievici Institute of Mathematics and Computer Science
E-mail: ,
DOI
https://doi.org/10.56415/csjm.v33.07Fulltext
– 0.32 Mb
Contents
- HTTP Security Headers Analysis of Several Macedonian Website Categories
- A Guidance Framework for Resolving Problems of Credit Card Churn Detection Systems
- An Approach to Recognizing and Digitizing Old Handwritten Documents with Mathematical Heterogeneous Content in Cyrillic script
- Integrating Recurrent Neural Networks and Loss Function Optimization for Efficient Indoor Camera Positioning
- Linked Data Lineage as a foundation of continuous data integration and modern data governance
- Secret Sharing Limitations Over Boolean Circuits
- The modified deep first search algorithm: functional implementation
- Proper Magic Sigma Coloring of Specific Graphs
