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
// SPDX-License-Identifier: MIT
// Copyright (c) "2023" . Marvin Hansen <marvin.hansen@gmail.com> All rights reserved.
use crate;
/// Returns a new UltraGraph with matrix storage backend.
/// Default capacity is 500 nodes.
///
/// # Example:
/// ```
/// use ultragraph::prelude::*;
///
/// #[derive(Debug, Copy, Clone, Hash, Eq, PartialEq)]
/// pub struct Data {
/// x: u8,
/// }
///
/// let mut g = ultragraph::new::<Data>();
/// assert!(g.is_empty());
///
/// let d = Data { x: 1 };
/// let root_index = g.add_root_node(d);
/// assert_eq!(root_index, 0);
///
/// let d = Data { x: 42 };
/// let node_a_index = g.add_node(d);
/// assert_eq!(node_a_index, 1);
///
/// let data = g.get_node(1).unwrap();
/// assert_eq!(data.x, d.x);
///
/// let res = g.add_edge(root_index, node_a_index);
/// assert!(res.is_ok());
/// ```
/// Returns a new UltraGraph with matrix storage backend.
///
/// # Arguments
/// * Capacity refers to the maximum number of nodes that fit into the graph before a resize occurs.
///
/// # Example:
/// ```
/// use ultragraph::prelude::*;
///
/// #[derive(Debug, Copy, Clone, Hash, Eq, PartialEq)]
/// pub struct Data {
/// x: u8,
/// }
///
/// let mut g = ultragraph::with_capacity::<Data>(10);
/// assert!(g.is_empty());
///
/// let d = Data { x: 1 };
/// let root_index = g.add_root_node(d);
/// assert_eq!(root_index, 0);
///
/// let d = Data { x: 42 };
/// let node_a_index = g.add_node(d);
/// assert_eq!(node_a_index, 1);
///
/// let data = g.get_node(1).unwrap();
/// assert_eq!(data.x, d.x);
///
/// let res = g.add_edge(root_index, node_a_index);
/// assert!(res.is_ok());
/// ```