|
GRASS Programmer's Manual
6.5.svn(2014)-r66266
|
#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.
Functions | |
| int | NetA_compute_bridges (dglGraph_s *graph, struct ilist *bridge_list) |
| Get number of bridges in the graph. More... | |
| 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.
| graph | input graph | |
| [out] | bridges_list | list of bridges |
Definition at line 34 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_fatal_error(), G_free(), and Vect_list_append().