-
[Graph Theory](https://github.com/coq-community/graph-theory) is a library for graph theory based on the Mathematical Components library, including various standard results from the literature (e.g., …
-
[Enter steps to reproduce:]
1. ...
2. ...
**Atom**: 1.15.0 x64
**Electron**: 1.3.13
**OS**: Ubuntu 16.04.1
**Thrown From**: [color-tabs](https://github.com/paulpflug/color-tabs) package 0.1.…
-
As I thinking about `batsat`s non-chronological backtracking with theory propagation I started wondering what requirements the theory propagation had, eg. "a theories explanation of a propagated liter…
-
## background
- proof-of-concept integration of RGs makes them available as a Wiki -- find and navigating between them happens through interlinking (not through exhaustive search)
- once the RGs…
-
Reported by **till** and assigned to **maeder**
Migrated from http://trac.informatik.uni-bremen.de:8080/hets/ticket/508
---
There are the following levels of support of structuring mechanisms:
1. n…
-
# What
Looking at our currently supported Go variants, there are only a few which don't work with a graph-like board right away:
- Keima Go
- Pyramid Go
But other ones could be easily played wit…
-
I would like to add dijkstra's shortest path algorithm, Floyd Warshell algorithm, as well as Bellmanford algorithm and with a little explaination to use which one of them for which type of problems.
…
-
Markdown Path: `tutorials/graph-theory/prims-algorithm.md`
- Overview
- Explanation with 2 - 3 LC problems
- Suggested Problems (See `arrays.md` as a reference for the format)
You can include …
-
Markdown Path: `tutorials/graph-theory/floyd-warshall-algorithm.md`
- Overview
- Explanation with 2 - 3 LC problems
- Suggested Problems (See `arrays.md` as a reference for the format)
You can…
-
As many as I can, mainly, graph theory and game theory.