University tutorials for C/C++
We provide C/C++ source code for your studies, which can be compiled and
executed on UNIX, Windows and other operating systems.
The source codes are clearly written with an aim to be self-explanatory.
Processes, functions and data are simple and reasonable on logical
Graph theory (vertex-edge)
Graph theory includes undirected and directed graphs.
Programming on the two kinds of graphs is very similar. If you understand one,
you will know another one at once.
Key coding for graphs is that all nodes are divided into different sets,
which are called as tentative and fixed sets normally. Coding
always contains a loop function which calculates weight between the two sets
(not weight between 2 nodes) every time until requirement is reached. Please keep concept
of sets in mind when you read source code.