Graphviz 13.0.0~dev.20241220.2304
Loading...
Searching...
No Matches
mq.h
Go to the documentation of this file.
1/*************************************************************************
2 * Copyright (c) 2011 AT&T Intellectual Property
3 * All rights reserved. This program and the accompanying materials
4 * are made available under the terms of the Eclipse Public License v1.0
5 * which accompanies this distribution, and is available at
6 * https://www.eclipse.org/legal/epl-v10.html
7 *
8 * Contributors: Details at https://graphviz.org
9 *************************************************************************/
10
11#pragma once
12
13#include <stdbool.h>
14
15#ifdef __cplusplus
16extern "C" {
17#endif
18
20
22 int level;/* 0, 1, ... */
23 int n;
24 SparseMatrix A; /* n x n matrix */
29 int *matching; /* dimension n. matching[i] is the clustering assignment of node i */
30
31 /*
32
33 . |E(i,i)| |E(i,j)|
34 MQ/2 = (1/k) * \sum_{i=1...k} ------------ - (1/(k*(k-1))) * \sum_{i<j} -------------------
35 . |V(i)|^2 |V(i)|*|V(j)|
36 . = mq_in/k - mq_out/(k*(k-1))
37 */
38
39 double mq;
40 double mq_in, mq_out;/* mqs(A) = deg_in(A)/|A|^2 - deg_out(A)/|A|/(|V|-|A|) */
41 int ncluster; /* number of clusters */
42
43 double *deg_intra;/* dimension n. deg[i] equal to the sum of edge weights within cluster i */
44 double *dout;/* dimension n, dout[i] = \sum_{j -- i} a(i,j)/|j| is the scaled sum of outdegree */
45 double *wgt; /* total vertex weight each coarse grid vertex represent */
46};
47
48/* find a clustering of vertices by maximize modularity quality
49 A: symmetric square matrix n x n. If real value, value will be used as edges weights, otherwise edge weights are considered as 1.
50
51 maxcluster: used to specify the maximum number of cluster desired, e.g., maxcluster=10 means that a maximum of 10 clusters
52 . is desired. this may not always be realized, and modularity quality may be low when this is specified. Default: maxcluster = 0 (no limit)
53
54 nclusters: on output the number of clusters
55 assignment: dimension n. Node i is assigned to cluster "assignment[i]". 0 <= assignment < nclusters.
56 . If *assignment = NULL on entry, it will be allocated. Otherwise used.
57 mq: achieve modularity
58*/
59void mq_clustering(SparseMatrix A, int maxcluster,
60 int *nclusters, int **assignment, double *mq);
61
62#ifdef __cplusplus
63}
64#endif
#define A(n, t)
Definition expr.h:76
void mq_clustering(SparseMatrix A, int maxcluster, int *nclusters, int **assignment, double *mq)
Definition mq.c:583
struct Multilevel_MQ_Clustering_struct * Multilevel_MQ_Clustering
Definition mq.h:19
Multilevel_MQ_Clustering prev
Definition mq.h:27
Multilevel_MQ_Clustering next
Definition mq.h:26