How would you format the data for the SPOC example data, specifically the two 4x4 data sets.
women
4 3 1 2
2 1 3 4
1 3 4 2
4 3 1 2
men
3 2 4 1
2 3 1 4
3 1 2 4
3 2 4 1

I tried:
women = [[4,3,1,2],[2,1,3,4],[1,3,4,2],[4,3,1,2]]
men = [[3,2,4,1],[2,3,1,4],[3,1,2,4],[3,2,4,1]]

spouse = gale_shapley(men, women)
print(spouse)

When I call the function, I get the following error message.
in
61 #men.append([3,2,4,1])
62
---> 63 spouse = gale_shapley(men, women)
64 print(spouse)

in gale_shapley(men, women)
20 for r in range(n):
21 print(j,r,women[j][r])
---> 22 rank[j][women[j][r]] = r
23 singles = deque(range(n)) # all men are single and get in the queue
24 while singles:

IndexError: list assignment index out of range

I did try modifying the data so that it is zero based, but you still get an error. The data in the problem is generally like what was given above.

Any help appreciated!

Stamen has gone python-visualization/folium#1803
But we may find a workaround

It seems the <table> generated from MD does not include class="sortable".

Should be generated. I remember @xtof-durr you made a script for that!

The doc reads « :param line: string containing the expression », although, it seems the expected parameter is a list of strings.

https://github.com/jilljenn/tryalgo/blob/master/tryalgo/arithm_expr_eval.py#L48

Example: tryalgo.arithm_expr_eval.arithm_expr_parse(["3", "+", "1"])

On the blog someone found out that implementations may not be as fast as expected; the code should be profiled.
(According to Christoph, it was due to the testcases.)

Because of jQuery

When installing tryalgo with pip command (using internet connection), cut_nodes_edges2 is not in source code, so tryalgo test script makes an error.

Why can't we import directly
from tryalgo import opt_bin_search_tree1, decode_root_matrix_to_level
but need to write
from tryalgo.dyn_prog_tricks import opt_bin_search_tree1, decode_root_matrix_to_level
?
In other words at what place are the modules moved one level up for export?

DEPRECATION: tryalgo is being installed using the legacy 'setup.py install' method, because it does not have a 'pyproject.toml' and the 'wheel' package is not installed. pip 23.1 will enforce this behaviour change. A possible replacement is to enable the '--use-pep517' option. Discussion can be found at pypa/pip#8559

• random_eulerien_graph n'assure pas que le graphe généré est connexe, peut-être souhaite-t-on que ce soit fait ;
• Line 133 should be different for directed or undirected graph

Just for fun and to thank cp-algorithms.com great website

Maybe by avoiding resetting the marking vector (thanks Marc de Falco for pointing the problem, thanks notebook ICPC X for the solution).

Hello,

About the line 16 of the Rabin Karp algorithm:

val = (old_val - out_digit * last_pos + DOMAIN * PRIME) % PRIME

You say in the book that you are adding DOMAIN * PRIME to counter the fact that C++ will return a negative modulo.

Even by doing this you can obtain a negative modulo as (old_val - out_digit * last_pos + DOMAIN * PRIME) can be negative, this happen if the sum produces a number bigger than 2^64.

What do you think?

Also, I am not sure if it is a real issue when the number ends up negative?

The consecutive ones instance

0,1,0,0,0,0,0,1,0,0,0
0,0,1,0,0,0,0,0,0,0,1
0,1,1,0,0,0,0,0,0,1,0
0,1,1,0,1,0,0,1,1,1,1

is a yes-instance; the correct order is [0, 3, 5, 6, 4, 8, 7, 1, 9, 2, 10].

from tryalgo import pq_tree as pq
pq.consecutive_ones_property([{1,2,9},{1,7},{2,10},{1,2,9},{1,2,4,7,8,9,10}],{0,1,2,3,4,5,6,7,8,9,10}) 

gives this correct output. However, when permuting the input,

pq.consecutive_ones_property([{1,7},{2,10},{1,2,9},{1,2,4,7,8,9,10}],{0,1,2,3,4,5,6,7,8,9,10}) 

fails with an error message:

 Traceback (most recent call last):
  File "<stdin>", line 1, in <module>
  File "/home/martin/.local/lib/python3.6/site-packages/tryalgo/pq_tree.py", line 268, in consecutive_ones_property
    tree.reduce(S)
  File "/home/martin/.local/lib/python3.6/site-packages/tryalgo/pq_tree.py", line 235, in reduce
    z.full_leafs += x.full_leafs                 # cumulate bottom up full leaf numbers
AttributeError: 'NoneType' object has no attribute 'full_leafs'

That how it looks in the documentation:

See jeanbache@0bbda62

La même fonction a deux noms selon les modules.

this links does not render nicely. See the end of this paragraph:

The book link https://jilljenn.github.io/#books returns a 404 error

Is there a specific reason for this? This side-effect feels unnatural to me. Maybe another name could be used instead of w? unique_w = list(set(w))?

Edit: It seems anagrams actually doesn't modify its input, my bad.

array([[0, 1, 0, 0, 0],
       [0, 0, 1, 1, 0],
       [1, 1, 1, 0, 0],
       [1, 1, 1, 1, 1],
       [0, 1, 1, 1, 0],
       [1, 1, 1, 1, 1],
       [0, 1, 1, 1, 1],
       [0, 0, 0, 0, 1],
       [1, 1, 1, 1, 0],
       [0, 0, 1, 0, 0]])

with sets:

[{1},
 {2, 3},
 {0, 1, 2},
 {0, 1, 2, 3, 4},
 {1, 2, 3},
 {0, 1, 2, 3, 4},
 {1, 2, 3, 4},
 {4},
 {0, 1, 2, 3},
 {2}]

gives:

IsNotC1P: state == -1

I think sorted instead of set/frozenset could ensure tests a bit stricter/safer (just in case anagrams doesn't return unique objects).

The same algorithm works fine provided |U| <= |V|. This prevents creating dummy 0 cost matchings that increase the complexity of the algorithm.

In the book you talk about an input :
'le chien marche vers sa niche et trouve une limace de chine nue pleine de malice qui lui fait du charme'
A string, but in your code you talk about a list.
In both cases, you cant turn a set into a list using list(set(w)) it give TypeError: 'set' object is not subscriptable
Am I missing something?