ultragraph 0.4.5

Hypergraph data structure.
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134

// SPDX-License-Identifier: MIT
// Copyright (c) "2023" . Marvin Hansen <marvin.hansen@gmail.com> All rights reserved.

#![forbid(unsafe_code)]

use std::marker::PhantomData;
use std::vec::IntoIter;

use crate::prelude::*;

#[derive(Debug, Copy, Clone)]
pub struct UltraGraphContainer<S, T>
    where
        S: GraphStorage<T>,
{
    storage: S,
    ty: PhantomData<T>,
}

impl<S, T> UltraGraphContainer<S, T>
    where
        S: GraphStorage<T>,
{
    pub fn new(storage: S) -> Self {
        Self {
            storage,
            ty: PhantomData,
        }
    }
}

impl<S, T> GraphStorage<T> for UltraGraphContainer<S, T>
    where
        S: GraphStorage<T>,
{
    fn size(&self) -> usize {
        self.storage.size()
    }

    fn is_empty(&self) -> bool {
        self.storage.is_empty()
    }

    fn number_nodes(&self) -> usize {
        self.storage.number_nodes()
    }

    fn number_edges(&self) -> usize {
        self.storage.number_edges()
    }

    fn get_all_nodes(&self) -> Vec<&T> {
        self.storage.get_all_nodes()
    }

    fn get_all_edges(&self) -> Vec<(usize, usize)> {
        self.storage.get_all_edges()
    }

    fn clear(&mut self) {
        self.storage.clear()
    }
}

impl<S, T> GraphRoot<T> for UltraGraphContainer<S, T>
    where
        S: GraphStorage<T>,
{
    fn add_root_node(&mut self, value: T) -> usize {
        self.storage.add_root_node(value)
    }

    fn contains_root_node(&self) -> bool {
        self.storage.contains_root_node()
    }

    fn get_root_node(&self) -> Option<&T> {
        self.storage.get_root_node()
    }

    fn get_root_index(&self) -> Option<usize> {
        self.storage.get_root_index()
    }

    fn get_last_index(&self) -> Result<usize, UltraGraphError> {
        self.storage.get_last_index()
    }
}

impl<S, T> GraphLike<T> for UltraGraphContainer<S, T>
    where
        S: GraphStorage<T>,
{
    fn add_node(&mut self, value: T) -> usize {
        self.storage.add_node(value)
    }

    fn contains_node(&self, index: usize) -> bool {
        self.storage.contains_node(index)
    }

    fn get_node(&self, index: usize) -> Option<&T> {
        self.storage.get_node(index)
    }

    fn remove_node(&mut self, index: usize) -> Result<(), UltraGraphError> {
        self.storage.remove_node(index)
    }

    fn add_edge(&mut self, a: usize, b: usize) -> Result<(), UltraGraphError> {
        self.storage.add_edge(a, b)
    }

    fn add_edge_with_weight(&mut self, a: usize, b: usize, weight: u64) -> Result<(), UltraGraphError> {
        self.storage.add_edge_with_weight(a, b, weight)
    }

    fn contains_edge(&self, a: usize, b: usize) -> bool {
        self.storage.contains_edge(a, b)
    }

    fn remove_edge(&mut self, a: usize, b: usize) -> Result<(), UltraGraphError> {
        self.storage.remove_edge(a, b)
    }

    fn shortest_path(&self, start_index: usize, stop_index: usize) -> Option<Vec<usize>>
    {
        self.storage.shortest_path(start_index, stop_index)
    }

    fn outgoing_edges(&self, a: usize) -> Result<IntoIter<usize>, UltraGraphError> {
        self.storage.outgoing_edges(a)
    }
}