A »Node« represents one junction point in the dependency graph, knows his predecessors and successors and carries out one step of the chained hash calculation. |
||
|---|---|---|
| .. | ||
| gear | ||
| mem | ||
| DIR_INFO | ||
A »Node« represents one junction point in the dependency graph, knows his predecessors and successors and carries out one step of the chained hash calculation. |
||
|---|---|---|
| .. | ||
| gear | ||
| mem | ||
| DIR_INFO | ||