Algorithm 1 DeepWalk ($G,w,d,\gamma ,$)

Input: graph $G\left(V,E\right)$

windows size $w$

representation size $d$

epoch $\gamma$

step length $t$

Output: matrix of nodes representation $\psi \in {ℝ}^{\left|V\right|\times d}$

1: Initialization: $\psi$

2: Build a binary Tree $T$ from $V$

3: for $i=0$ to $\mu$ do

4:  $V^{\prime }$= Shuffle($V$)

5: for each $v_i\in V^{\prime }$ do

6:   $M_{v_i}=\mathit{R}\mathit{a}\mathit{n}\mathit{d}\mathit{o}\mathit{m}\mathit{W}\mathit{a}\mathit{l}\mathit{k}\left(G,v_i,t\right)$

7:   $\mathit{S}\mathit{k}\mathit{i}\mathit{p}\mathit{G}\mathit{r}\mathit{a}\mathit{m}\left(\psi ,M_{v_i},w\right)$

8: end for

9: end for