Network Analysis library - bridges. 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 bridge.c:

Go to the source code of this file.

Functions
int	NetA_compute_bridges (dglGraph_s graph, struct ilist bridge_list)
	Get number of bridges in the graph.

Detailed Description

Network Analysis library - bridges.

Computes number of bridges in the graph.

This program is free software under the GNU General Public License (>=v2). Read the file COPYING that comes with GRASS for details.

Author: Daniel Bundala (Google Summer of Code 2009)

Definition in file bridge.c.

Function Documentation

◆ NetA_compute_bridges()

int NetA_compute_bridges	(	dglGraph_s *	graph,
		struct ilist *	bridge_list
	)

Get number of bridges in the graph.

Bridge is an array containing the indices of the bridges.

Parameters

	graph	input graph
[out]	bridge_list	list of bridges

Returns: number of bridges, -1 on error

Definition at line 33 of file bridge.c.

References _, dglEdgeGet_Id(), dglEdgeGet_Tail(), dglEdgeset_T_First(), dglEdgeset_T_Initialize(), dglEdgeset_T_Next(), dglEdgeset_T_Release(), dglGet_NodeCount(), dglGetNode(), dglNode_T_First(), dglNode_T_Initialize(), dglNode_T_Next(), dglNode_T_Release(), dglNodeGet_Id(), dglNodeGet_OutEdgeset(), G_calloc, G_fatal_error(), G_free(), and Vect_list_append().

Functions

Detailed Description

Function Documentation

◆ NetA_compute_bridges()