| Copyright | Copyright (C) 2023 Yoo Chung |
|---|---|
| License | GPL-3.0-or-later |
| Maintainer | dev@chungyc.org |
| Safe Haskell | Safe-Inferred |
| Language | GHC2021 |
Solutions.P83
Description
Some solutions to Problems.P83 of Ninety-Nine Haskell Problems.
Synopsis
- spanningTrees :: G -> [G]
- isTree :: G -> Bool
- isConnected :: G -> Bool
Documentation
spanningTrees :: G -> [G] Source #
Construct all spanning trees of a given graph.
Write a function which returns whether a graph is a tree using spanningTrees.
isConnected :: G -> Bool Source #
Write a function which returns whether a graph is connected using spanningTrees.