Update README.md

oscarhiggott · Oct 25, 2022 · 974d7a4 · 974d7a4
1 parent 63dbd33
commit 974d7a4
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/README.md b/README.md
@@ -51,7 +51,7 @@ distance > 10, where N is the number of detectors (nodes) per round, and T is th
 
 |                              Decoding time per round for p=0.1% circuit-level noise                              |                                  Decoding time per round for p=0.5% circuit-level noise                                   |
 |:----------------------------------------------------------------------------------------------------------------:|:-------------------------------------------------------------------------------------------------------------------------:|
- | ![Below threshold](https://github.com/oscarhiggott/PyMatching/blob/2ec80a2c1895b296272ad1d951a97d58279cae54/docs/figures/pymatching_v0_7_vs_pymatching_v2_0_vs_networkx_timing_p=0.001_per_round_fix_ylim.png) | ![Near threshold](https://github.com/oscarhiggott/PyMatching/blob/2ec80a2c1895b296272ad1d951a97d58279cae54/docs/figures/pymatching_v0_7_vs_pymatching_v2_0_vs_networkx_timing_p=0.005_per_round_fix_ylim.png)  |
+ | ![Below threshold](docs/figures/pymatching_v0_7_vs_pymatching_v2_0_vs_networkx_timing_p_0_001_per_round_fix_ylim.png) | ![Near threshold](docs/figures/pymatching_v0_7_vs_pymatching_v2_0_vs_networkx_timing_p_0_005_per_round_fix_ylim.png)  |
 
 
 Sparse blossom is conceptually similar to the approach described in [this paper](https://arxiv.org/abs/1307.1740)