Finding all possible paths between input and output in a given Combinational Circuit.
-
Updated
Oct 30, 2020 - Python
Finding all possible paths between input and output in a given Combinational Circuit.
Considering combinational logic circuit (bipartite graph) as adjacent list and enumerate all the paths from input to output. Visualise gate-level verilog code as a directed graph. Networkx library was used to draw the graphs.
Add a description, image, and links to the circuit-paths topic page so that developers can more easily learn about it.
To associate your repository with the circuit-paths topic, visit your repo's landing page and select "manage topics."