Quelle gutils.h Sprache: C

/* gutils.h - procedure declarations for gutil1.c and gutil2.c */

#ifndef  _GUTILS_H_    /* only process this file once */
#define  _GUTILS_H_

#ifdef __cplusplus
extern "C" {
#endif

extern void degstats(graph*,int,int,
                     unsigned long*,int*,int*,int*,int*,boolean*);
extern void degstats2(graph*,boolean,int,int,unsigned long*,int*l,
     int*,int*,int*,int*, int*, int*,int*,int*, boolean*);
extern void degstats3(graph*,int,int,
                     unsigned long*,int*,int*,int*,int*,int*);
extern void diamstats(graph*,int,int,int*,int*);
extern void find_dist(graph*,int,int,int,int*);
extern void find_dist2(graph*,int,int,int,int,int*);
extern int numcomponents(graph*,int,int);
extern int numcomponents1(graph*,int);
extern int girth(graph*,int,int);
extern boolean isbiconnected1(graph*,int);
extern boolean isbiconnected(graph*,int,int);
extern boolean isbipartite(graph*,int,int);
extern int bipartiteside(graph*,int,int);
extern boolean twocolouring(graph*,int*,int,int);
extern boolean isconnected1(graph*,int);
extern boolean isconnected(graph*,int,int);
extern boolean issubconnected(graph*,set*,int,int);
extern long maxcliques(graph*,int,int);
extern int maxcliquesize(graph*,int,int);
extern int maxindsetsize(graph*,int,int);
extern void sources_sinks(graph*,int,int,int*,int*);

extern long digoncount(graph*,int,int);
extern int loopcount(graph*,int,int);
extern long pathcount1(graph*,int,setword,setword);
extern long cyclecount1(graph*,int);
extern long cyclecount(graph*,int,int);
extern long indpathcount1(graph*,int,setword,setword);
extern long indcyclecount1(graph*,int);
extern long indcyclecount(graph*,int,int);
extern void commonnbrs(graph*,int*,int*,int*,int*,int,int);
extern void contract1(graph*,graph*,int,int,int);
extern int cstarcontent(graph*,int,int);
extern long numtriangles1(graph*,int);
extern long numtriangles(graph*,int,int);
extern long numtriangles1(graph*,int);
extern long numind3sets(graph*,int,int);
extern long numind3sets1(graph*,int);
extern long numdirtriangles(graph*,int,int);
extern long numdirtriangles1(graph*,int);
extern long numsquares(graph*,int,int);
extern long numdiamonds(graph*,int,int);
extern void delete1(graph*,graph*,int,int);
extern int conncontent(graph*,int,int);
extern boolean stronglyconnected(graph*,int,int);

/* extern int diameter_sg(sparsegraph*,int*,int*); */

#ifdef __cplusplus
}
#endif

#endif

quality92%

¤ Dauer der Verarbeitung: 0.15 Sekunden (vorverarbeitet) ¤

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.