Description of Change

Checklist

• Added description of change
• Added file name matches [File

Add quickselect algorithm. Quickselect is a selection algorithm to find the kth smallest element in an unordered list.

doctest help

Description of Change

1. adding new feature - articulation point algorithm. In a graph, a vertex is called an articulation point if removing it and all the edges associated with it results in the increase of the number of connected components in the graph. For example consider the graph given in following figure.
2. moving the GraphRep struct from Graph.c to Graph.h

References

<!

Since we migrated from the Haskell runtime (what's in master now) to a React + Typescript runtime that's part of the frontend (what's in web-runtime now), a lot of the example domains we implemented for the paper need to be ported to the new runtime.

This is high-priority for us since it will enable us to test that the new runtime is at parity, and start c

Explain what you would like to see improved

We had CI builds stuck in downloading dependencies, e.g. VecCore. That should timeout.

Optional: share how it could be improved

Add the TIMEOUT parameter to all ExternalProject calls downloading sources.

There are multiple graph generators that currently do not check their input for validity.

These need to be fixed:

• callaway_traits_game
• establishment_game

The following functions have been verified to check their arguments properly:

forest_fire_game

Please update the lists above as you verify functions or find new ones with problems.

This is marked as

There is now a type circle in UniMath.SyntheticHomotopyTheory.Circle2. It would be great to define pi_1 of a pointed type, and to show that pi_1(circle, pt) \simeq Z.