|
GRASS Programmer's Manual
6.5.svn(2014)-r66266
|
Network Analysis library - spanning tree. More...
#include <stdio.h>#include <stdlib.h>#include <grass/gis.h>#include <grass/Vect.h>#include <grass/glocale.h>#include <grass/dgl/graph.h>
Go to the source code of this file.
Data Structures | |
| struct | union_find |
| struct | edge_cost_pair |
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 88 of file spanningtree.c.
References edge_cost_pair::cost, dglEdgeGet_Cost(), dglEdgeGet_Head(), dglEdgeGet_Id(), dglEdgeGet_Tail(), dglEdgeset_T_First(), dglEdgeset_T_Initialize(), dglEdgeset_T_Next(), dglEdgeset_T_Release(), dglGet_EdgeCount(), dglGet_NodeCount(), dglGetNode(), dglNodeGet_Id(), dglNodeGet_OutEdgeset(), edge_cost_pair::edge, G_fatal_error(), G_free(), G_message(), G_percent(), G_percent_reset(), and Vect_list_append().