Name Last Update Last Commit     cc755090d0c – Added affiliation to README history
File_txt .gitignore Loading commit data... Ajax_loader_tree
File_txt build_bench.py Loading commit data... Ajax_loader_tree
File_txt build_blif.py Loading commit data... Ajax_loader_tree
File_txt build_edif.py Loading commit data... Ajax_loader_tree
File_txt build_slif.py Loading commit data... Ajax_loader_tree
File_txt build_verilog_rtl.py Loading commit data... Ajax_loader_tree
File_txt build_verilog_struct.py Loading commit data... Ajax_loader_tree
File_txt build_vhd_rtl.py Loading commit data... Ajax_loader_tree
File_txt build_vhd_struct.py Loading commit data... Ajax_loader_tree
File_txt build_xilinx.py Loading commit data... Ajax_loader_tree
File_txt cells_dict.py Loading commit data... Ajax_loader_tree
File_txt clean_const.py Loading commit data... Ajax_loader_tree
File_txt qm.py Loading commit data... Ajax_loader_tree
File_txt readme.md Loading commit data... Ajax_loader_tree
readme.md

Parsers from netlist formats to graphs

Authors: Théo Basty, Brice Colombier, Lilian Bossuet

Laboratoire Hubert Curien

18 rue Pr. Benoît Lauras, 42000 Saint-Etienne, FRANCE

These Python scripts can convert combinational netlist files to directed acyclic graphs in the igraph format.

So far it handles the following netlist formats:
- bench: ISCAS'85 and ITC'99 netlists format
- BLIF: Berkeley Logic Interchange Format
- SLIF: Stanford Logic Interchange Format
- EDIF: Electronic Design Interchange Format
- VHDL (dataflow and structural)
- Verilog (dataflow and structural)
- Xilinx EDIF: Netlist mapped to Xilinx LUTs