spanningtree.c File Reference

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>

Include dependency graph for spanningtree.c:

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.

Detailed Description

Network Analysis library - spanning tree.

Computes minimum spanning tree in the network.

SPDX-FileCopyrightText: 2009-2010 Daniel Bundala SPDX-FileCopyrightText: GRASS Development Team SPDX-License-Identifier: GPL-2.0-or-later

Author

Daniel Bundala (Google Summer of Code 2009)

Definition in file spanningtree.c.

Function Documentation

NetA_spanning_tree()

int NetA_spanning_tree	(	dglGraph_s *	graph,
		struct ilist *	tree_list
	)

Get number of edges in the spanning forest.

Parameters

	graph	input graph
[out]	tree_list	list of edges

Returns

number of edges

-1 on failure

Definition at line 89 of file spanningtree.c.

References _, 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(), G_calloc, G_fatal_error(), G_free(), G_message(), G_percent(), G_percent_reset(), and Vect_list_append().