saboten 0.0.1

Provides biedged graphs, cactus graphs and trees, and an algorithm for finding ultrabubbles in variation graphs.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63

use serde::{Deserialize, Serialize};

#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub enum Snarl {
    ChainPair { x: u64, y: u64 },
    BridgePair { x: u64, y: u64 },
}

#[derive(
    Debug,
    Clone,
    Copy,
    PartialEq,
    Eq,
    PartialOrd,
    Ord,
    Hash,
    Serialize,
    Deserialize,
)]
pub struct ChainPair {
    pub x: u64,
    pub y: u64,
}

#[derive(
    Debug,
    Clone,
    Copy,
    PartialEq,
    Eq,
    PartialOrd,
    Ord,
    Hash,
    Serialize,
    Deserialize,
)]
pub struct Ultrabubble {
    pub start: u64,
    pub end: u64,
}

#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct BridgePair {
    pub x: u64,
    pub y: u64,
}

#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct ChainEdge {
    pub net: u64,
    pub chain: u64,
}

impl Snarl {
    pub fn chain_pair(x: u64, y: u64) -> Self {
        Snarl::ChainPair { x, y }
    }

    pub fn bridge_pair(x: u64, y: u64) -> Self {
        Snarl::BridgePair { x, y }
    }
}