Skip to content

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.

License

Notifications You must be signed in to change notification settings

arjunrajasekharan/Circuit-Path-Enumeration

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Circuit-Path-Enumeration

  • Considering combinational logic circuit (biparted 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

  • Input: Verilog file with Gate Level Modelling

  • Output: All paths from input to output of the circuit enumerated by the Verilog file and the exported graph

Technologies Used:

  • Networkx // for graph algorithms
  • Python
  • Verilog

Usage

python3 main.py --verbose VERBOSE <path-to-verilog-file>

Output

Enumerated paths and graphical representation of Full Adder Output Graph(FA)

Enumerated paths and graphical representation of 4x1 Multiplexer Output Graph(4x1MUX)

About

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.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published