Add in README.md
the fact that as documented in #30, this algorithm is only known to be working fin on Linux
This commit is contained in:
parent
4133faad41
commit
46ef8146f8
@ -12,6 +12,8 @@ As would like to proceed channel per channel, the question is **how much time do
|
|||||||
|
|
||||||
Have to proceed with a breadth-first search approach as treating all *child* channels might take a time equivalent to treating the whole original tree.
|
Have to proceed with a breadth-first search approach as treating all *child* channels might take a time equivalent to treating the whole original tree.
|
||||||
|
|
||||||
|
Because of [the current compression mechanism](https://gitea.lemnoslife.com/Benjamin_Loison/YouTube_captions_search_engine/issues/30), Linux is the only known OS able to run this algorithm.
|
||||||
|
|
||||||
```sh
|
```sh
|
||||||
sudo apt install nlohmann-json3-dev
|
sudo apt install nlohmann-json3-dev
|
||||||
make
|
make
|
||||||
|
Loading…
Reference in New Issue
Block a user