bibin/cphb
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

References

Browse source
This commit is contained in:
Antti H S Laaksonen 2017-02-21 01:17:36 +02:00
parent 797035fd8a
commit 07816edf67
16 changed files with 237 additions and 40 deletions
Download patch file Download diff file Expand all files Collapse all files

4
luku15.tex
View file

@ -123,7 +123,7 @@ maximum spanning trees by processing the edges in reverse order.
\index{Kruskal's algorithm}
In \key{Kruskal's algorithm}, the initial spanning tree
In \key{Kruskal's algorithm} \cite{kru56}, the initial spanning tree
only contains the nodes of the graph
and does not contain any edges.
Then the algorithm goes through the edges
@ -567,7 +567,7 @@ the smaller set to the larger set.
\index{Prim's algorithm}
\key{Prim's algorithm} is an alternative method
\key{Prim's algorithm} \cite{pri57} is an alternative method
for finding a minimum spanning tree.
The algorithm first adds an arbitrary node
to the tree.