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
// extern crate rand;
// extern crate time;
// extern crate getopts;
// extern crate timely;
// extern crate graph_map;
// extern crate differential_dataflow;
//
// use differential_dataflow::sort::radix_merge::Accumulator;
//
// use graph_map::GraphMMap;
//
// type Node = u32;
// type Edge = (Node, Node);
//
// fn main() {
// let graph = GraphMMap::new("/Users/mcsherry/Projects/Datasets/twitter-dedup");
// // let mut merge = RadixMerge::new(Rc::new(|x: &u32| *x as u64));
//
// let parts = 256;
//
// let mut merges = vec![];
// for _ in 0..parts {
// merges.push(Accumulator::new());
// }
//
// let func = |&x: &_| x as u64;
//
// let mut node_counter = 0u64;
// let mut edge_counter = 0u64;
// for node in 0..graph.nodes() {
// node_counter += 1;
// let edges = graph.edges(node);
// for &dest in edges { merges[node % parts].push(node as u32, dest, 1, &func); }
// for &dest in edges { merges[dest as usize % parts].push(dest, node as u32, 1, &func); }
// edge_counter += 2 * edge_counter;
// }
// println!("nodes: {}", node_counter);
// println!("edges: {}", edge_counter);
// println!("d_avg: {}", edge_counter as f64 / node_counter as f64);
//
// for merge in merges.into_iter() {
// merge.done(&func);
// }
// }