Skip to content

Commit c119b28

Browse files
committed
edit hyperlinks to markdown instead of html
1 parent 128718e commit c119b28

2 files changed

Lines changed: 8 additions & 8 deletions

File tree

README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
11
# raig
22

33
`raig` (pronounced “rage”) is a dependency-free library for working with
4-
<a href="https://en.wikipedia.org/wiki/And-inverter_graph" target="_blank" rel="noopener noreferrer">And-Inverter Graphs (AIGs)</a>
4+
[AIGs](https://en.wikipedia.org/wiki/And-inverter_graph)
55
in Rust, developed at
6-
<a href="https://capra.cs.cornell.edu/" target="_blank" rel="noopener noreferrer">Cornell's Capra Lab</a>.
6+
[Cornell's Capra Lab](https://capra.cs.cornell.edu/).
77

88
An AIG represents Boolean logic with AND gates and inverted edges. This compact
99
form is useful for logic verification, synthesis, and testing tools.

src/lib.rs

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -2,9 +2,9 @@
22
html_logo_url = "https://tr.rbxcdn.com/180DAY-2de3012b73f0302860041299c84dc0ac/420/420/Hat/Webp/noFilter"
33
)]
44
//! `raig` (pronounced “rage”) is a dependency-free library for working with
5-
//! <a href="https://en.wikipedia.org/wiki/And-inverter_graph" target="_blank" rel="noopener noreferrer">And-Inverter Graphs (AIGs)</a>
5+
//! [AIGs](https://en.wikipedia.org/wiki/And-inverter_graph)
66
//! in Rust, developed at
7-
//! <a href="https://capra.cs.cornell.edu/" target="_blank" rel="noopener noreferrer">Cornell's Capra Lab</a>.
7+
//! [Cornell's Capra Lab](https://capra.cs.cornell.edu/).
88
//! AIGs represent Boolean logic using only AND nodes and NOT edges. This simple
99
//! structure makes them smaller and faster for computer tools to process than
1010
//! other logic representations.
@@ -17,12 +17,12 @@
1717
//! ## 1.0 Start With an AIGER File
1818
//!
1919
//! The most common starting point is an
20-
//! <a href="https://fmv.jku.at/aiger/FORMAT.aiger" target="_blank" rel="noopener noreferrer">AIGER file</a>
20+
//! [AIGER file](https://fmv.jku.at/aiger/FORMAT.aiger)
2121
//! (a digital file format for storing AIGs)
2222
//! from another tool, such as
23-
//! <a href="https://github.com/mvcisback/py-aiger" target="_blank" rel="noopener noreferrer">py-aiger</a>
23+
//! [py-aiger](https://github.com/mvcisback/py-aiger)
2424
//! or
25-
//! <a href="https://github.com/arminbiere/aiger" target="_blank" rel="noopener noreferrer">aiger</a>.
25+
//! [aiger](https://github.com/arminbiere/aiger).
2626
//! Internal generation of AIGER files is not yet supported, but you can bypass the parser and build a
2727
//! [`graph::AigGraph`] (our intenral representation of AIGs) directly using [`graph::AigBuilder`].
2828
//!
@@ -34,7 +34,7 @@
3434
//! Here is a small example demonstrating some of AIGER's invariants, but you can (and should!)
3535
//! read more about the
3636
//! invariants of AIGER files (i.e., .aag and .aig files)
37-
//! <a href="https://github.com/arminbiere/aiger" target="_blank" rel="noopener noreferrer">here</a>.
37+
//! [here](https://github.com/arminbiere/aiger).
3838
//!
3939
//! This is an example ASCII AIGER circuit that has one input and one output. The output is
4040
//! exactly the input, so it behaves like an identity function.

0 commit comments

Comments
 (0)