adjunctions VS subwordgraph

Compare adjunctions vs subwordgraph and see what are their differences.

adjunctions

Simple adjunctions (by ekmett)
Data structures
Source Code
hackage.haskell.org
Suggest alternative
Edit details

subwordgraph

An implementation of a classic Subword Graph (also known as Directed Acyclic Word Graph). (by danielnowakowski)
Data structures
Source Code
hackage.haskell.org
Suggest alternative
Edit details
WorkOS
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
adjunctions subwordgraph
1 -
44 0
- -
3.3 0.0
7 months ago almost 8 years ago
Haskell Haskell
GNU General Public License v3.0 or later BSD 3-clause "New" or "Revised" License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

adjunctions

Posts with mentions or reviews of adjunctions. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-11-16.

subwordgraph

Posts with mentions or reviews of subwordgraph. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning subwordgraph yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing adjunctions and subwordgraph you can also consider the following projects:

miso - :ramen: A tasty Haskell front-end framework

fgl - A Functional Graph Library for Haskell

containers - Assorted concrete container types

graphite - Haskell graphs and networks library

parameterized-utils - A set of utilities for using indexed types including containers, equality, and comparison.

containers - Bitnami container images

repa-array - High performance, regular, shape polymorphic parallel arrays.

clafer - Clafer is a lightweight modeling language

EdisonAPI - Edison: A Library of Efficient Data Structures

perfect-hash-generator - Perfect minimal hashing implementation in native Haskell

distributive - Dual Traversable

I1M - Código Haskell usado en el curso de I1M (Informática de 1º de Matemática)

adjunctions vs miso adjunctions vs fgl adjunctions vs containers adjunctions vs graphite adjunctions vs parameterized-utils adjunctions vs containers subwordgraph vs repa-array subwordgraph vs clafer subwordgraph vs EdisonAPI adjunctions vs perfect-hash-generator adjunctions vs distributive adjunctions vs I1M