GRASS Programmer's Manual  6.5.svn(2014)-r66266
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Pages
articulation_point.c File Reference

Network Analysis library - connected components. More...

#include <stdio.h>
#include <stdlib.h>
#include <grass/gis.h>
#include <grass/Vect.h>
#include <grass/glocale.h>
#include <grass/dgl/graph.h>
Include dependency graph for articulation_point.c:

Go to the source code of this file.


int NetA_articulation_points (dglGraph_s *graph, struct ilist *articulation_list)
 Get number of articulation points in the graph. More...

Detailed Description

Network Analysis library - connected components.

Computes strongly and weakly connected components.

(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.

Daniel Bundala (Google Summer of Code 2009)

Definition in file articulation_point.c.

Function Documentation

int NetA_articulation_points ( dglGraph_s graph,
struct ilist *  articulation_list 

Get number of articulation points in the graph.

graphinput graph
[out]articulation_listlist of articulation points
number of points
-1 on error

Definition at line 32 of file articulation_point.c.

References 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(), NULL, and Vect_list_append().