| Name : perl-Graph-Kruskal
| |
| Version : 2.0
| Vendor : obs://build_opensuse_org/devel:languages:perl
|
| Release : lp155.6.1
| Date : 2023-07-20 17:43:11
|
| Group : Development/Libraries/Perl
| Source RPM : perl-Graph-Kruskal-2.0-lp155.6.1.src.rpm
|
| Size : 0.02 MB
| |
| Packager : https://www_suse_com/
| |
| Summary : Kruskal\'s Algorithm for Minimal Spanning Trees in Graphs
|
Description :
This algorithm computes the Minimal Spanning Tree of a given graph
according to some cost function defined on the edges of that graph.
Input: A set of vortices which constitute a graph (some cities on a map,
for example), a set of edges (i.e., roads) between the vortices of the
(non-directed and connected) graph (i.e., the edges can be traveled in
either direction, and a path must exist between any two vortices), and the
cost of each edge (for instance, the geographical distance).
Output: A set of edges forming a spanning tree (i.e., a set of edges
linking all vortices, so that a path exists between any two vortices) which
is free of circles (because it\'s a tree) and which is minimal in terms of
the cost function defined on the set of edges.
See Aho, Hopcroft, Ullman, \"The Design and Analysis of Computer Algorithms\"
for more details on the algorithm.
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/devel:/languages:/perl:/CPAN-G/15.5/noarch |
