In fact, Topological Sort is a BFS.
It is to solve the question which should list all path of graph.
But there are some conditions which users should understand.
C/C++
|Algo| Backtracking
In fact, backtracking is exhaustive method.
Therefore, those problems exist the pattern which can be solved by DFS.
Solutions can be construct a tree, then using DFS to list all effect answers.
|Android| Android system powers up flow from kernel to user space
It is more detail the last version.
Main reference.
There is a beautiful kernel power up figure.
1. Bootloader: ({android}/bootable/bootloader)
In Qualcomm, its bootloader called as little kernel.
|Master | fwd: Why frameworks are evil
In my opinion, libraries are flexible than refer to frameworks.
Avoid building frameworks and create libraries instead.
Frameworks are hard to explore
Frameworks shape how you code
|Linux| GNU autotool
If you want to porting any library from the distribution to another one,
you should learn GNU autotool firstly.
From porting libqmi, we can learn this fact.
Step 1: install the following libraries.
autotools-dev
libev-dev
autoconfig
automake
autoconf-archive
libtool
Step 2: enter the libraries’ folder
which included configure.ac, Makefile.am
./configure //in fact, doing autoconf
make
make install
Explanation of files:
configure.ac: input file for Autoconf.
Makefile.am: input file(s) for Automake.
Ref.
https://www.gnu.org/software/automake/faq/autotools-faq.html
https://opensource.com/article/19/7/introduction-gnu-autotools
