The modified deep first search algorithm: functional implementation
Copyright policy )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 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.
- Moldova State University Moldova (Republic of)
- Information Society Development Institute Moldova (Republic of)
undirected and biconnected graphs, fundamental cycles, spanning tree, spanningtree, Electronic computers. Computer science, $dfs$, functional programming, QA75.5-76.95, DFS, cut vertices
undirected and biconnected graphs, fundamental cycles, spanning tree, spanningtree, Electronic computers. Computer science, $dfs$, functional programming, QA75.5-76.95, DFS, cut vertices
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!