Implementation - 2023.2 English

Vitis Libraries

Release Date
2023.2 English

The algorithm implemention is shown in the figure below:

block design of minimum spanning tree

There are 4 functional blocks as shown in the figure:

  1. QueuePop is responsible to load the next vertex in the priority queue and pass it to the loadOffset.
  2. loadOffset loads the offset value associate with current vertex from the CSR offset values and pass it to the next block.
  3. loadCol&Wei loads the ID and weight of the next hop vertices according to the offset values. And it passes these IDs and weights to the loadRes.
  4. Queue pushes the next hop vertices into the priority queue. And it sorts the priority again.

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