Skip to content
This package was removed from CRAN on 2025-12-25. Its history is shown below.
Reason: issues were not addressed in time
Details below reflect version 0.1.4, its last release before removal.

SFS

0.1.4

Similarity-First Search Seriation Algorithm

0packages depend
downloads / year
test coverage
checks pass

Overview

About
Maintained by Utz-Uwe Haus4 releasesCRAN page ↗

An implementation of the Similarity-First Search algorithm (SFS), a combinatorial algorithm which can be used to solve the seriation problem and to recognize some structured weighted graphs. The SFS algorithm represents a generalization to weighted graphs of the graph search algorithm Lexicographic Breadth-First Search (Lex-BFS), a variant of Breadth-First Search. The SFS algorithm reduces to Lex-BFS when applied to binary matrices (or, equivalently, unweighted graphs). Hence this library can be also considered for Lex-BFS applications such as recognition of graph classes like chordal or unit interval graphs. In fact, the SFS seriation algorithm implemented in this package is a multisweep algorithm, which consists in repeating a finite number of SFS iterations (at most n sweeps for a matrix of size n). If the data matrix has a Robinsonian structure, then the ranking returned by the multistep SFS algorithm is a Robinson ordering of the input matrix. Otherwise the algorithm can be used as a heuristic to return a ranking partially satisfying the Robinson property.

Install

Health

CRAN checks

CRAN check results are not tracked yet.

Code health
None
Tests · ratio 0.00
not tracked
Coverage
1
Dependencies · direct

Documentation

Documentation
READMEYes · 80 wordsVignettesNopkgdown siteNoNEWSNoCode of conductNoContributing guideNo
Examples that run
100%
Documented parameters
not tracked
Return-value docs
not tracked
References docs
50%

Downloads

Daily download trend is not available in this view yet.
Also on346 r2u12 autocran

Dependencies

Declared dependencies
4 external dependencies (excludes base and recommended)
Depends (0)
none
Imports (1)
LinkingTo (2)
Suggests (1)
Enhances (0)
none
Reverse dependencies
0direct
indirect (not tracked)

Nothing depends on this yet.

Code & Tests

People & History

People (3)
Maintainer (1)
Author, Maintainer, Copyright holder
Authors (2)
Author, Maintainer, Copyright holder
Author, Copyright holder
Contributors (1)
Contributor · added in 0.1.2
Copyright holders (2)
Author, Maintainer, Copyright holder
Author, Copyright holder
Package Timeline

4 releases. Pick two to compare their code metrics. R releases are shown for context.

  • R
    R 4.6.0 released · 2026-04-24
  • archivedRemoved from CRAN
    2025-12-25
    issues were not addressed in time
  • R
    R 4.5.0 released · 2025-04-11
  • R
    R 4.4.0 released · 2024-04-24
  • R
    R 4.3.0 released · 2023-04-21
  • R
    R 4.2.0 released · 2022-04-22
  • R
    R 4.1.0 released · 2021-05-18
  • R
    R 4.0.0 released · 2020-04-24
  • 0.1.4
    2019-05-07 · diff ↗
  • R
    R 3.6.0 released · 2019-04-26
  • R
    R 3.5.0 released · 2018-04-23
  • 0.1.2
    2017-07-10 · diff ↗
  • 0.1.1
    2017-06-21 · diff ↗
  • 0.1
    2017-06-20
  • R
    R 3.4.0 released · 2017-04-21

Package metadata

Total releases
4
License
GPL-3 OSI
Download size
not tracked yet
Installed size
not tracked yet
With dependencies
not tracked yet

Cite

Cite this package

Run in R for the authors' preferred citation:

citation("SFS")
Seminaroti, M., Haus, U., & Laurent, M. (n.d.). SFS: Similarity-First Search Seriation Algorithm (Version 0.1.4) [Computer software]. Retrieved August 14, 2026, from https://CRAN.R-project.org/package=SFS

This is what citation() produces when a package has no citation file of its own. If it prints something else, use that.

Cite the R Observatory

For a number measured here: a download total, a coverage figure, an archival date.

APA

Balamuta, J. J. (2026). R Observatory: Metrics for SFS version 0.1.4 [Data set]. HJJB, LLC. Data release v2026-08-13. https://doi.org/10.5281/zenodo.21843040

From data release v2026-08-13, which the citation names so these numbers can be found later. More on citing and the projects behind them.

Report a problem with this page →

Privacy choices

These apply to this browser and are stored on this device only. Nothing about your choice is sent to us.

Read the privacy policy