graphene 0.1.5

A general purpose, extensible Graph Theory data type and algorithm library for Rust.
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

use super::*;

fn all_edges_incident_on_the_vertices(
	desc: GraphDescription<u32,u32>,
	v1_cand: u32, v2_cand: u32)
	-> bool
{
	GraphMock_init(&desc, |g|{
		
		if desc.values.len() == 0 {
			// If the description says the graph has no vertices,
			// then there can be no edges between the two given vertices,
			// since they are not part of the graph.
			return g.edges_between(v1_cand,v2_cand).len() == 0;
		}
		
		let v1 = appropriate_vertex_value_from_index(&desc, v1_cand as usize);
		let v2 = appropriate_vertex_value_from_index(&desc, v2_cand as usize);
		
		let edges_between = g.edges_between(v1,v2);
		let edges_between_len = edges_between.len();
		
		let valid_edges = edges_between.into_iter().filter(|e| {
			(e.source == v1 && e.sink == v2) ||
				(e.source == v2 && e.sink == v1)
		}).collect::<Vec<_>>();
		
		edges_between_len == valid_edges.len()
	})
}

fn all_incident_edges_in_desc_found_in_graph(
	desc: GraphDescription<u32,u32>,
	v1_cand: u32, v2_cand: u32)
	-> bool
{
	holds_if!(desc.values.len() == 0);
	
	GraphMock_init(&desc, |g|{
		let v1 = appropriate_vertex_value_from_index(&desc, v1_cand as usize);
		let v2 = appropriate_vertex_value_from_index(&desc, v2_cand as usize);
		
		let inc_edges = desc.edges_by_value().into_iter().filter(|&(so,si,_)|{
			(so == v1 && si == v2) ||
				(so == v2 && si == v2)
		}).collect();
		
		edges_sublistof_graph(&inc_edges, &g)
	})
}



quickcheck!{
	fn PROP_all_edges_incident_on_the_vertices(
		desc: GraphDescription<u32,u32>,
		v1_cand: u32, v2_cand: u32)
		-> bool
	{
		all_edges_incident_on_the_vertices(desc,v1_cand, v2_cand)
	}
	
	fn PROP_all_incident_edges_in_desc_found_in_graph(
		desc: GraphDescription<u32,u32>,
		v1_cand: u32, v2_cand: u32)
		-> bool
	{
		all_incident_edges_in_desc_found_in_graph(desc,v1_cand, v2_cand)
	}
}