forky_core 0.2.0

Rust Utilities
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

use crate::prelude::*;
use extend::ext;
use std::collections::HashSet;

pub type NodeGraph = Vec<Node>;

#[ext]
pub impl NodeGraph {
	fn clear_links(&mut self) {
		for node in self.iter_mut() {
			node.links.clear();
		}
	}
	fn is_linked(&self, a: usize, b: usize) -> bool {
		if a >= self.len() || b >= self.len() {
			return false;
		}
		self[a].links.contains(&b)
	}


	fn link_randomly(&mut self, possibilities: &NodeGraph) {
		self.clear_links();
		let mut to_link: Vec<(usize, usize)> = Vec::new();
		for (i, node) in possibilities.iter().enumerate() {
			for neighbor in node.links.iter() {
				if random_value() < 0.5 {
					to_link.push((i, neighbor.clone()));
				}
			}
		}
		to_link.iter().for_each(|(a, b)| self.link(*a, *b));
	}


	fn link(&mut self, a: usize, b: usize) {
		self[a].links.insert(b);
		self[b].links.insert(a);
	}
	fn unlink(&mut self, a: usize, b: usize) {
		self[a].links.remove(&b);
		self[b].links.remove(&a);
	}

	fn next_unvisited(
		&self,
		i: usize,
		visited: &HashSet<usize>,
	) -> Option<&usize> {
		self[i]
			// ._get(i)
			.links
			.iter()
			.filter(|n| !visited.contains(n))
			.next()
	}
}


#[derive(Clone, Debug, Default)]
pub struct Node {
	// id:usize,
	pub links: HashSet<usize>,
}

impl Node {
	pub fn new() -> Node {
		Node {
			// id,
			links: HashSet::new(),
		}
	}
}