diff --git a/docbrown/src/algorithms/mod.rs b/docbrown/src/algorithms/mod.rs
index 16ba737f..bf0d920e 100644
--- a/docbrown/src/algorithms/mod.rs
+++ b/docbrown/src/algorithms/mod.rs
@@ -37,6 +37,8 @@ pub mod pagerank;
 pub mod reciprocity;
 pub mod triangle_count;
 pub mod triplet_count;
+pub mod three_node_motifs;
+pub mod three_node_local;
 
 use num_traits::{abs, Bounded, Zero};
 use std::ops::{Add, AddAssign, Div, Mul, Range, Sub};
diff --git a/docbrown/src/algorithms/three_node_local.rs b/docbrown/src/algorithms/three_node_local.rs
new file mode 100644
index 00000000..ff87b170
--- /dev/null
+++ b/docbrown/src/algorithms/three_node_local.rs
@@ -0,0 +1,91 @@
+use std::collections::{HashMap};
+
+use crate::db::{
+    graph::Graph,
+    program::{GlobalEvalState, LocalState, Program},
+    view_api::*, edge::EdgeView,
+};
+use crate::algorithms::three_node_motifs::*;
+use rustc_hash::FxHashMap;
+
+pub fn star_motif_count<G:GraphViewOps>(graph:&G, v:u64, delta:i64) -> [usize;24] {
+    if let Some(vertex) = graph.vertex(v) {
+        let neigh_map : HashMap<u64,usize> = vertex.neighbours().iter().enumerate().map(|(num,nb)| (nb.id(), num) ).into_iter().collect();
+        let exploded_edges = vertex.edges()
+        .explode()
+        .map(|edge| if edge.src().id()==v {star_event(neigh_map[&edge.dst().id()],1,edge.time().unwrap())} else {star_event(neigh_map[&edge.src().id()],0,edge.time().unwrap())})
+        .collect::<Vec<StarEvent>>();
+        let mut star_count = init_star_count(neigh_map.len());
+        star_count.execute(&exploded_edges, 10);
+        star_count.return_counts()
+    }
+    else {[0;24]}
+}
+
+pub fn twonode_motif_count<G:GraphViewOps>(graph:&G, v:u64, delta:i64) -> [u64;8] {
+    let mut counts = [0;8];
+    if let Some(vertex) = graph.vertex(v) {
+        for nb in vertex.neighbours().iter() {
+            let nb_id = nb.id();
+            println!("edge {} {}",v, nb_id);
+            let out = graph.edge(vertex.id(), nb_id, None);
+            let inc = graph.edge(nb_id, vertex.id(),None);
+            let mut all_exploded = match (out,inc) {
+                (Some(o),Some(i)) => o.explode()
+                .chain(i.explode())
+                .map(|e| two_node_event(if e.src().id()==v {1} else {0}, e.time().unwrap()))
+                .collect::<Vec<TwoNodeEvent>>(),
+                (Some(o), None) => o.explode()
+                .map(|e| two_node_event(1, e.time().unwrap()))
+                .collect::<Vec<TwoNodeEvent>>(),
+                (None, Some(i)) => i.explode()
+                .map(|e| two_node_event(0, e.time().unwrap()))
+                .collect::<Vec<TwoNodeEvent>>(),
+                (None, None) => Vec::new()
+            };
+            all_exploded.sort_by_key(|e| e.time);
+            for e in &all_exploded {
+                println!("{} {}",e.dir, e.time);
+            }
+            let mut two_node_counter = init_two_node_count();
+            two_node_counter.execute(&all_exploded, delta);
+            let two_node_result = two_node_counter.return_counts();
+            for i in 0..8 {
+                counts[i]+=two_node_result[i];
+            }
+        }
+    }
+    counts
+}
+
+#[cfg(test)]
+mod local_motif_test {
+    use crate::db::graph::Graph;
+    use crate::algorithms::three_node_local::*;
+
+    #[test]
+    fn test_init() {
+        let graph = Graph::new(1);
+
+        let vs = vec![
+            (1, 2, 0),
+            (2, 1, 1),
+            (1, 4, 2),
+            (2, 3, 3),
+            (3, 2, 4),
+            (3, 1, 5),
+            (4, 3, 6),
+            (4, 1, 7),
+            (1, 5, 8),
+            (3, 1, 9),
+            (1, 2, 10)
+        ];
+        
+        for (src, dst, time) in &vs {
+            graph.add_edge(*time, *src, *dst, &vec![], None);
+        }
+
+        let counts = star_motif_count(&graph, 1, 100);
+        print!("{:?}",counts)
+    }
+}
\ No newline at end of file
diff --git a/docbrown/src/algorithms/three_node_motifs.rs b/docbrown/src/algorithms/three_node_motifs.rs
new file mode 100644
index 00000000..793948b7
--- /dev/null
+++ b/docbrown/src/algorithms/three_node_motifs.rs
@@ -0,0 +1,294 @@
+const incoming: usize = 0;
+const outgoing: usize = 1;
+const dirs2D: [(usize,usize);4] = [(0,0),(0,1),(1,0),(1,1)];
+
+fn map2D(d1:usize, d2:usize) -> usize {
+    2*d1 + d2
+}
+fn map3D(d1:usize, d2:usize, d3:usize) -> usize {
+    4*d1 + 2*d2 + d3
+}
+
+// Two Node Motifs
+pub struct TwoNodeEvent{
+    pub dir:usize,
+    pub time:i64,
+}
+pub struct TwoNodeCounter {
+    count1d:[u64;2],
+    count2d:[u64;4],
+    pub count3d:[u64;8],
+}
+
+pub fn two_node_event(dir:usize,time:i64) -> TwoNodeEvent {
+    TwoNodeEvent { dir: dir, time: time }
+}
+
+impl TwoNodeCounter {
+
+    pub fn execute(&mut self, events:&Vec<TwoNodeEvent>, delta: i64) {
+        let mut start = 0;
+        for event in events.iter() {
+            while events[start].time + delta < event.time {
+                self.decrement_counts(events[start].dir);
+                start +=1;
+            }
+            self.increment_counts(event.dir);
+        }
+    }
+
+    fn decrement_counts(&mut self, dir:usize) {
+        self.count1d[dir]-=1;
+        self.count2d[map2D(dir, incoming)] -= self.count1d[incoming];
+        self.count2d[map2D(dir,outgoing)] -= self.count1d[outgoing];
+    }
+
+    fn increment_counts(&mut self, dir:usize) {
+        // 3d counter
+        for (d1,d2) in dirs2D {
+            self.count3d[map3D(d1, d2, dir)] += self.count2d[map2D(d1, d2)];
+        }
+
+        // 2d counter
+        self.count2d[map2D(incoming,dir)]+=self.count1d[incoming];
+        self.count2d[map2D(outgoing, dir)]+=self.count1d[outgoing];
+        // 1d counter
+        self.count1d[dir]+=1;
+    }
+
+    pub fn return_counts(&self) -> [u64;8]{
+        self.count3d
+    }
+
+}
+
+pub fn init_two_node_count() -> TwoNodeCounter {
+    TwoNodeCounter {count1d:[0;2], count2d:[0;4], count3d:[0;8]}
+}
+
+// Star Motifs
+pub struct StarEvent{
+    nb:usize,
+    dir:usize,
+    time:i64,
+}
+
+pub fn star_event(nb:usize, dir:usize, time:i64) -> StarEvent {
+    StarEvent{nb:nb,dir:dir,time:time}
+}
+
+pub struct StarCounter{
+    N: usize,
+    pre_nodes:Vec<usize>,
+    post_nodes:Vec<usize>,
+    pre_sum:[usize;8],
+    mid_sum:[usize;8],
+    post_sum:[usize;8],
+    count_pre:[usize;8],
+    count_mid:[usize;8],
+    count_post:[usize;8],
+}
+impl StarCounter { 
+    fn push_pre(&mut self, cur_edge:&StarEvent) {
+        self.pre_sum[map2D(incoming, cur_edge.dir)] += self.pre_nodes[incoming*self.N + cur_edge.nb];
+        self.pre_sum[map2D(outgoing, cur_edge.dir)] += self.pre_nodes[outgoing*self.N + cur_edge.nb];
+        self.pre_nodes[cur_edge.dir*self.N + cur_edge.nb] += 1;
+    }
+
+    fn push_post(&mut self, cur_edge:&StarEvent) {
+        self.post_sum[map2D(incoming, cur_edge.dir)] += self.post_nodes[incoming*self.N + cur_edge.nb];
+        self.post_sum[map2D(outgoing, cur_edge.dir)] += self.post_nodes[outgoing*self.N + cur_edge.nb];
+        self.post_nodes[cur_edge.dir*self.N + cur_edge.nb] += 1;
+    }
+
+    fn pop_pre(&mut self, cur_edge:&StarEvent) {
+        self.pre_nodes[cur_edge.dir*self.N + cur_edge.nb]-=1;
+        self.pre_sum[map2D(cur_edge.dir, incoming)] -= self.pre_nodes[incoming*self.N + cur_edge.nb];
+        self.pre_sum[map2D(cur_edge.dir, outgoing)] -= self.pre_nodes[outgoing*self.N + cur_edge.nb];
+    }
+
+    fn pop_post(&mut self, cur_edge:&StarEvent) {
+        self.post_nodes[cur_edge.dir*self.N + cur_edge.nb]-=1;
+        self.post_sum[map2D(cur_edge.dir, incoming)] -= self.post_nodes[incoming*self.N + cur_edge.nb];
+        self.post_sum[map2D(cur_edge.dir, outgoing)] -= self.post_nodes[outgoing*self.N + cur_edge.nb];
+    }
+    
+    fn process_current(&mut self, cur_edge:&StarEvent) {
+        self.mid_sum[map2D(incoming, cur_edge.dir)] -= self.pre_nodes[incoming*self.N + cur_edge.nb];
+        self.mid_sum[map2D(outgoing, cur_edge.dir)] -= self.pre_nodes[outgoing*self.N + cur_edge.nb];
+
+        for (d1,d2) in dirs2D {
+            self.count_pre[map3D(d1, d2, cur_edge.dir)] += self.pre_sum[map2D(d1, d2)];
+            self.count_post[map3D(cur_edge.dir, d1, d2)] += self.mid_sum[map2D(d1, d2)];
+            self.count_mid[map3D(d1, cur_edge.dir, d2)] += self.mid_sum[map2D(d1, d2)];
+        }
+
+        self.mid_sum[map2D(cur_edge.dir, incoming)] += self.post_nodes[incoming*self.N + cur_edge.nb];
+        self.mid_sum[map2D(cur_edge.dir, outgoing)] += self.post_nodes[outgoing*self.N + cur_edge.nb];
+    }
+
+    pub fn execute(&mut self, edges:&Vec<StarEvent>, delta:i64) {
+        let L = edges.len();
+        if L < 3 {
+            return;
+        }
+        let mut start = 0;
+        let mut end = 0;
+        for j in 0..L {
+            while start < L && edges[start].time + delta < edges[j].time {
+                self.pop_pre(&edges[start]);
+                start+=1;
+            }
+            while (end < L) && edges[end].time <= edges[j].time + delta {
+                self.push_post(&edges[end]);
+                end+=1;
+            }
+            self.pop_post(&edges[j]);
+            self.process_current(&edges[j]);
+            self.push_pre(&edges[j])
+        }
+    }
+
+    pub fn return_counts(&self) -> [usize;24] {
+        let mut counts = [0;24];
+        for i in 0..8 {
+            counts[i] = self.count_pre[i];
+            counts[8+i] = self.count_mid[i];
+            counts[16+i] = self.count_post[i];
+        }
+        counts
+    }
+    
+}
+pub fn init_star_count(N:usize) -> StarCounter {
+    StarCounter {N:N, pre_nodes: vec![0;2*N], post_nodes: vec![0;2*N], pre_sum: [0;8], mid_sum: [0;8], post_sum: [0;8],
+         count_pre:[0;8], count_mid:[0;8], count_post:[0;8]}
+}
+
+// Triangle Motifs
+struct TriangleEdge{
+    uv_edge:bool,
+    uorv:usize,
+    nb:usize,
+    dir:usize,
+    time:i64,
+}
+struct TriangleCounter {
+    N:usize,
+    pre_nodes:Vec<usize>,
+    post_nodes:Vec<usize>,
+    pre_sum:[usize;8],
+    mid_sum:[usize;8],
+    post_sum:[usize;8],
+    final_counts:[usize;8],
+}
+impl TriangleCounter {
+
+    fn execute(&mut self, edges:&Vec<TriangleEdge>, delta:i64) {
+        let L = edges.len();
+        if L < 3 {
+            return;
+        }
+        let mut start = 0;
+        let mut end = 0;
+        for j in 0..L {
+            while start < L && edges[start].time + delta < edges[j].time {
+                self.pop_pre(&edges[start]);
+                start+=1;
+            }
+            while (end < L) && edges[end].time <= edges[j].time + delta {
+                self.push_post(&edges[end]);
+                end+=1;
+            }
+            self.pop_post(&edges[j]);
+            self.process_current(&edges[j]);
+            self.push_pre(&edges[j])
+        }
+    }
+
+    fn push_pre(&mut self,cur_edge:&TriangleEdge) {
+        let (isUorV, nb, dir) = (cur_edge.uorv, cur_edge.nb, cur_edge.dir);
+        if !cur_edge.uv_edge {
+            self.pre_sum[map3D(1-isUorV, incoming, dir)] += self.pre_nodes[self.N * map2D(incoming, 1 - isUorV) + nb];
+            self.pre_sum[map3D(1-isUorV, outgoing, dir)] += self.pre_nodes[self.N * map2D(outgoing, 1 - isUorV) + nb];
+            self.pre_nodes[self.N*map2D(dir, isUorV) + nb] +=1; 
+        }
+    }
+
+    fn push_post(&mut self,cur_edge:&TriangleEdge) {
+        let (isUorV, nb, dir) = (cur_edge.uorv, cur_edge.nb, cur_edge.dir);
+        if !cur_edge.uv_edge {
+            self.post_sum[map3D(1-isUorV, incoming, dir)] += self.post_nodes[self.N * map2D(incoming, 1 - isUorV) + nb];
+            self.post_sum[map3D(1-isUorV, outgoing, dir)] += self.post_nodes[self.N * map2D(outgoing, 1 - isUorV) + nb];
+            self.post_nodes[self.N*map2D(dir, isUorV) + nb] +=1; 
+        }
+    }
+
+    fn pop_pre(&mut self, cur_edge:&TriangleEdge) {
+        let (isUorV, nb, dir) = (cur_edge.uorv, cur_edge.nb, cur_edge.dir);
+        if !cur_edge.uv_edge {
+            self.pre_nodes[self.N * map2D(dir, isUorV) + nb] -= 1;
+            self.pre_sum[map3D(isUorV, dir, incoming)] -= self.pre_nodes[self.N * map2D(incoming, 1-isUorV)];
+            self.pre_sum[map3D(isUorV, dir, outgoing)] -= self.pre_nodes[self.N * map2D(outgoing, 1-isUorV)];       
+        }
+    }
+
+    fn pop_post(&mut self, cur_edge:&TriangleEdge) {
+        let (isUorV, nb, dir) = (cur_edge.uorv, cur_edge.nb, cur_edge.dir);
+        if !cur_edge.uv_edge {
+            self.post_nodes[self.N * map2D(dir, isUorV) + nb] -= 1;
+            self.post_sum[map3D(isUorV, dir, incoming)] -= self.post_nodes[self.N * map2D(incoming, 1-isUorV)];
+            self.post_sum[map3D(isUorV, dir, outgoing)] -= self.post_nodes[self.N * map2D(outgoing, 1-isUorV)];       
+        }
+    }
+
+    fn process_current(&mut self, cur_edge:&TriangleEdge) {
+        let (isUorV, nb, dir) = (cur_edge.uorv, cur_edge.nb, cur_edge.dir);
+        if !cur_edge.uv_edge {
+            self.mid_sum[map3D(1-isUorV, incoming, dir)] -= self.pre_nodes[self.N * map2D(incoming, 1-isUorV) + nb];
+            self.mid_sum[map3D(1-isUorV, outgoing, dir)] -= self.pre_nodes[self.N * map2D(outgoing, 1-isUorV) + nb];
+            self.mid_sum[map3D(isUorV, dir, incoming)] += self.post_nodes[self.N * map2D(incoming, 1-isUorV) + nb];
+            self.mid_sum[map3D(isUorV, dir, outgoing)] += self.post_nodes[self.N * map2D(outgoing, 1-isUorV) + nb];
+        }
+        else {
+            self.final_counts[0] += self.mid_sum[map3D(dir,0,0)] + self.post_sum[map3D(dir, 0, 1)] + self.pre_sum[map3D(1-dir,1,1)];
+            self.final_counts[4] += self.mid_sum[map3D(dir,1,0)] + self.post_sum[map3D(1-dir, 0, 1)] + self.pre_sum[map3D(1-dir,0,1)];
+            self.final_counts[2] += self.mid_sum[map3D(1-dir,0,0)] + self.post_sum[map3D(dir, 1, 1)] + self.pre_sum[map3D(1-dir,1,0)];
+            self.final_counts[6] += self.mid_sum[map3D(1-dir,1,0)] + self.post_sum[map3D(1-dir, 1, 1)] + self.pre_sum[map3D(1-dir,0,0)];
+            self.final_counts[1] += self.mid_sum[map3D(dir,0,1)] + self.post_sum[map3D(dir, 0, 0)] + self.pre_sum[map3D(dir,1,1)];
+            self.final_counts[5] += self.mid_sum[map3D(dir,1,1)] + self.post_sum[map3D(1-dir, 0, 0)] + self.pre_sum[map3D(dir,0,1)];
+            self.final_counts[3] += self.mid_sum[map3D(1-dir,0,1)] + self.post_sum[map3D(dir, 1, 0)] + self.pre_sum[map3D(dir,1,0)];
+            self.final_counts[7] += self.mid_sum[map3D(1-dir,1,1)] + self.post_sum[map3D(1-dir, 1, 0)] + self.pre_sum[map3D(dir,0,0)];
+        }
+    }
+}
+fn init_tri_count(neighbours:Vec<usize>) -> TriangleCounter {
+    let N = neighbours.len();
+    TriangleCounter { N: N, pre_nodes: vec![0;4*N], post_nodes: vec![0;4*N], pre_sum: [0;8], mid_sum: [0;8], post_sum: [0;8], final_counts: [0;8] }
+}
+
+#[cfg(test)]
+mod three_node_motifs_test {
+use super::{map2D, TwoNodeEvent,incoming,outgoing, TwoNodeCounter, TriangleEdge, TriangleCounter, init_tri_count};
+
+    #[test]
+    fn map_test() {
+    assert_eq!(map2D(1,1),3);
+    }
+
+    #[test]
+    fn two_node_test() {
+        let events = vec![TwoNodeEvent{dir:outgoing,time:1}, TwoNodeEvent{dir:incoming,time:2}, TwoNodeEvent{dir:incoming,time:3}];
+        let mut twonc = TwoNodeCounter{count1d:[0;2],count2d:[0;4],count3d:[0;8]};
+        twonc.execute(&events, 5);
+        println!("motifs are {:?}",twonc.count3d);
+    }
+
+    #[test]
+    fn triad_test() {
+        let events = vec![(true, 0,1,1,1), (false,1,0,1,2),(false,0,0,0,3)].iter().map(|x| TriangleEdge{uv_edge:x.0,uorv:x.1,nb:x.2,dir:x.3,time:x.4}).collect::<Vec<_>>();
+        let mut triangle_count = init_tri_count(vec![0,1,2]);
+        triangle_count.execute(&events, 5);
+        println!("triangle motifs are {:?}",triangle_count.final_counts);
+    }
+}
\ No newline at end of file