17 #ifndef LIB_GRAPHPASS_H 18 #define LIB_GRAPHPASS_H 26 #include <sys/types.h> 32 typedef enum {
false,
true } bool;
35 igraph_attribute_table_t att;
42 igraph_integer_t NODESIZE;
49 igraph_vector_t WEIGHTED;
53 #define PROGRAM_NAME "Graph Pass" 54 #define BUG_REPORT "ryan.deschamps@gmail.com" 55 #define GIT_REPOSITORY "https://www.github.com/archivesunleashed/graphpass" 59 #define COLOUR_SET_PASTEL "pastel.h" 60 #define COLOUR_SET_PRIMARY "primary.h" 61 #define COLOUR_SET_DAMPENED "dampened.h" 65 #define VIZ_SET_SPACIOUS "viz_spacious.h" 66 #define VIZ_SET_LARGE "viz_large.h" 67 #define VIZ_SET_SMALL "vis_small.h" 71 #define ALL_METHODS 'abcdehioprw' 72 #define SIZE_DEFAULT "Degree" 73 #define SIZE_DEFAULT_CHAR 'd' 74 #define COLOR_BASE "WalkTrapModularity" 75 #define PAGERANK_DAMPING 0.85 76 #define LAYOUT_DEFAULT_CHAR = 'f' 78 #define NELEMS(x) (sizeof(x) / sizeof((x)[0])) 99 struct Node* reciprocity;
100 struct Node* degcent;
101 struct Node* idegcent;
102 struct Node* odegcent;
103 struct Node* eigcent;
104 struct Node* pagecent;
105 struct Node* diameter;
106 struct Node* pathlength;
107 struct Node* clustering;
110 int shuffle(
int *array,
int n);
112 int push(
struct Node** head_ref, igraph_real_t value,
char* attr);
119 igraph_bool_t prefixattr);
123 int colors (igraph_t *graph);
125 int set_size(igraph_t *graph, igraph_vector_t *v,
int max);
127 int strip_ext(
char *fname);
128 int load_graph (
char* filename);
129 int write_graph(igraph_t *graph,
char *attr);
132 extern int calc_hub(igraph_t *graph);
137 extern int calc_degree(igraph_t *graph,
char type);
145 int shrink (igraph_t *graph,
int cutsize,
char* attr);
146 int runFilters (igraph_t *graph,
int cutsize);
int filter_graph()
Definition: filter.c:278
int push(struct Node **head_ref, igraph_real_t value, char *attr)
Definition: reports.c:31
int calc_hub(igraph_t *graph)
Definition: analyze.c:72
int set_size(igraph_t *graph, igraph_vector_t *v, int max)
Definition: viz.c:155
int calc_pagerank(igraph_t *graph)
Definition: analyze.c:90
int calc_modularity(igraph_t *graph)
Definition: analyze.c:166
int igraph_i_xml_escape(char *src, char **dest)
Definition: gexf.c:18
float fix_percentile()
Definition: filter.c:32
int pushRank(struct RankNode **head_ref, int rankids[20])
Definition: reports.c:41
int calc_degree(igraph_t *graph, char type)
Definition: analyze.c:135
int write_report(igraph_t *graph)
Definition: reports.c:52
int layout_graph(igraph_t *graph, char layout)
Definition: viz.c:115
unimplemented struct for holding the top 20 rankids for the graph.
Definition: graphpass.h:89
int centralization(igraph_t *graph, char *attr)
Definition: analyze.c:198
int colors(igraph_t *graph)
Definition: viz.c:26
int calc_eigenvector(igraph_t *graph)
Definition: analyze.c:107
int calc_authority(igraph_t *graph)
Definition: analyze.c:53
int analysis_all(igraph_t *graph)
Definition: analyze.c:224
int create_filtered_graph(igraph_t *graph, double cutoff, int cutsize, char *attr)
Definition: filter.c:49
int shuffle(int *array, int n)
Definition: rnd.c:36
int calc_betweenness(igraph_t *graph)
Definition: analyze.c:36
int igraph_write_graph_gexf(const igraph_t *graph, FILE *outstream, igraph_bool_t prefixattr)
Definition: gexf.c:59
Holds graph level values for each graph that has been filtered.
Definition: graphpass.h:80