Copyright | Copyright (C) 2021 Yoo Chung |
---|---|

License | GPL-3.0-or-later |

Maintainer | dev@chungyc.org |

Safe Haskell | Safe-Inferred |

Language | GHC2021 |

Part of Ninety-Nine Haskell Problems. Some solutions are in Solutions.P81.

# Documentation

paths :: Vertex -> Vertex -> G -> [[Vertex]] Source #

Write a function that, given two vertexes `a`

and `b`

in a graph,
returns all the acyclic paths from `a`

to `b`

.

### Examples

`>>>`

[[1,2,3,4],[1,2,4],[1,3,2,4],[1,3,4]]`sort $ paths 1 4 $ toG $ Paths [[1,2,3], [1,3,4,2], [5,6]]`

`>>>`

[]`paths 2 6 $ toG $ Paths [[1,2,3], [1,3,4,2], [5,6]]`