34 | | g = random_acyclic(100, .2) |

35 | | %timeit g.is_directed_acyclic() |

| 34 | sage: g = random_acyclic(100, .2) |

| 35 | sage: %timeit g.is_directed_acyclic() |

| 36 | 625 loops, best of 3: 376 µs per loop |

| 37 | sage: g = random_acyclic(100, .2) |

| 38 | sage: %timeit g.is_directed_acyclic() |

| 39 | 625 loops, best of 3: 375 µs per loop |

| 40 | sage: g = random_acyclic(100, .2) |

| 41 | sage: %timeit g.is_directed_acyclic() |

| 42 | 625 loops, best of 3: 388 µs per loop |

| 43 | sage: g = random_acyclic(100, .2) |

| 44 | sage: %timeit g.is_directed_acyclic() |

| 45 | 625 loops, best of 3: 380 µs per loop |

| 46 | sage: g = random_acyclic(100, .2) |

| 47 | sage: %timeit g.is_directed_acyclic() |

| 48 | 625 loops, best of 3: 383 µs per loop |

| 49 | sage: g = random_acyclic(100, .2) |

| 50 | sage: %timeit g.is_directed_acyclic() |

| 51 | 625 loops, best of 3: 380 µs per loop |