Implementation - 2024.2 English

The implementation is shown in the following figure:

The kernel does the following steps:

1. Load the ID of the source and destination vertices. Pass the source vertices ID to the first hop path finder through hls::stream. Pass the destination vertices to the filter and counter.
2. The first hop path finder finds all the first hop vertices and pass them to the 2nd hop path finder through hls::stream.
3. The second hop path finder finds all the second hop vertices and pass them to the final filter and counter through hls::stream.
4. The filter and finder will drop all the second hop vertices that is not the target destination vertex and count all the second hop vertices that is the targeted destination vertex. And then stored it into the result.