Implementation - 2023.2 English

Vitis Libraries

Release Date
2023.2 English

The algorithm implemention is shown in the figure below:

Figure 1 Breadth-first Search design

There are 4 functional blocks as shown in the figure:

  1. GetVertex is responsible to load the next vertex in the queue and pass it to the ReadGraph.
  2. ReadGraph collects all next hop vertices and pass them to the next module.
  3. ReadColor check each next hop vertex whether it has already been discovered in ealier stages of the BFS. This module only passes first discovered vertices to the next block.
  4. When the 3rd functional block ends, WriteRes update the discovery, finish, level and parent value accordingly. And also this block push all the vertices collected from block 3 into Queue.

This system starts from pushing the source vertex into the queue and iterate until the queue is empty.