#graph

three-edge-connected

Library and CLI tool for finding 3-edge-connected components of graphs, especially graphs in the GFA format

4 releases

0.2.2 Jun 29, 2021
0.2.1 Nov 24, 2020
0.2.0 Nov 24, 2020
0.1.0 Oct 4, 2020

#243 in #graph

Download history 17/week @ 2023-07-18 15/week @ 2023-07-25 9/week @ 2023-08-01 15/week @ 2023-08-08 20/week @ 2023-08-15 129/week @ 2023-08-22 24/week @ 2023-08-29 27/week @ 2023-09-05 20/week @ 2023-09-12 14/week @ 2023-09-19 15/week @ 2023-09-26 13/week @ 2023-10-03 10/week @ 2023-10-10 23/week @ 2023-10-17 18/week @ 2023-10-24 20/week @ 2023-10-31

74 downloads per month
Used in 2 crates (via saboten)

MIT license

16KB
327 lines

GFA 3-Edge-Connectivity

Finds the 3-edge-connected components of a bridgeless graph in defined in GFA. Output is one component per line, as a space-delimited list of GFA segment names.

Usage

$ ./three-edge-connected --help
three-edge-connected 0.1.0
Finds the 3-edge-connected components in a graph. Input must be a bridgeless graph in the GFA format. Output is a list
of 3-edge-connected components, one per line, as space-delimited lists of segment names

USAGE:
    three-edge-connected [FLAGS] [OPTIONS] --in-file <in-file> -s

FLAGS:
    -h, --help       Prints help information
    -s               If true, read input GFA on stdin
    -V, --version    Prints version information

OPTIONS:
    -i, --in-file <in-file>      GFA file to use, must be present if not reading from stdin
    -o, --out-file <out-file>    Output file. If empty, writes on stdout


$ ./three-edge-connected -i some.gfa -o output
$ ./three-edge-connected -i some.gfa -s > output

Dependencies

~5–7MB
~103K SLoC