doost4
Junior Member level 3
Hello everybody,
I'm going to implement a graph traversal algorithm on FPGA so that it takes a design as its input and traverse the graph from the beginning point to the end on the FPGA.
In this design every node has some information to be processed during the traversal.
How should I start to implement this algorithm? Since the graph for a design is large and it doesn't fit on the FPGA, it seems that I also have to work with external memory, right ?
Is there any similar project over the net for graph traversing algorithms like Depth-First search?
Thanks
I'm going to implement a graph traversal algorithm on FPGA so that it takes a design as its input and traverse the graph from the beginning point to the end on the FPGA.
In this design every node has some information to be processed during the traversal.
How should I start to implement this algorithm? Since the graph for a design is large and it doesn't fit on the FPGA, it seems that I also have to work with external memory, right ?
Is there any similar project over the net for graph traversing algorithms like Depth-First search?
Thanks
Last edited: