SUSE Package Hub 15 SP4 oneclick install
Install ghcalgebraicgraphs
NOTE: This oneclick installation requires that the SUSE Package Hub extension to already be enabled.
See http://packagehub.suse.com/howtouse/ for information on enabling the Package Hub extension
If the extension is not enabled, this installation will fail while trying to enable an invalid repo.
This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered.
SUSEPackageHub15SP4BackportsPool
Package Hub 15 SP4
Dummy repo  this will fail

ghcalgebraicgraphs
A library for algebraic graph construction and transformation
<https://github.com/snowleopard/alga Alga> is a library for algebraic
construction and manipulation of graphs in Haskell. See
<https://github.com/snowleopard/algapaper this paper> for the motivation
behind the library, the underlying theory and implementation details.
The toplevel module
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraph.html
Algebra.Graph> defines the main data type for /algebraic graphs/
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraph.html#t:Graph
Graph>, as well as associated algorithms. For typesafe representation and
manipulation of /nonempty algebraic graphs/, see
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphNonEmpty.html
Algebra.Graph.NonEmpty>. Furthermore, /algebraic graphs with edge labels/ are
implemented in
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphLabelled.html
Algebra.Graph.Labelled>.
The library also provides conventional graph data structures, such as
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphAdjacencyMap.html
Algebra.Graph.AdjacencyMap> along with its various flavours:
* adjacency maps specialised to graphs with vertices of type 'Int'
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphAdjacencyIntMap.html
Algebra.Graph.AdjacencyIntMap>), * nonempty adjacency maps
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphNonEmptyAdjacencyMap.html
Algebra.Graph.NonEmpty.AdjacencyMap>), * adjacency maps for undirected
bipartite graphs
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphBipartiteAdjacencyMap.html
Algebra.Graph.Bipartite.AdjacencyMap>), * adjacency maps with edge labels
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphLabelledAdjacencyMap.html
Algebra.Graph.Labelled.AdjacencyMap>), * acyclic adjacency maps
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphAcyclicAdjacencyMap.html
Algebra.Graph.Acyclic.AdjacencyMap>),
A large part of the API of algebraic graphs and adjacency maps is available
through the 'Foldable'like type class
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphToGraph.html
Algebra.Graph.ToGraph>.
The type classes defined in
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphClass.html
Algebra.Graph.Class> and
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphHigherKindedClass.html
Algebra.Graph.HigherKinded.Class> can be used for polymorphic construction and
manipulation of graphs.
This is an experimental library and the API is expected to remain unstable
until version 1.0.0. Please consider contributing to the ongoing
<https://github.com/snowleopard/alga/issues discussions on the library API>.
SUSE Package Hub 15 SP4 oneclick install
Install ghcalgebraicgraphs
NOTE: This oneclick installation requires that the SUSE Package Hub extension to already be enabled.
See http://packagehub.suse.com/howtouse/ for information on enabling the Package Hub extension
If the extension is not enabled, this installation will fail while trying to enable an invalid repo.
This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered.
SUSEPackageHub15SP4BackportsPool
Package Hub 15 SP4
Dummy repo  this will fail

ghcalgebraicgraphs
A library for algebraic graph construction and transformation
<https://github.com/snowleopard/alga Alga> is a library for algebraic
construction and manipulation of graphs in Haskell. See
<https://github.com/snowleopard/algapaper this paper> for the motivation
behind the library, the underlying theory and implementation details.
The toplevel module
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraph.html
Algebra.Graph> defines the main data type for /algebraic graphs/
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraph.html#t:Graph
Graph>, as well as associated algorithms. For typesafe representation and
manipulation of /nonempty algebraic graphs/, see
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphNonEmpty.html
Algebra.Graph.NonEmpty>. Furthermore, /algebraic graphs with edge labels/ are
implemented in
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphLabelled.html
Algebra.Graph.Labelled>.
The library also provides conventional graph data structures, such as
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphAdjacencyMap.html
Algebra.Graph.AdjacencyMap> along with its various flavours:
* adjacency maps specialised to graphs with vertices of type 'Int'
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphAdjacencyIntMap.html
Algebra.Graph.AdjacencyIntMap>), * nonempty adjacency maps
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphNonEmptyAdjacencyMap.html
Algebra.Graph.NonEmpty.AdjacencyMap>), * adjacency maps for undirected
bipartite graphs
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphBipartiteAdjacencyMap.html
Algebra.Graph.Bipartite.AdjacencyMap>), * adjacency maps with edge labels
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphLabelledAdjacencyMap.html
Algebra.Graph.Labelled.AdjacencyMap>), * acyclic adjacency maps
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphAcyclicAdjacencyMap.html
Algebra.Graph.Acyclic.AdjacencyMap>),
A large part of the API of algebraic graphs and adjacency maps is available
through the 'Foldable'like type class
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphToGraph.html
Algebra.Graph.ToGraph>.
The type classes defined in
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphClass.html
Algebra.Graph.Class> and
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphHigherKindedClass.html
Algebra.Graph.HigherKinded.Class> can be used for polymorphic construction and
manipulation of graphs.
This is an experimental library and the API is expected to remain unstable
until version 1.0.0. Please consider contributing to the ongoing
<https://github.com/snowleopard/alga/issues discussions on the library API>.
SUSE Package Hub 15 SP5 oneclick install
Install ghcalgebraicgraphs
NOTE: This oneclick installation requires that the SUSE Package Hub extension to already be enabled.
See http://packagehub.suse.com/howtouse/ for information on enabling the Package Hub extension
If the extension is not enabled, this installation will fail while trying to enable an invalid repo.
This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered.
SUSEPackageHub15SP5StandardPool
Package Hub 15 SP5
Dummy repo  this will fail

ghcalgebraicgraphs
A library for algebraic graph construction and transformation
<https://github.com/snowleopard/alga Alga> is a library for algebraic
construction and manipulation of graphs in Haskell. See
<https://github.com/snowleopard/algapaper this paper> for the motivation
behind the library, the underlying theory and implementation details.
The toplevel module
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraph.html
Algebra.Graph> defines the main data type for /algebraic graphs/
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraph.html#t:Graph
Graph>, as well as associated algorithms. For typesafe representation and
manipulation of /nonempty algebraic graphs/, see
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphNonEmpty.html
Algebra.Graph.NonEmpty>. Furthermore, /algebraic graphs with edge labels/ are
implemented in
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphLabelled.html
Algebra.Graph.Labelled>.
The library also provides conventional graph data structures, such as
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphAdjacencyMap.html
Algebra.Graph.AdjacencyMap> along with its various flavours:
* adjacency maps specialised to graphs with vertices of type 'Int'
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphAdjacencyIntMap.html
Algebra.Graph.AdjacencyIntMap>), * nonempty adjacency maps
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphNonEmptyAdjacencyMap.html
Algebra.Graph.NonEmpty.AdjacencyMap>), * adjacency maps for undirected
bipartite graphs
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphBipartiteAdjacencyMap.html
Algebra.Graph.Bipartite.AdjacencyMap>), * adjacency maps with edge labels
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphLabelledAdjacencyMap.html
Algebra.Graph.Labelled.AdjacencyMap>), * acyclic adjacency maps
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphAcyclicAdjacencyMap.html
Algebra.Graph.Acyclic.AdjacencyMap>),
A large part of the API of algebraic graphs and adjacency maps is available
through the 'Foldable'like type class
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphToGraph.html
Algebra.Graph.ToGraph>.
The type classes defined in
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphClass.html
Algebra.Graph.Class> and
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphHigherKindedClass.html
Algebra.Graph.HigherKinded.Class> can be used for polymorphic construction and
manipulation of graphs.
This is an experimental library and the API is expected to remain unstable
until version 1.0.0. Please consider contributing to the ongoing
<https://github.com/snowleopard/alga/issues discussions on the library API>.
SUSE Package Hub 15 SP5 oneclick install
Install ghcalgebraicgraphs
NOTE: This oneclick installation requires that the SUSE Package Hub extension to already be enabled.
See http://packagehub.suse.com/howtouse/ for information on enabling the Package Hub extension
If the extension is not enabled, this installation will fail while trying to enable an invalid repo.
This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered.
SUSEPackageHub15SP5StandardPool
Package Hub 15 SP5
Dummy repo  this will fail

ghcalgebraicgraphs
A library for algebraic graph construction and transformation
<https://github.com/snowleopard/alga Alga> is a library for algebraic
construction and manipulation of graphs in Haskell. See
<https://github.com/snowleopard/algapaper this paper> for the motivation
behind the library, the underlying theory and implementation details.
The toplevel module
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraph.html
Algebra.Graph> defines the main data type for /algebraic graphs/
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraph.html#t:Graph
Graph>, as well as associated algorithms. For typesafe representation and
manipulation of /nonempty algebraic graphs/, see
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphNonEmpty.html
Algebra.Graph.NonEmpty>. Furthermore, /algebraic graphs with edge labels/ are
implemented in
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphLabelled.html
Algebra.Graph.Labelled>.
The library also provides conventional graph data structures, such as
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphAdjacencyMap.html
Algebra.Graph.AdjacencyMap> along with its various flavours:
* adjacency maps specialised to graphs with vertices of type 'Int'
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphAdjacencyIntMap.html
Algebra.Graph.AdjacencyIntMap>), * nonempty adjacency maps
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphNonEmptyAdjacencyMap.html
Algebra.Graph.NonEmpty.AdjacencyMap>), * adjacency maps for undirected
bipartite graphs
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphBipartiteAdjacencyMap.html
Algebra.Graph.Bipartite.AdjacencyMap>), * adjacency maps with edge labels
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphLabelledAdjacencyMap.html
Algebra.Graph.Labelled.AdjacencyMap>), * acyclic adjacency maps
(<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphAcyclicAdjacencyMap.html
Algebra.Graph.Acyclic.AdjacencyMap>),
A large part of the API of algebraic graphs and adjacency maps is available
through the 'Foldable'like type class
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphToGraph.html
Algebra.Graph.ToGraph>.
The type classes defined in
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphClass.html
Algebra.Graph.Class> and
<http://hackage.haskell.org/package/algebraicgraphs/docs/AlgebraGraphHigherKindedClass.html
Algebra.Graph.HigherKinded.Class> can be used for polymorphic construction and
manipulation of graphs.
This is an experimental library and the API is expected to remain unstable
until version 1.0.0. Please consider contributing to the ongoing
<https://github.com/snowleopard/alga/issues discussions on the library API>.