Handling directed graphs - x86 Assembly

Developed an x86 assembly project handling directed graphs, enabling input of adjacency lists to generate adjacency matrices. Extended functionality to calculate the number of paths of a specific given length between specified nodes, enhancing skills in low-level programming and graph theory.

Project requirements:

1. generate adjacency matrices
2. calculate the number of paths of a specific given length between specified nodes

Input:

1 // project requirement number
4 // number of nodes
2 // node 0 is adjacent to two nodes (nodes 1 and 2)
2 // node 1 is adjacent to two nodes (nodes 2 and 3)
1 // node 2 is adjencent to one node (node 3)
0 // node 3 is adjencent to no nodes
1 // nodes which node 0
2 // is adjencent to
2 // nodes which node 1
3 // is adjencent to
3 // node which node 2 is adjencent to

Output:

0 1 1 0
0 0 1 1
0 0 0 1
0 0 0 0

Input:

2 // project requirement number
4 // number of nodes
2 // node 0 is adjacent to two nodes (nodes 1 and 2)
2 // node 1 is adjacent to two nodes (nodes 2 and 3)
1 // node 2 is adjacent to one nodes (node 3)
0 // node 3 is adjencent to no nodes
1 // nodes which node 0
2 // is adjencent to
2 // nodes which node 1
3 // is adjencent to
3 // node which node 2 is adjencent to
2 // path length
0 // source node
3 // destination node

Output:

2 // there are two paths of length 2 from node 0 to node 3