GRASS GIS 8 Programmer's Manual
8.5.0dev(2024)-847944e18e
|
Network Analysis library - spanning tree. More...
#include <stdio.h>
#include <stdlib.h>
#include <grass/gis.h>
#include <grass/vector.h>
#include <grass/glocale.h>
#include <grass/dgl/graph.h>
Go to the source code of this file.
Functions | |
int | NetA_spanning_tree (dglGraph_s *graph, struct ilist *tree_list) |
Get number of edges in the spanning forest. More... | |
Network Analysis library - spanning tree.
Computes minimum spanning tree in the network.
(C) 2009-2010 by Daniel Bundala, and the GRASS Development Team
This program is free software under the GNU General Public License (>=v2). Read the file COPYING that comes with GRASS for details.
Definition in file spanningtree.c.
int NetA_spanning_tree | ( | dglGraph_s * | graph, |
struct ilist * | tree_list | ||
) |
Get number of edges in the spanning forest.
graph | input graph | |
[out] | list | of edges |
Definition at line 90 of file spanningtree.c.
References dglGet_EdgeCount(), dglGet_NodeCount(), and G_calloc.