@graphrs/core 0.0.0-canary.4aee852 → 0.1.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +21 -0
- package/package.json +5 -5
- package/wasm/igraph_wasm.d.ts +837 -0
- package/wasm/igraph_wasm.js +7333 -0
- package/wasm/igraph_wasm_bg.wasm +0 -0
- package/wasm/igraph_wasm_bg.wasm.d.ts +407 -0
|
@@ -0,0 +1,837 @@
|
|
|
1
|
+
/* tslint:disable */
|
|
2
|
+
/* eslint-disable */
|
|
3
|
+
|
|
4
|
+
export class WasmGraph {
|
|
5
|
+
free(): void;
|
|
6
|
+
[Symbol.dispose](): void;
|
|
7
|
+
addEdge(u: number, v: number): void;
|
|
8
|
+
adhesion(): string;
|
|
9
|
+
static adjacencyMatrix(matrix: BigInt64Array, n: number, mode: string): WasmGraph;
|
|
10
|
+
allMinimalStSeparators(): string;
|
|
11
|
+
allSimplePaths(source: number, target: number): string;
|
|
12
|
+
allStCuts(source: number, target: number): string;
|
|
13
|
+
allStMincuts(source: number, target: number, capacity?: Float64Array | null): string;
|
|
14
|
+
areAdjacent(v1: number, v2: number): boolean;
|
|
15
|
+
articulationPoints(): string;
|
|
16
|
+
assortativity(values: Float64Array, directed: boolean): number;
|
|
17
|
+
assortativityDegree(): string;
|
|
18
|
+
assortativityNominal(types: Uint32Array, directed: boolean): number;
|
|
19
|
+
static asymmetricPreferenceGame(nodes: number, no_out_types: number, no_in_types: number, pref_matrix_flat: Float64Array, loops: boolean, seed: number): WasmGraph;
|
|
20
|
+
static atlasGraph(number: number): WasmGraph;
|
|
21
|
+
automorphismGroup(): string;
|
|
22
|
+
averageLocalEfficiency(): number;
|
|
23
|
+
averagePathLength(): string;
|
|
24
|
+
avgNearestNeighborDegree(): string;
|
|
25
|
+
static barabasiAlbert(n: number, m: number, seed: bigint): WasmGraph;
|
|
26
|
+
bellmanFordDistances(source: number, weights: Float64Array): string;
|
|
27
|
+
betweenness(): string;
|
|
28
|
+
betweennessCutoff(cutoff: number): Float64Array;
|
|
29
|
+
betweennessWeighted(weights: Float64Array): string;
|
|
30
|
+
bfs(root: number): string;
|
|
31
|
+
bfsSimple(root: number, mode: string): string;
|
|
32
|
+
bfsTree(root: number): string;
|
|
33
|
+
static biadjacencyMatrix(matrix: Float64Array, nrow: number, ncol: number, directed: boolean): string;
|
|
34
|
+
bibcoupling(): string;
|
|
35
|
+
biconnectedComponents(): string;
|
|
36
|
+
static bipartiteGameGnm(n1: number, n2: number, m: number, directed: boolean, mode: string, seed: number): WasmGraph;
|
|
37
|
+
static bipartiteGameGnp(n1: number, n2: number, p: number, directed: boolean, mode: string, seed: number): WasmGraph;
|
|
38
|
+
bipartiteProjectionSize(types: Uint8Array): string;
|
|
39
|
+
bondPercolation(edge_order: Uint32Array): string;
|
|
40
|
+
bridges(): string;
|
|
41
|
+
canonicalPermutation(): string;
|
|
42
|
+
cartesianProduct(other: WasmGraph): WasmGraph;
|
|
43
|
+
chromaticNumberUpperBound(): string;
|
|
44
|
+
static chungLuGame(out_weights: Float64Array, variant: string, loops: boolean, seed: number): WasmGraph;
|
|
45
|
+
static circulant(n: number, shifts: Int32Array, directed: boolean): WasmGraph;
|
|
46
|
+
cliqueNumber(): string;
|
|
47
|
+
cliqueSizeHist(): string;
|
|
48
|
+
cliques(min_size: number, max_size: number): string;
|
|
49
|
+
closeness(): string;
|
|
50
|
+
closenessWeighted(weights: Float64Array): string;
|
|
51
|
+
clusteringCoefficients(): string;
|
|
52
|
+
cocitation(): string;
|
|
53
|
+
cohesion(): string;
|
|
54
|
+
cohesiveBlocks(): string;
|
|
55
|
+
communityVoronoi(): string;
|
|
56
|
+
complement(): WasmGraph;
|
|
57
|
+
compose(other: WasmGraph): WasmGraph;
|
|
58
|
+
connectNeighborhood(order: number): WasmGraph;
|
|
59
|
+
connectedComponents(): string;
|
|
60
|
+
constraint(): string;
|
|
61
|
+
contractVertices(mapping: Uint32Array): string;
|
|
62
|
+
convergenceDegree(): string;
|
|
63
|
+
static convexHull2d(points_flat: Float64Array): string;
|
|
64
|
+
coreness(): string;
|
|
65
|
+
corenessWithMode(mode: string): string;
|
|
66
|
+
correlatedGame(corr: number, p: number, seed: number): WasmGraph;
|
|
67
|
+
static correlatedPairGame(n: number, corr: number, p: number, directed: boolean, seed: number): string;
|
|
68
|
+
countAdjacentTriangles(): string;
|
|
69
|
+
countAutomorphisms(): string;
|
|
70
|
+
countLoops(): string;
|
|
71
|
+
countMutual(loops: boolean): string;
|
|
72
|
+
countReachable(): string;
|
|
73
|
+
cutValue(partition: Uint8Array): string;
|
|
74
|
+
static cycleGraph(n: number): WasmGraph;
|
|
75
|
+
static deBruijn(m: number, n: number): WasmGraph;
|
|
76
|
+
decompose(): WasmGraph[];
|
|
77
|
+
degeneracy(): string;
|
|
78
|
+
degreeCorrelationVector(mode: string): string;
|
|
79
|
+
degreeDistribution(): string;
|
|
80
|
+
degreeSequence(mode: string): string;
|
|
81
|
+
static degreeSequenceGame(out_degrees: Uint32Array, seed: number): WasmGraph;
|
|
82
|
+
static delaunayGraph(points_flat: Float64Array, dim: number): WasmGraph;
|
|
83
|
+
density(): string;
|
|
84
|
+
dfs(root: number): string;
|
|
85
|
+
diameter(): string;
|
|
86
|
+
difference(other: WasmGraph): WasmGraph;
|
|
87
|
+
dijkstra(source: number, weights: Float64Array): string;
|
|
88
|
+
disjointUnion(other: WasmGraph): WasmGraph;
|
|
89
|
+
static disjointUnionMany(graphs: WasmGraph[]): WasmGraph;
|
|
90
|
+
distances(source: number): string;
|
|
91
|
+
dominatorTree(root: number, mode: string): string;
|
|
92
|
+
eccentricity(): string;
|
|
93
|
+
ecount(): number;
|
|
94
|
+
edgeBetweenness(): string;
|
|
95
|
+
edgeBetweennessCommunity(): string;
|
|
96
|
+
edgeBetweennessCommunityWeighted(weights: Float64Array): string;
|
|
97
|
+
edgeBetweennessCutoff(cutoff: number): Float64Array;
|
|
98
|
+
edgeBetweennessWeighted(weights: Float64Array): Float64Array;
|
|
99
|
+
edgeConnectivity(): string;
|
|
100
|
+
edgeDisjointPaths(source: number, target: number): string;
|
|
101
|
+
eigenvectorCentrality(): string;
|
|
102
|
+
static erdosRenyi(n: number, p: number, seed: bigint): WasmGraph;
|
|
103
|
+
static erdosRenyiGnm(n: number, m: number, directed: boolean, loops: boolean, seed: number): WasmGraph;
|
|
104
|
+
static erdosRenyiGnp(n: number, p: number, directed: boolean, loops: boolean, seed: number): WasmGraph;
|
|
105
|
+
eulerianCycle(): string;
|
|
106
|
+
eulerianPath(): string;
|
|
107
|
+
evenTarjanReduction(): string;
|
|
108
|
+
static expandPathToPairs(path: Uint32Array): string;
|
|
109
|
+
static extendedChordalRing(nodes: number, w_flat: Int32Array, cols: number, directed: boolean): WasmGraph;
|
|
110
|
+
static famous(name: string): WasmGraph;
|
|
111
|
+
static famousGraph(name: string): WasmGraph;
|
|
112
|
+
static famousNames(): string;
|
|
113
|
+
fastGreedy(): string;
|
|
114
|
+
feedbackArcSet(weights?: Float64Array | null): string;
|
|
115
|
+
feedbackVertexSet(): string;
|
|
116
|
+
findCycle(): string;
|
|
117
|
+
floydWarshallDistances(): string;
|
|
118
|
+
fluidCommunities(k: number): string;
|
|
119
|
+
static forestFireGame(n: number, fw_prob: number, bw_factor: number, directed: boolean, seed: number): WasmGraph;
|
|
120
|
+
/**
|
|
121
|
+
* Create from a flat array of edge pairs: [u0, v0, u1, v1, ...].
|
|
122
|
+
*/
|
|
123
|
+
static fromEdges(edges_flat: Uint32Array, directed: boolean): WasmGraph;
|
|
124
|
+
static fromPrufer(prufer: Uint32Array): WasmGraph;
|
|
125
|
+
static fullBipartite(n1: number, n2: number, directed: boolean, mode: string): WasmGraph;
|
|
126
|
+
static fullCitation(n: number, directed: boolean): WasmGraph;
|
|
127
|
+
static fullGraph(n: number): WasmGraph;
|
|
128
|
+
fundamentalCycles(): string;
|
|
129
|
+
static gabrielGraph(points_flat: Float64Array, dim: number): WasmGraph;
|
|
130
|
+
static generalizedPetersen(n: number, k: number): WasmGraph;
|
|
131
|
+
getAdjacency(adj_type: string): string;
|
|
132
|
+
getEdgelist(): string;
|
|
133
|
+
getEdges(): Uint32Array;
|
|
134
|
+
getLaplacian(normalization: string): string;
|
|
135
|
+
getShortestPath(from: number, to: number, mode: string): string;
|
|
136
|
+
getStochastic(column_wise: boolean): string;
|
|
137
|
+
girth(): string;
|
|
138
|
+
globalEfficiency(): string;
|
|
139
|
+
gomoryHuTree(): string;
|
|
140
|
+
graphCenter(): string;
|
|
141
|
+
graphJoin(other: WasmGraph): WasmGraph;
|
|
142
|
+
graphPower(order: number): WasmGraph;
|
|
143
|
+
graphProperties(): string;
|
|
144
|
+
graphStats(): string;
|
|
145
|
+
static grgGame(n: number, radius: number, torus: boolean, seed: number): WasmGraph;
|
|
146
|
+
static grgGameWithCoords(n: number, radius: number, torus: boolean, seed: number): string;
|
|
147
|
+
static growingRandomGame(n: number, m: number, directed: boolean, seed: number): WasmGraph;
|
|
148
|
+
static hammingGraph(n: number, q: number, directed: boolean): WasmGraph;
|
|
149
|
+
harmonicCentrality(): string;
|
|
150
|
+
harmonicCentralityCutoff(cutoff: number, normalized: boolean): Float64Array;
|
|
151
|
+
harmonicCentralityWeighted(weights: Float64Array): Float64Array;
|
|
152
|
+
hasMutual(loops: boolean): boolean;
|
|
153
|
+
static hexagonalLattice(dims: Uint32Array, directed: boolean, mutual: boolean): WasmGraph;
|
|
154
|
+
hrgConsensus(num_samples: bigint, seed: bigint): string;
|
|
155
|
+
hrgCreate(probs_flat: Float64Array): string;
|
|
156
|
+
hrgFit(steps: bigint, seed: bigint): string;
|
|
157
|
+
hrgGame(steps: bigint, seed: bigint): string;
|
|
158
|
+
hrgPredict(num_samples: bigint, seed: bigint): string;
|
|
159
|
+
hrgSample(steps: bigint, seed: bigint): string;
|
|
160
|
+
static hsbmGame(n: number, m: number, rho_flat: Float64Array, c_flat: Float64Array, p: number, seed: number): WasmGraph;
|
|
161
|
+
static hsbmListGame(nodes: number, m_list: Uint32Array, prob: number, seed: number): WasmGraph;
|
|
162
|
+
hubAndAuthorityScores(): string;
|
|
163
|
+
static hypercube(n: number, directed: boolean): WasmGraph;
|
|
164
|
+
static hypercubeGraph(n: number, directed: boolean): WasmGraph;
|
|
165
|
+
independenceNumber(): string;
|
|
166
|
+
inducedSubgraph(vids: Uint32Array): string;
|
|
167
|
+
infomap(): string;
|
|
168
|
+
intersection(other: WasmGraph): WasmGraph;
|
|
169
|
+
static intersectionMany(graphs: WasmGraph[]): WasmGraph;
|
|
170
|
+
static invertPermutation(perm: Uint32Array): string;
|
|
171
|
+
isAcyclic(): string;
|
|
172
|
+
isApexForest(): boolean;
|
|
173
|
+
isApexTree(): boolean;
|
|
174
|
+
isBannerFree(): boolean;
|
|
175
|
+
isBiconnected(): string;
|
|
176
|
+
isBipartite(): string;
|
|
177
|
+
isBipartiteDetailed(): string;
|
|
178
|
+
isBiregular(): boolean;
|
|
179
|
+
isBlockGraph(): boolean;
|
|
180
|
+
isBowtieFree(): boolean;
|
|
181
|
+
isBullFree(): boolean;
|
|
182
|
+
isC4Free(): boolean;
|
|
183
|
+
isC5Free(): boolean;
|
|
184
|
+
isCactusGraph(): boolean;
|
|
185
|
+
isCaterpillar(): boolean;
|
|
186
|
+
isChainGraph(): boolean;
|
|
187
|
+
isChordalBipartite(): boolean;
|
|
188
|
+
isClawFree(): boolean;
|
|
189
|
+
isClique(vertices: Uint32Array, directed: boolean): boolean;
|
|
190
|
+
isClusterGraph(): boolean;
|
|
191
|
+
isCoBipartite(): boolean;
|
|
192
|
+
isCoChordal(): boolean;
|
|
193
|
+
isCograph(): boolean;
|
|
194
|
+
isComplete(): string;
|
|
195
|
+
isCompleteBipartite(): boolean;
|
|
196
|
+
isCompleteMultipartite(): boolean;
|
|
197
|
+
isConnected(mode: string): boolean;
|
|
198
|
+
isCricketFree(): boolean;
|
|
199
|
+
isCubic(): string;
|
|
200
|
+
isCycle(): string;
|
|
201
|
+
isDag(): string;
|
|
202
|
+
isDartFree(): boolean;
|
|
203
|
+
isDiamondFree(): boolean;
|
|
204
|
+
isDirected(): boolean;
|
|
205
|
+
isDistanceHereditary(): boolean;
|
|
206
|
+
isDominatingSet(dom_set: Uint32Array): boolean;
|
|
207
|
+
isEdgeCover(cover: Uint32Array): boolean;
|
|
208
|
+
isEulerian(): string;
|
|
209
|
+
isForest(): string;
|
|
210
|
+
isForkFree(): boolean;
|
|
211
|
+
isGemFree(): boolean;
|
|
212
|
+
isGeodetic(): boolean;
|
|
213
|
+
isHouseFree(): boolean;
|
|
214
|
+
isIndependentVertexSet(vertices: Uint32Array): boolean;
|
|
215
|
+
isKDegenerate(k: number): boolean;
|
|
216
|
+
isLobster(): boolean;
|
|
217
|
+
isMutual(loops: boolean): string;
|
|
218
|
+
isNetFree(): boolean;
|
|
219
|
+
isOuterplanar(): string;
|
|
220
|
+
isP5Free(): boolean;
|
|
221
|
+
isPath(): string;
|
|
222
|
+
isPawFree(): boolean;
|
|
223
|
+
isPerfect(): string;
|
|
224
|
+
isPlanar(): string;
|
|
225
|
+
isProperInterval(): boolean;
|
|
226
|
+
isPseudoForest(): boolean;
|
|
227
|
+
isPtolemaic(): boolean;
|
|
228
|
+
isRegular(): string;
|
|
229
|
+
isSameGraph(other: WasmGraph): boolean;
|
|
230
|
+
isSelfComplementary(): boolean;
|
|
231
|
+
isSemicomplete(): boolean;
|
|
232
|
+
isSeriesParallel(): boolean;
|
|
233
|
+
isSimple(): string;
|
|
234
|
+
isSimpleWithMode(mode: string): boolean;
|
|
235
|
+
isSpider(): boolean;
|
|
236
|
+
isSplitGraph(): boolean;
|
|
237
|
+
isStar(): string;
|
|
238
|
+
isStronglyChordal(): boolean;
|
|
239
|
+
isThresholdGraph(): boolean;
|
|
240
|
+
isTournament(): string;
|
|
241
|
+
isTree(): string;
|
|
242
|
+
isTriangleFree(): string;
|
|
243
|
+
isUnicyclic(): boolean;
|
|
244
|
+
isVertexCover(cover: Uint32Array): boolean;
|
|
245
|
+
isWeaklyChordal(): boolean;
|
|
246
|
+
isWellCovered(): boolean;
|
|
247
|
+
isWheel(): string;
|
|
248
|
+
isWindmill(): boolean;
|
|
249
|
+
isomorphic(other: WasmGraph): boolean;
|
|
250
|
+
isomorphicBliss(other: WasmGraph): string;
|
|
251
|
+
johnsonDistances(weights: Float64Array): string;
|
|
252
|
+
jointDegreeDistribution(normalized: boolean): string;
|
|
253
|
+
static kRegularGame(n: number, k: number, directed: boolean, seed: number): WasmGraph;
|
|
254
|
+
kShortestPaths(source: number, target: number, k: number): string;
|
|
255
|
+
static karyTree(n: number, children: number, mode: string): WasmGraph;
|
|
256
|
+
katzCentrality(): string;
|
|
257
|
+
static kautzGraph(m: number, n: number): WasmGraph;
|
|
258
|
+
labelPropagation(): string;
|
|
259
|
+
layoutBipartite(types_flat: Uint8Array): string;
|
|
260
|
+
layoutCircle(): string;
|
|
261
|
+
layoutDavidsonHarel(): string;
|
|
262
|
+
layoutDrl(): string;
|
|
263
|
+
layoutDrl3d(): string;
|
|
264
|
+
layoutFr(niter: number): string;
|
|
265
|
+
layoutGem(): string;
|
|
266
|
+
layoutGraphopt(): string;
|
|
267
|
+
layoutGrid(width: number): string;
|
|
268
|
+
layoutKamadaKawai(): string;
|
|
269
|
+
layoutLgl(): string;
|
|
270
|
+
layoutMds(): string;
|
|
271
|
+
layoutRandom(seed: bigint): string;
|
|
272
|
+
layoutReingoldTilford(root: number): string;
|
|
273
|
+
layoutStar(center: number): string;
|
|
274
|
+
layoutSugiyama(): string;
|
|
275
|
+
static lcfGraph(n: number, shifts: Int32Array, repeats: number): WasmGraph;
|
|
276
|
+
leadingEigenvector(): string;
|
|
277
|
+
leiden(): string;
|
|
278
|
+
lineGraph(): WasmGraph;
|
|
279
|
+
linegraph(): WasmGraph;
|
|
280
|
+
listTriangles(): string;
|
|
281
|
+
localEfficiency(): string;
|
|
282
|
+
louvain(): string;
|
|
283
|
+
maxDegree(mode: string): string;
|
|
284
|
+
maxFlow(source: number, target: number): string;
|
|
285
|
+
maxFlowDetailed(source: number, target: number): string;
|
|
286
|
+
maxFlowValue(source: number, target: number): number;
|
|
287
|
+
maximalCliques(): string;
|
|
288
|
+
maximumCut(): string;
|
|
289
|
+
maximumIndependentSet(): Uint32Array;
|
|
290
|
+
meanDegree(): string;
|
|
291
|
+
meanDistance(): string;
|
|
292
|
+
meanDistanceWeighted(weights: Float64Array, directed: boolean): number;
|
|
293
|
+
minDegree(mode: string): string;
|
|
294
|
+
mincut(): string;
|
|
295
|
+
mincutValue(): string;
|
|
296
|
+
minimumCycleBasis(): string;
|
|
297
|
+
minimumDominatingSet(): string;
|
|
298
|
+
minimumEdgeCover(): string;
|
|
299
|
+
minimumSpanningTree(weights?: Float64Array | null): string;
|
|
300
|
+
minimumVertexCover(): string;
|
|
301
|
+
modularity(membership: Uint32Array): string;
|
|
302
|
+
modularityMatrix(): string;
|
|
303
|
+
static mycielskiGraph(k: number): WasmGraph;
|
|
304
|
+
mycielskian(k: number): WasmGraph;
|
|
305
|
+
static nearestNeighborGraph(points_flat: Float64Array, dim: number, k: number): WasmGraph;
|
|
306
|
+
neighborhood(order: number): string;
|
|
307
|
+
constructor(directed: boolean);
|
|
308
|
+
pagerank(): string;
|
|
309
|
+
pagerankWeighted(weights: Float64Array): Float64Array;
|
|
310
|
+
static pathGraph(n: number, directed: boolean): WasmGraph;
|
|
311
|
+
pathLengthHist(directed: boolean): string;
|
|
312
|
+
permuteVertices(perm: Uint32Array): string;
|
|
313
|
+
personalizedPagerank(reset: Float64Array, damping: number): string;
|
|
314
|
+
static powerLawFit(data: Float64Array, xmin: number): string;
|
|
315
|
+
static preferenceGame(nodes: number, types: number, pref_matrix_flat: Float64Array, directed: boolean, loops: boolean, seed: number): string;
|
|
316
|
+
radius(): string;
|
|
317
|
+
randomSpanningTree(seed: bigint): string;
|
|
318
|
+
randomWalk(start: number, steps: number, seed: bigint): string;
|
|
319
|
+
reachabilityMatrix(): string;
|
|
320
|
+
static readDl(text: string, directed: boolean): WasmGraph;
|
|
321
|
+
static readDot(text: string): WasmGraph;
|
|
322
|
+
static readEdgelist(text: string): WasmGraph;
|
|
323
|
+
static readGml(text: string): WasmGraph;
|
|
324
|
+
static readGraphml(text: string): WasmGraph;
|
|
325
|
+
static readLeda(text: string): WasmGraph;
|
|
326
|
+
static readLgl(text: string): WasmGraph;
|
|
327
|
+
static readNcol(text: string): WasmGraph;
|
|
328
|
+
static readPajek(text: string): WasmGraph;
|
|
329
|
+
static realizeDirectedDegreeSequence(outdeg: Uint32Array, indeg: Uint32Array): WasmGraph;
|
|
330
|
+
static recentDegreeGame(nodes: number, power: number, time_window: number, m: number, directed: boolean, seed: number): WasmGraph;
|
|
331
|
+
reciprocity(): string;
|
|
332
|
+
static regularTree(h: number, k: number, mode: string): WasmGraph;
|
|
333
|
+
regularity(): string;
|
|
334
|
+
static relativeNeighborhoodGraph(points_flat: Float64Array, dim: number): WasmGraph;
|
|
335
|
+
reverse(): WasmGraph;
|
|
336
|
+
reverseEdges(eids: Uint32Array): WasmGraph;
|
|
337
|
+
reverseGraph(): string;
|
|
338
|
+
rewire(num_trials: number, loops: boolean, seed: number): WasmGraph;
|
|
339
|
+
richClubSequence(): string;
|
|
340
|
+
static ringGraph(n: number, circular: boolean): WasmGraph;
|
|
341
|
+
static runningMean(data: Float64Array, binwidth: number): string;
|
|
342
|
+
satisfiesDirac(): boolean;
|
|
343
|
+
satisfiesOre(): boolean;
|
|
344
|
+
static sbmGame(pref_matrix_flat: Float64Array, n_blocks: number, block_sizes: Uint32Array, directed: boolean, seed: number): WasmGraph;
|
|
345
|
+
shortestPath(source: number, target: number): string;
|
|
346
|
+
similarityDice(): string;
|
|
347
|
+
similarityJaccard(): string;
|
|
348
|
+
simpleCycles(mode: string, min_length: number, max_length: number, max_results: number): string;
|
|
349
|
+
static simpleInterconnectedIslandsGame(islands_n: number, islands_size: number, islands_pin: number, n_inter: number, seed: number): WasmGraph;
|
|
350
|
+
simplify(): WasmGraph;
|
|
351
|
+
sir(beta: number, gamma: number, no_sim: number, seed: number): string;
|
|
352
|
+
static solveLsap(costs: Float64Array, n: number): Uint32Array;
|
|
353
|
+
sortVerticesByDegree(mode: string, ascending: boolean): string;
|
|
354
|
+
spanner(stretch: number): string;
|
|
355
|
+
spatialEdgeLengths(coords_flat: Float64Array, dim: number): Float64Array;
|
|
356
|
+
spinglass(): string;
|
|
357
|
+
static squareLattice(dims: Uint32Array, nei: number, directed: boolean, mutual: boolean): WasmGraph;
|
|
358
|
+
stEdgeConnectivity(source: number, target: number): bigint;
|
|
359
|
+
stMincut(source: number, target: number): string;
|
|
360
|
+
stMincutValue(source: number, target: number): number;
|
|
361
|
+
stVertexConnectivity(source: number, target: number): string;
|
|
362
|
+
static starGraph(n: number): WasmGraph;
|
|
363
|
+
static staticFitnessGame(no_of_edges: number, fitness_out: Float64Array, loops: boolean, multiple: boolean, seed: number): WasmGraph;
|
|
364
|
+
static staticPowerLawGame(no_of_nodes: number, no_of_edges: number, exponent_out: number, loops: boolean, multiple: boolean, seed: number): WasmGraph;
|
|
365
|
+
strength(weights: Float64Array): string;
|
|
366
|
+
stronglyConnectedComponents(): string;
|
|
367
|
+
subcomponent(source: number, mode: string): string;
|
|
368
|
+
subisomorphic(other: WasmGraph): boolean;
|
|
369
|
+
static symmetricTree(branches: Uint32Array, mode: string): WasmGraph;
|
|
370
|
+
toDirected(mode: string): string;
|
|
371
|
+
toPrufer(): string;
|
|
372
|
+
toUndirected(mode: string): string;
|
|
373
|
+
topologicalSort(): string;
|
|
374
|
+
topologicalSorting(mode: string): Uint32Array;
|
|
375
|
+
transitiveClosure(): WasmGraph;
|
|
376
|
+
transitivity(): string;
|
|
377
|
+
static treeFromParentVector(parents: Int32Array, mode: string): WasmGraph;
|
|
378
|
+
static treeGameLerw(n: number, directed: boolean, seed: number): WasmGraph;
|
|
379
|
+
static treeGamePrufer(n: number, seed: number): WasmGraph;
|
|
380
|
+
triadCensus(): string;
|
|
381
|
+
static triangularLattice(dims: Uint32Array, directed: boolean, mutual: boolean): WasmGraph;
|
|
382
|
+
trussness(): string;
|
|
383
|
+
static turanGraph(n: number, r: number): WasmGraph;
|
|
384
|
+
unfoldTree(roots: Uint32Array, mode: string): string;
|
|
385
|
+
union(other: WasmGraph): WasmGraph;
|
|
386
|
+
static unionMany(graphs: WasmGraph[]): WasmGraph;
|
|
387
|
+
vcount(): number;
|
|
388
|
+
vertexColoring(): string;
|
|
389
|
+
vertexConnectivity(): string;
|
|
390
|
+
vertexDisjointPaths(source: number, target: number): string;
|
|
391
|
+
voronoi(generators: Uint32Array, mode: string, tiebreaker: string): string;
|
|
392
|
+
walktrap(): string;
|
|
393
|
+
static wattsStrogatz(n: number, k: number, p: number, seed: bigint): WasmGraph;
|
|
394
|
+
static wattsStrogatzGame(size: number, nei: number, p: number, seed: number): WasmGraph;
|
|
395
|
+
static wheelGraph(n: number, mode: string, center: number): WasmGraph;
|
|
396
|
+
writeDl(): string;
|
|
397
|
+
writeDot(): string;
|
|
398
|
+
writeEdgelist(): string;
|
|
399
|
+
writeGml(): string;
|
|
400
|
+
writeGraphml(): string;
|
|
401
|
+
writeLeda(): string;
|
|
402
|
+
writeLgl(): string;
|
|
403
|
+
writeNcol(): string;
|
|
404
|
+
writePajek(): string;
|
|
405
|
+
}
|
|
406
|
+
|
|
407
|
+
export type InitInput = RequestInfo | URL | Response | BufferSource | WebAssembly.Module;
|
|
408
|
+
|
|
409
|
+
export interface InitOutput {
|
|
410
|
+
readonly memory: WebAssembly.Memory;
|
|
411
|
+
readonly __wbg_wasmgraph_free: (a: number, b: number) => void;
|
|
412
|
+
readonly wasmgraph_addEdge: (a: number, b: number, c: number) => [number, number];
|
|
413
|
+
readonly wasmgraph_adhesion: (a: number) => [number, number, number, number];
|
|
414
|
+
readonly wasmgraph_adjacencyMatrix: (a: number, b: number, c: number, d: number, e: number) => [number, number, number];
|
|
415
|
+
readonly wasmgraph_allMinimalStSeparators: (a: number) => [number, number, number, number];
|
|
416
|
+
readonly wasmgraph_allSimplePaths: (a: number, b: number, c: number) => [number, number, number, number];
|
|
417
|
+
readonly wasmgraph_allStCuts: (a: number, b: number, c: number) => [number, number, number, number];
|
|
418
|
+
readonly wasmgraph_allStMincuts: (a: number, b: number, c: number, d: number, e: number) => [number, number, number, number];
|
|
419
|
+
readonly wasmgraph_areAdjacent: (a: number, b: number, c: number) => [number, number, number];
|
|
420
|
+
readonly wasmgraph_articulationPoints: (a: number) => [number, number, number, number];
|
|
421
|
+
readonly wasmgraph_assortativity: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
422
|
+
readonly wasmgraph_assortativityDegree: (a: number) => [number, number, number, number];
|
|
423
|
+
readonly wasmgraph_assortativityNominal: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
424
|
+
readonly wasmgraph_asymmetricPreferenceGame: (a: number, b: number, c: number, d: number, e: number, f: number, g: number) => [number, number, number];
|
|
425
|
+
readonly wasmgraph_atlasGraph: (a: number) => [number, number, number];
|
|
426
|
+
readonly wasmgraph_automorphismGroup: (a: number) => [number, number, number, number];
|
|
427
|
+
readonly wasmgraph_averageLocalEfficiency: (a: number) => [number, number, number];
|
|
428
|
+
readonly wasmgraph_averagePathLength: (a: number) => [number, number, number, number];
|
|
429
|
+
readonly wasmgraph_avgNearestNeighborDegree: (a: number) => [number, number, number, number];
|
|
430
|
+
readonly wasmgraph_barabasiAlbert: (a: number, b: number, c: bigint) => [number, number, number];
|
|
431
|
+
readonly wasmgraph_bellmanFordDistances: (a: number, b: number, c: number, d: number) => [number, number, number, number];
|
|
432
|
+
readonly wasmgraph_betweenness: (a: number) => [number, number, number, number];
|
|
433
|
+
readonly wasmgraph_betweennessCutoff: (a: number, b: number) => [number, number, number, number];
|
|
434
|
+
readonly wasmgraph_betweennessWeighted: (a: number, b: number, c: number) => [number, number, number, number];
|
|
435
|
+
readonly wasmgraph_bfs: (a: number, b: number) => [number, number, number, number];
|
|
436
|
+
readonly wasmgraph_bfsSimple: (a: number, b: number, c: number, d: number) => [number, number, number, number];
|
|
437
|
+
readonly wasmgraph_bfsTree: (a: number, b: number) => [number, number, number, number];
|
|
438
|
+
readonly wasmgraph_biadjacencyMatrix: (a: number, b: number, c: number, d: number, e: number) => [number, number, number, number];
|
|
439
|
+
readonly wasmgraph_bibcoupling: (a: number) => [number, number, number, number];
|
|
440
|
+
readonly wasmgraph_biconnectedComponents: (a: number) => [number, number, number, number];
|
|
441
|
+
readonly wasmgraph_bipartiteGameGnm: (a: number, b: number, c: number, d: number, e: number, f: number, g: number) => [number, number, number];
|
|
442
|
+
readonly wasmgraph_bipartiteGameGnp: (a: number, b: number, c: number, d: number, e: number, f: number, g: number) => [number, number, number];
|
|
443
|
+
readonly wasmgraph_bipartiteProjectionSize: (a: number, b: number, c: number) => [number, number, number, number];
|
|
444
|
+
readonly wasmgraph_bondPercolation: (a: number, b: number, c: number) => [number, number, number, number];
|
|
445
|
+
readonly wasmgraph_bridges: (a: number) => [number, number, number, number];
|
|
446
|
+
readonly wasmgraph_canonicalPermutation: (a: number) => [number, number, number, number];
|
|
447
|
+
readonly wasmgraph_cartesianProduct: (a: number, b: number) => [number, number, number];
|
|
448
|
+
readonly wasmgraph_chromaticNumberUpperBound: (a: number) => [number, number, number, number];
|
|
449
|
+
readonly wasmgraph_chungLuGame: (a: number, b: number, c: number, d: number, e: number, f: number) => [number, number, number];
|
|
450
|
+
readonly wasmgraph_circulant: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
451
|
+
readonly wasmgraph_cliqueNumber: (a: number) => [number, number, number, number];
|
|
452
|
+
readonly wasmgraph_cliqueSizeHist: (a: number) => [number, number, number, number];
|
|
453
|
+
readonly wasmgraph_cliques: (a: number, b: number, c: number) => [number, number, number, number];
|
|
454
|
+
readonly wasmgraph_closeness: (a: number) => [number, number, number, number];
|
|
455
|
+
readonly wasmgraph_closenessWeighted: (a: number, b: number, c: number) => [number, number, number, number];
|
|
456
|
+
readonly wasmgraph_clusteringCoefficients: (a: number) => [number, number, number, number];
|
|
457
|
+
readonly wasmgraph_cocitation: (a: number) => [number, number, number, number];
|
|
458
|
+
readonly wasmgraph_cohesion: (a: number) => [number, number, number, number];
|
|
459
|
+
readonly wasmgraph_cohesiveBlocks: (a: number) => [number, number, number, number];
|
|
460
|
+
readonly wasmgraph_communityVoronoi: (a: number) => [number, number, number, number];
|
|
461
|
+
readonly wasmgraph_complement: (a: number) => [number, number, number];
|
|
462
|
+
readonly wasmgraph_compose: (a: number, b: number) => [number, number, number];
|
|
463
|
+
readonly wasmgraph_connectNeighborhood: (a: number, b: number) => [number, number, number];
|
|
464
|
+
readonly wasmgraph_connectedComponents: (a: number) => [number, number, number, number];
|
|
465
|
+
readonly wasmgraph_constraint: (a: number) => [number, number, number, number];
|
|
466
|
+
readonly wasmgraph_contractVertices: (a: number, b: number, c: number) => [number, number, number, number];
|
|
467
|
+
readonly wasmgraph_convergenceDegree: (a: number) => [number, number, number, number];
|
|
468
|
+
readonly wasmgraph_convexHull2d: (a: number, b: number) => [number, number, number, number];
|
|
469
|
+
readonly wasmgraph_coreness: (a: number) => [number, number, number, number];
|
|
470
|
+
readonly wasmgraph_corenessWithMode: (a: number, b: number, c: number) => [number, number, number, number];
|
|
471
|
+
readonly wasmgraph_correlatedGame: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
472
|
+
readonly wasmgraph_correlatedPairGame: (a: number, b: number, c: number, d: number, e: number) => [number, number, number, number];
|
|
473
|
+
readonly wasmgraph_countAdjacentTriangles: (a: number) => [number, number, number, number];
|
|
474
|
+
readonly wasmgraph_countAutomorphisms: (a: number) => [number, number, number, number];
|
|
475
|
+
readonly wasmgraph_countLoops: (a: number) => [number, number, number, number];
|
|
476
|
+
readonly wasmgraph_countMutual: (a: number, b: number) => [number, number, number, number];
|
|
477
|
+
readonly wasmgraph_countReachable: (a: number) => [number, number, number, number];
|
|
478
|
+
readonly wasmgraph_cutValue: (a: number, b: number, c: number) => [number, number, number, number];
|
|
479
|
+
readonly wasmgraph_cycleGraph: (a: number) => [number, number, number];
|
|
480
|
+
readonly wasmgraph_deBruijn: (a: number, b: number) => [number, number, number];
|
|
481
|
+
readonly wasmgraph_decompose: (a: number) => [number, number, number, number];
|
|
482
|
+
readonly wasmgraph_degeneracy: (a: number) => [number, number, number, number];
|
|
483
|
+
readonly wasmgraph_degreeCorrelationVector: (a: number, b: number, c: number) => [number, number, number, number];
|
|
484
|
+
readonly wasmgraph_degreeDistribution: (a: number) => [number, number, number, number];
|
|
485
|
+
readonly wasmgraph_degreeSequence: (a: number, b: number, c: number) => [number, number, number, number];
|
|
486
|
+
readonly wasmgraph_degreeSequenceGame: (a: number, b: number, c: number) => [number, number, number];
|
|
487
|
+
readonly wasmgraph_delaunayGraph: (a: number, b: number, c: number) => [number, number, number];
|
|
488
|
+
readonly wasmgraph_density: (a: number) => [number, number, number, number];
|
|
489
|
+
readonly wasmgraph_dfs: (a: number, b: number) => [number, number, number, number];
|
|
490
|
+
readonly wasmgraph_diameter: (a: number) => [number, number, number, number];
|
|
491
|
+
readonly wasmgraph_difference: (a: number, b: number) => [number, number, number];
|
|
492
|
+
readonly wasmgraph_dijkstra: (a: number, b: number, c: number, d: number) => [number, number, number, number];
|
|
493
|
+
readonly wasmgraph_disjointUnion: (a: number, b: number) => [number, number, number];
|
|
494
|
+
readonly wasmgraph_disjointUnionMany: (a: number, b: number) => [number, number, number];
|
|
495
|
+
readonly wasmgraph_distances: (a: number, b: number) => [number, number, number, number];
|
|
496
|
+
readonly wasmgraph_dominatorTree: (a: number, b: number, c: number, d: number) => [number, number, number, number];
|
|
497
|
+
readonly wasmgraph_eccentricity: (a: number) => [number, number, number, number];
|
|
498
|
+
readonly wasmgraph_ecount: (a: number) => number;
|
|
499
|
+
readonly wasmgraph_edgeBetweenness: (a: number) => [number, number, number, number];
|
|
500
|
+
readonly wasmgraph_edgeBetweennessCommunity: (a: number) => [number, number, number, number];
|
|
501
|
+
readonly wasmgraph_edgeBetweennessCommunityWeighted: (a: number, b: number, c: number) => [number, number, number, number];
|
|
502
|
+
readonly wasmgraph_edgeBetweennessCutoff: (a: number, b: number) => [number, number, number, number];
|
|
503
|
+
readonly wasmgraph_edgeBetweennessWeighted: (a: number, b: number, c: number) => [number, number, number, number];
|
|
504
|
+
readonly wasmgraph_edgeConnectivity: (a: number) => [number, number, number, number];
|
|
505
|
+
readonly wasmgraph_edgeDisjointPaths: (a: number, b: number, c: number) => [number, number, number, number];
|
|
506
|
+
readonly wasmgraph_eigenvectorCentrality: (a: number) => [number, number, number, number];
|
|
507
|
+
readonly wasmgraph_erdosRenyi: (a: number, b: number, c: bigint) => [number, number, number];
|
|
508
|
+
readonly wasmgraph_erdosRenyiGnm: (a: number, b: number, c: number, d: number, e: number) => [number, number, number];
|
|
509
|
+
readonly wasmgraph_erdosRenyiGnp: (a: number, b: number, c: number, d: number, e: number) => [number, number, number];
|
|
510
|
+
readonly wasmgraph_eulerianCycle: (a: number) => [number, number, number, number];
|
|
511
|
+
readonly wasmgraph_eulerianPath: (a: number) => [number, number, number, number];
|
|
512
|
+
readonly wasmgraph_evenTarjanReduction: (a: number) => [number, number, number, number];
|
|
513
|
+
readonly wasmgraph_expandPathToPairs: (a: number, b: number) => [number, number, number, number];
|
|
514
|
+
readonly wasmgraph_extendedChordalRing: (a: number, b: number, c: number, d: number, e: number) => [number, number, number];
|
|
515
|
+
readonly wasmgraph_famous: (a: number, b: number) => [number, number, number];
|
|
516
|
+
readonly wasmgraph_famousNames: () => [number, number];
|
|
517
|
+
readonly wasmgraph_fastGreedy: (a: number) => [number, number, number, number];
|
|
518
|
+
readonly wasmgraph_feedbackArcSet: (a: number, b: number, c: number) => [number, number, number, number];
|
|
519
|
+
readonly wasmgraph_feedbackVertexSet: (a: number) => [number, number, number, number];
|
|
520
|
+
readonly wasmgraph_findCycle: (a: number) => [number, number, number, number];
|
|
521
|
+
readonly wasmgraph_floydWarshallDistances: (a: number) => [number, number, number, number];
|
|
522
|
+
readonly wasmgraph_fluidCommunities: (a: number, b: number) => [number, number, number, number];
|
|
523
|
+
readonly wasmgraph_forestFireGame: (a: number, b: number, c: number, d: number, e: number) => [number, number, number];
|
|
524
|
+
readonly wasmgraph_fromEdges: (a: number, b: number, c: number) => [number, number, number];
|
|
525
|
+
readonly wasmgraph_fromPrufer: (a: number, b: number) => [number, number, number];
|
|
526
|
+
readonly wasmgraph_fullBipartite: (a: number, b: number, c: number, d: number, e: number) => [number, number, number];
|
|
527
|
+
readonly wasmgraph_fullCitation: (a: number, b: number) => [number, number, number];
|
|
528
|
+
readonly wasmgraph_fullGraph: (a: number) => [number, number, number];
|
|
529
|
+
readonly wasmgraph_fundamentalCycles: (a: number) => [number, number, number, number];
|
|
530
|
+
readonly wasmgraph_gabrielGraph: (a: number, b: number, c: number) => [number, number, number];
|
|
531
|
+
readonly wasmgraph_generalizedPetersen: (a: number, b: number) => [number, number, number];
|
|
532
|
+
readonly wasmgraph_getAdjacency: (a: number, b: number, c: number) => [number, number, number, number];
|
|
533
|
+
readonly wasmgraph_getEdgelist: (a: number) => [number, number, number, number];
|
|
534
|
+
readonly wasmgraph_getEdges: (a: number) => [number, number];
|
|
535
|
+
readonly wasmgraph_getLaplacian: (a: number, b: number, c: number) => [number, number, number, number];
|
|
536
|
+
readonly wasmgraph_getShortestPath: (a: number, b: number, c: number, d: number, e: number) => [number, number, number, number];
|
|
537
|
+
readonly wasmgraph_getStochastic: (a: number, b: number) => [number, number, number, number];
|
|
538
|
+
readonly wasmgraph_girth: (a: number) => [number, number, number, number];
|
|
539
|
+
readonly wasmgraph_globalEfficiency: (a: number) => [number, number, number, number];
|
|
540
|
+
readonly wasmgraph_gomoryHuTree: (a: number) => [number, number, number, number];
|
|
541
|
+
readonly wasmgraph_graphCenter: (a: number) => [number, number, number, number];
|
|
542
|
+
readonly wasmgraph_graphJoin: (a: number, b: number) => [number, number, number];
|
|
543
|
+
readonly wasmgraph_graphPower: (a: number, b: number) => [number, number, number];
|
|
544
|
+
readonly wasmgraph_graphProperties: (a: number) => [number, number, number, number];
|
|
545
|
+
readonly wasmgraph_graphStats: (a: number) => [number, number, number, number];
|
|
546
|
+
readonly wasmgraph_grgGame: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
547
|
+
readonly wasmgraph_grgGameWithCoords: (a: number, b: number, c: number, d: number) => [number, number, number, number];
|
|
548
|
+
readonly wasmgraph_growingRandomGame: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
549
|
+
readonly wasmgraph_hammingGraph: (a: number, b: number, c: number) => [number, number, number];
|
|
550
|
+
readonly wasmgraph_harmonicCentrality: (a: number) => [number, number, number, number];
|
|
551
|
+
readonly wasmgraph_harmonicCentralityCutoff: (a: number, b: number, c: number) => [number, number, number, number];
|
|
552
|
+
readonly wasmgraph_harmonicCentralityWeighted: (a: number, b: number, c: number) => [number, number, number, number];
|
|
553
|
+
readonly wasmgraph_hasMutual: (a: number, b: number) => [number, number, number];
|
|
554
|
+
readonly wasmgraph_hexagonalLattice: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
555
|
+
readonly wasmgraph_hrgConsensus: (a: number, b: bigint, c: bigint) => [number, number, number, number];
|
|
556
|
+
readonly wasmgraph_hrgCreate: (a: number, b: number, c: number) => [number, number, number, number];
|
|
557
|
+
readonly wasmgraph_hrgFit: (a: number, b: bigint, c: bigint) => [number, number, number, number];
|
|
558
|
+
readonly wasmgraph_hrgGame: (a: number, b: bigint, c: bigint) => [number, number, number, number];
|
|
559
|
+
readonly wasmgraph_hrgPredict: (a: number, b: bigint, c: bigint) => [number, number, number, number];
|
|
560
|
+
readonly wasmgraph_hrgSample: (a: number, b: bigint, c: bigint) => [number, number, number, number];
|
|
561
|
+
readonly wasmgraph_hsbmGame: (a: number, b: number, c: number, d: number, e: number, f: number, g: number, h: number) => [number, number, number];
|
|
562
|
+
readonly wasmgraph_hsbmListGame: (a: number, b: number, c: number, d: number, e: number) => [number, number, number];
|
|
563
|
+
readonly wasmgraph_hubAndAuthorityScores: (a: number) => [number, number, number, number];
|
|
564
|
+
readonly wasmgraph_hypercube: (a: number, b: number) => [number, number, number];
|
|
565
|
+
readonly wasmgraph_independenceNumber: (a: number) => [number, number, number, number];
|
|
566
|
+
readonly wasmgraph_inducedSubgraph: (a: number, b: number, c: number) => [number, number, number, number];
|
|
567
|
+
readonly wasmgraph_infomap: (a: number) => [number, number, number, number];
|
|
568
|
+
readonly wasmgraph_intersection: (a: number, b: number) => [number, number, number];
|
|
569
|
+
readonly wasmgraph_intersectionMany: (a: number, b: number) => [number, number, number];
|
|
570
|
+
readonly wasmgraph_invertPermutation: (a: number, b: number) => [number, number, number, number];
|
|
571
|
+
readonly wasmgraph_isAcyclic: (a: number) => [number, number, number, number];
|
|
572
|
+
readonly wasmgraph_isApexForest: (a: number) => [number, number, number];
|
|
573
|
+
readonly wasmgraph_isApexTree: (a: number) => [number, number, number];
|
|
574
|
+
readonly wasmgraph_isBannerFree: (a: number) => [number, number, number];
|
|
575
|
+
readonly wasmgraph_isBiconnected: (a: number) => [number, number, number, number];
|
|
576
|
+
readonly wasmgraph_isBipartite: (a: number) => [number, number, number, number];
|
|
577
|
+
readonly wasmgraph_isBipartiteDetailed: (a: number) => [number, number, number, number];
|
|
578
|
+
readonly wasmgraph_isBiregular: (a: number) => [number, number, number];
|
|
579
|
+
readonly wasmgraph_isBlockGraph: (a: number) => [number, number, number];
|
|
580
|
+
readonly wasmgraph_isBowtieFree: (a: number) => [number, number, number];
|
|
581
|
+
readonly wasmgraph_isBullFree: (a: number) => [number, number, number];
|
|
582
|
+
readonly wasmgraph_isC4Free: (a: number) => [number, number, number];
|
|
583
|
+
readonly wasmgraph_isC5Free: (a: number) => [number, number, number];
|
|
584
|
+
readonly wasmgraph_isCactusGraph: (a: number) => [number, number, number];
|
|
585
|
+
readonly wasmgraph_isCaterpillar: (a: number) => [number, number, number];
|
|
586
|
+
readonly wasmgraph_isChainGraph: (a: number) => [number, number, number];
|
|
587
|
+
readonly wasmgraph_isChordalBipartite: (a: number) => [number, number, number];
|
|
588
|
+
readonly wasmgraph_isClawFree: (a: number) => [number, number, number];
|
|
589
|
+
readonly wasmgraph_isClique: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
590
|
+
readonly wasmgraph_isClusterGraph: (a: number) => [number, number, number];
|
|
591
|
+
readonly wasmgraph_isCoBipartite: (a: number) => [number, number, number];
|
|
592
|
+
readonly wasmgraph_isCoChordal: (a: number) => [number, number, number];
|
|
593
|
+
readonly wasmgraph_isCograph: (a: number) => [number, number, number];
|
|
594
|
+
readonly wasmgraph_isComplete: (a: number) => [number, number, number, number];
|
|
595
|
+
readonly wasmgraph_isCompleteBipartite: (a: number) => [number, number, number];
|
|
596
|
+
readonly wasmgraph_isCompleteMultipartite: (a: number) => [number, number, number];
|
|
597
|
+
readonly wasmgraph_isConnected: (a: number, b: number, c: number) => [number, number, number];
|
|
598
|
+
readonly wasmgraph_isCricketFree: (a: number) => [number, number, number];
|
|
599
|
+
readonly wasmgraph_isCubic: (a: number) => [number, number, number, number];
|
|
600
|
+
readonly wasmgraph_isCycle: (a: number) => [number, number, number, number];
|
|
601
|
+
readonly wasmgraph_isDag: (a: number) => [number, number, number, number];
|
|
602
|
+
readonly wasmgraph_isDartFree: (a: number) => [number, number, number];
|
|
603
|
+
readonly wasmgraph_isDiamondFree: (a: number) => [number, number, number];
|
|
604
|
+
readonly wasmgraph_isDirected: (a: number) => number;
|
|
605
|
+
readonly wasmgraph_isDistanceHereditary: (a: number) => [number, number, number];
|
|
606
|
+
readonly wasmgraph_isDominatingSet: (a: number, b: number, c: number) => number;
|
|
607
|
+
readonly wasmgraph_isEdgeCover: (a: number, b: number, c: number) => number;
|
|
608
|
+
readonly wasmgraph_isEulerian: (a: number) => [number, number, number, number];
|
|
609
|
+
readonly wasmgraph_isForest: (a: number) => [number, number, number, number];
|
|
610
|
+
readonly wasmgraph_isForkFree: (a: number) => [number, number, number];
|
|
611
|
+
readonly wasmgraph_isGemFree: (a: number) => [number, number, number];
|
|
612
|
+
readonly wasmgraph_isGeodetic: (a: number) => [number, number, number];
|
|
613
|
+
readonly wasmgraph_isHouseFree: (a: number) => [number, number, number];
|
|
614
|
+
readonly wasmgraph_isIndependentVertexSet: (a: number, b: number, c: number) => [number, number, number];
|
|
615
|
+
readonly wasmgraph_isKDegenerate: (a: number, b: number) => [number, number, number];
|
|
616
|
+
readonly wasmgraph_isLobster: (a: number) => [number, number, number];
|
|
617
|
+
readonly wasmgraph_isMutual: (a: number, b: number) => [number, number, number, number];
|
|
618
|
+
readonly wasmgraph_isNetFree: (a: number) => [number, number, number];
|
|
619
|
+
readonly wasmgraph_isOuterplanar: (a: number) => [number, number, number, number];
|
|
620
|
+
readonly wasmgraph_isP5Free: (a: number) => [number, number, number];
|
|
621
|
+
readonly wasmgraph_isPath: (a: number) => [number, number, number, number];
|
|
622
|
+
readonly wasmgraph_isPawFree: (a: number) => [number, number, number];
|
|
623
|
+
readonly wasmgraph_isPerfect: (a: number) => [number, number, number, number];
|
|
624
|
+
readonly wasmgraph_isPlanar: (a: number) => [number, number, number, number];
|
|
625
|
+
readonly wasmgraph_isProperInterval: (a: number) => [number, number, number];
|
|
626
|
+
readonly wasmgraph_isPseudoForest: (a: number) => [number, number, number];
|
|
627
|
+
readonly wasmgraph_isPtolemaic: (a: number) => [number, number, number];
|
|
628
|
+
readonly wasmgraph_isRegular: (a: number) => [number, number, number, number];
|
|
629
|
+
readonly wasmgraph_isSameGraph: (a: number, b: number) => number;
|
|
630
|
+
readonly wasmgraph_isSelfComplementary: (a: number) => [number, number, number];
|
|
631
|
+
readonly wasmgraph_isSemicomplete: (a: number) => [number, number, number];
|
|
632
|
+
readonly wasmgraph_isSeriesParallel: (a: number) => [number, number, number];
|
|
633
|
+
readonly wasmgraph_isSimple: (a: number) => [number, number, number, number];
|
|
634
|
+
readonly wasmgraph_isSimpleWithMode: (a: number, b: number, c: number) => [number, number, number];
|
|
635
|
+
readonly wasmgraph_isSpider: (a: number) => [number, number, number];
|
|
636
|
+
readonly wasmgraph_isSplitGraph: (a: number) => [number, number, number];
|
|
637
|
+
readonly wasmgraph_isStar: (a: number) => [number, number, number, number];
|
|
638
|
+
readonly wasmgraph_isStronglyChordal: (a: number) => [number, number, number];
|
|
639
|
+
readonly wasmgraph_isThresholdGraph: (a: number) => [number, number, number];
|
|
640
|
+
readonly wasmgraph_isTournament: (a: number) => [number, number, number, number];
|
|
641
|
+
readonly wasmgraph_isTree: (a: number) => [number, number, number, number];
|
|
642
|
+
readonly wasmgraph_isTriangleFree: (a: number) => [number, number, number, number];
|
|
643
|
+
readonly wasmgraph_isUnicyclic: (a: number) => [number, number, number];
|
|
644
|
+
readonly wasmgraph_isVertexCover: (a: number, b: number, c: number) => number;
|
|
645
|
+
readonly wasmgraph_isWeaklyChordal: (a: number) => [number, number, number];
|
|
646
|
+
readonly wasmgraph_isWellCovered: (a: number) => [number, number, number];
|
|
647
|
+
readonly wasmgraph_isWheel: (a: number) => [number, number, number, number];
|
|
648
|
+
readonly wasmgraph_isWindmill: (a: number) => [number, number, number];
|
|
649
|
+
readonly wasmgraph_isomorphic: (a: number, b: number) => [number, number, number];
|
|
650
|
+
readonly wasmgraph_isomorphicBliss: (a: number, b: number) => [number, number, number, number];
|
|
651
|
+
readonly wasmgraph_johnsonDistances: (a: number, b: number, c: number) => [number, number, number, number];
|
|
652
|
+
readonly wasmgraph_jointDegreeDistribution: (a: number, b: number) => [number, number, number, number];
|
|
653
|
+
readonly wasmgraph_kRegularGame: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
654
|
+
readonly wasmgraph_kShortestPaths: (a: number, b: number, c: number, d: number) => [number, number, number, number];
|
|
655
|
+
readonly wasmgraph_karyTree: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
656
|
+
readonly wasmgraph_katzCentrality: (a: number) => [number, number, number, number];
|
|
657
|
+
readonly wasmgraph_kautzGraph: (a: number, b: number) => [number, number, number];
|
|
658
|
+
readonly wasmgraph_labelPropagation: (a: number) => [number, number, number, number];
|
|
659
|
+
readonly wasmgraph_layoutBipartite: (a: number, b: number, c: number) => [number, number, number, number];
|
|
660
|
+
readonly wasmgraph_layoutCircle: (a: number) => [number, number, number, number];
|
|
661
|
+
readonly wasmgraph_layoutDavidsonHarel: (a: number) => [number, number, number, number];
|
|
662
|
+
readonly wasmgraph_layoutDrl: (a: number) => [number, number, number, number];
|
|
663
|
+
readonly wasmgraph_layoutDrl3d: (a: number) => [number, number, number, number];
|
|
664
|
+
readonly wasmgraph_layoutFr: (a: number, b: number) => [number, number, number, number];
|
|
665
|
+
readonly wasmgraph_layoutGem: (a: number) => [number, number, number, number];
|
|
666
|
+
readonly wasmgraph_layoutGraphopt: (a: number) => [number, number, number, number];
|
|
667
|
+
readonly wasmgraph_layoutGrid: (a: number, b: number) => [number, number, number, number];
|
|
668
|
+
readonly wasmgraph_layoutKamadaKawai: (a: number) => [number, number, number, number];
|
|
669
|
+
readonly wasmgraph_layoutLgl: (a: number) => [number, number, number, number];
|
|
670
|
+
readonly wasmgraph_layoutMds: (a: number) => [number, number, number, number];
|
|
671
|
+
readonly wasmgraph_layoutRandom: (a: number, b: bigint) => [number, number, number, number];
|
|
672
|
+
readonly wasmgraph_layoutReingoldTilford: (a: number, b: number) => [number, number, number, number];
|
|
673
|
+
readonly wasmgraph_layoutStar: (a: number, b: number) => [number, number, number, number];
|
|
674
|
+
readonly wasmgraph_layoutSugiyama: (a: number) => [number, number, number, number];
|
|
675
|
+
readonly wasmgraph_lcfGraph: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
676
|
+
readonly wasmgraph_leadingEigenvector: (a: number) => [number, number, number, number];
|
|
677
|
+
readonly wasmgraph_leiden: (a: number) => [number, number, number, number];
|
|
678
|
+
readonly wasmgraph_lineGraph: (a: number) => [number, number, number];
|
|
679
|
+
readonly wasmgraph_linegraph: (a: number) => [number, number, number];
|
|
680
|
+
readonly wasmgraph_listTriangles: (a: number) => [number, number, number, number];
|
|
681
|
+
readonly wasmgraph_localEfficiency: (a: number) => [number, number, number, number];
|
|
682
|
+
readonly wasmgraph_louvain: (a: number) => [number, number, number, number];
|
|
683
|
+
readonly wasmgraph_maxDegree: (a: number, b: number, c: number) => [number, number, number, number];
|
|
684
|
+
readonly wasmgraph_maxFlow: (a: number, b: number, c: number) => [number, number, number, number];
|
|
685
|
+
readonly wasmgraph_maxFlowDetailed: (a: number, b: number, c: number) => [number, number, number, number];
|
|
686
|
+
readonly wasmgraph_maxFlowValue: (a: number, b: number, c: number) => [number, number, number];
|
|
687
|
+
readonly wasmgraph_maximalCliques: (a: number) => [number, number, number, number];
|
|
688
|
+
readonly wasmgraph_maximumCut: (a: number) => [number, number, number, number];
|
|
689
|
+
readonly wasmgraph_maximumIndependentSet: (a: number) => [number, number, number, number];
|
|
690
|
+
readonly wasmgraph_meanDegree: (a: number) => [number, number, number, number];
|
|
691
|
+
readonly wasmgraph_meanDistance: (a: number) => [number, number, number, number];
|
|
692
|
+
readonly wasmgraph_meanDistanceWeighted: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
693
|
+
readonly wasmgraph_minDegree: (a: number, b: number, c: number) => [number, number, number, number];
|
|
694
|
+
readonly wasmgraph_mincut: (a: number) => [number, number, number, number];
|
|
695
|
+
readonly wasmgraph_mincutValue: (a: number) => [number, number, number, number];
|
|
696
|
+
readonly wasmgraph_minimumCycleBasis: (a: number) => [number, number, number, number];
|
|
697
|
+
readonly wasmgraph_minimumDominatingSet: (a: number) => [number, number, number, number];
|
|
698
|
+
readonly wasmgraph_minimumEdgeCover: (a: number) => [number, number, number, number];
|
|
699
|
+
readonly wasmgraph_minimumSpanningTree: (a: number, b: number, c: number) => [number, number, number, number];
|
|
700
|
+
readonly wasmgraph_minimumVertexCover: (a: number) => [number, number, number, number];
|
|
701
|
+
readonly wasmgraph_modularity: (a: number, b: number, c: number) => [number, number, number, number];
|
|
702
|
+
readonly wasmgraph_modularityMatrix: (a: number) => [number, number, number, number];
|
|
703
|
+
readonly wasmgraph_mycielskiGraph: (a: number) => [number, number, number];
|
|
704
|
+
readonly wasmgraph_mycielskian: (a: number, b: number) => [number, number, number];
|
|
705
|
+
readonly wasmgraph_nearestNeighborGraph: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
706
|
+
readonly wasmgraph_neighborhood: (a: number, b: number) => [number, number, number, number];
|
|
707
|
+
readonly wasmgraph_new: (a: number) => [number, number, number];
|
|
708
|
+
readonly wasmgraph_pagerank: (a: number) => [number, number, number, number];
|
|
709
|
+
readonly wasmgraph_pagerankWeighted: (a: number, b: number, c: number) => [number, number, number, number];
|
|
710
|
+
readonly wasmgraph_pathGraph: (a: number, b: number) => [number, number, number];
|
|
711
|
+
readonly wasmgraph_pathLengthHist: (a: number, b: number) => [number, number, number, number];
|
|
712
|
+
readonly wasmgraph_permuteVertices: (a: number, b: number, c: number) => [number, number, number, number];
|
|
713
|
+
readonly wasmgraph_personalizedPagerank: (a: number, b: number, c: number, d: number) => [number, number, number, number];
|
|
714
|
+
readonly wasmgraph_powerLawFit: (a: number, b: number, c: number) => [number, number, number, number];
|
|
715
|
+
readonly wasmgraph_preferenceGame: (a: number, b: number, c: number, d: number, e: number, f: number, g: number) => [number, number, number, number];
|
|
716
|
+
readonly wasmgraph_radius: (a: number) => [number, number, number, number];
|
|
717
|
+
readonly wasmgraph_randomSpanningTree: (a: number, b: bigint) => [number, number, number, number];
|
|
718
|
+
readonly wasmgraph_randomWalk: (a: number, b: number, c: number, d: bigint) => [number, number, number, number];
|
|
719
|
+
readonly wasmgraph_reachabilityMatrix: (a: number) => [number, number, number, number];
|
|
720
|
+
readonly wasmgraph_readDl: (a: number, b: number, c: number) => [number, number, number];
|
|
721
|
+
readonly wasmgraph_readDot: (a: number, b: number) => [number, number, number];
|
|
722
|
+
readonly wasmgraph_readEdgelist: (a: number, b: number) => [number, number, number];
|
|
723
|
+
readonly wasmgraph_readGml: (a: number, b: number) => [number, number, number];
|
|
724
|
+
readonly wasmgraph_readGraphml: (a: number, b: number) => [number, number, number];
|
|
725
|
+
readonly wasmgraph_readLeda: (a: number, b: number) => [number, number, number];
|
|
726
|
+
readonly wasmgraph_readLgl: (a: number, b: number) => [number, number, number];
|
|
727
|
+
readonly wasmgraph_readNcol: (a: number, b: number) => [number, number, number];
|
|
728
|
+
readonly wasmgraph_readPajek: (a: number, b: number) => [number, number, number];
|
|
729
|
+
readonly wasmgraph_realizeDirectedDegreeSequence: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
730
|
+
readonly wasmgraph_recentDegreeGame: (a: number, b: number, c: number, d: number, e: number, f: number) => [number, number, number];
|
|
731
|
+
readonly wasmgraph_reciprocity: (a: number) => [number, number, number, number];
|
|
732
|
+
readonly wasmgraph_regularTree: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
733
|
+
readonly wasmgraph_regularity: (a: number) => [number, number, number, number];
|
|
734
|
+
readonly wasmgraph_relativeNeighborhoodGraph: (a: number, b: number, c: number) => [number, number, number];
|
|
735
|
+
readonly wasmgraph_reverse: (a: number) => [number, number, number];
|
|
736
|
+
readonly wasmgraph_reverseEdges: (a: number, b: number, c: number) => [number, number, number];
|
|
737
|
+
readonly wasmgraph_reverseGraph: (a: number) => [number, number, number, number];
|
|
738
|
+
readonly wasmgraph_rewire: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
739
|
+
readonly wasmgraph_richClubSequence: (a: number) => [number, number, number, number];
|
|
740
|
+
readonly wasmgraph_ringGraph: (a: number, b: number) => [number, number, number];
|
|
741
|
+
readonly wasmgraph_runningMean: (a: number, b: number, c: number) => [number, number, number, number];
|
|
742
|
+
readonly wasmgraph_satisfiesDirac: (a: number) => [number, number, number];
|
|
743
|
+
readonly wasmgraph_satisfiesOre: (a: number) => [number, number, number];
|
|
744
|
+
readonly wasmgraph_sbmGame: (a: number, b: number, c: number, d: number, e: number, f: number, g: number) => [number, number, number];
|
|
745
|
+
readonly wasmgraph_shortestPath: (a: number, b: number, c: number) => [number, number, number, number];
|
|
746
|
+
readonly wasmgraph_similarityDice: (a: number) => [number, number, number, number];
|
|
747
|
+
readonly wasmgraph_similarityJaccard: (a: number) => [number, number, number, number];
|
|
748
|
+
readonly wasmgraph_simpleCycles: (a: number, b: number, c: number, d: number, e: number, f: number) => [number, number, number, number];
|
|
749
|
+
readonly wasmgraph_simpleInterconnectedIslandsGame: (a: number, b: number, c: number, d: number, e: number) => [number, number, number];
|
|
750
|
+
readonly wasmgraph_simplify: (a: number) => [number, number, number];
|
|
751
|
+
readonly wasmgraph_sir: (a: number, b: number, c: number, d: number, e: number) => [number, number, number, number];
|
|
752
|
+
readonly wasmgraph_solveLsap: (a: number, b: number, c: number) => [number, number, number, number];
|
|
753
|
+
readonly wasmgraph_sortVerticesByDegree: (a: number, b: number, c: number, d: number) => [number, number, number, number];
|
|
754
|
+
readonly wasmgraph_spanner: (a: number, b: number) => [number, number, number, number];
|
|
755
|
+
readonly wasmgraph_spatialEdgeLengths: (a: number, b: number, c: number, d: number) => [number, number, number, number];
|
|
756
|
+
readonly wasmgraph_spinglass: (a: number) => [number, number, number, number];
|
|
757
|
+
readonly wasmgraph_squareLattice: (a: number, b: number, c: number, d: number, e: number) => [number, number, number];
|
|
758
|
+
readonly wasmgraph_stEdgeConnectivity: (a: number, b: number, c: number) => [bigint, number, number];
|
|
759
|
+
readonly wasmgraph_stMincut: (a: number, b: number, c: number) => [number, number, number, number];
|
|
760
|
+
readonly wasmgraph_stMincutValue: (a: number, b: number, c: number) => [number, number, number];
|
|
761
|
+
readonly wasmgraph_stVertexConnectivity: (a: number, b: number, c: number) => [number, number, number, number];
|
|
762
|
+
readonly wasmgraph_starGraph: (a: number) => [number, number, number];
|
|
763
|
+
readonly wasmgraph_staticFitnessGame: (a: number, b: number, c: number, d: number, e: number, f: number) => [number, number, number];
|
|
764
|
+
readonly wasmgraph_staticPowerLawGame: (a: number, b: number, c: number, d: number, e: number, f: number) => [number, number, number];
|
|
765
|
+
readonly wasmgraph_strength: (a: number, b: number, c: number) => [number, number, number, number];
|
|
766
|
+
readonly wasmgraph_stronglyConnectedComponents: (a: number) => [number, number, number, number];
|
|
767
|
+
readonly wasmgraph_subcomponent: (a: number, b: number, c: number, d: number) => [number, number, number, number];
|
|
768
|
+
readonly wasmgraph_subisomorphic: (a: number, b: number) => [number, number, number];
|
|
769
|
+
readonly wasmgraph_symmetricTree: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
770
|
+
readonly wasmgraph_toDirected: (a: number, b: number, c: number) => [number, number, number, number];
|
|
771
|
+
readonly wasmgraph_toPrufer: (a: number) => [number, number, number, number];
|
|
772
|
+
readonly wasmgraph_toUndirected: (a: number, b: number, c: number) => [number, number, number, number];
|
|
773
|
+
readonly wasmgraph_topologicalSort: (a: number) => [number, number, number, number];
|
|
774
|
+
readonly wasmgraph_topologicalSorting: (a: number, b: number, c: number) => [number, number, number, number];
|
|
775
|
+
readonly wasmgraph_transitiveClosure: (a: number) => [number, number, number];
|
|
776
|
+
readonly wasmgraph_transitivity: (a: number) => [number, number, number, number];
|
|
777
|
+
readonly wasmgraph_treeFromParentVector: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
778
|
+
readonly wasmgraph_treeGameLerw: (a: number, b: number, c: number) => [number, number, number];
|
|
779
|
+
readonly wasmgraph_treeGamePrufer: (a: number, b: number) => [number, number, number];
|
|
780
|
+
readonly wasmgraph_triadCensus: (a: number) => [number, number, number, number];
|
|
781
|
+
readonly wasmgraph_triangularLattice: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
782
|
+
readonly wasmgraph_trussness: (a: number) => [number, number, number, number];
|
|
783
|
+
readonly wasmgraph_turanGraph: (a: number, b: number) => [number, number, number];
|
|
784
|
+
readonly wasmgraph_unfoldTree: (a: number, b: number, c: number, d: number, e: number) => [number, number, number, number];
|
|
785
|
+
readonly wasmgraph_union: (a: number, b: number) => [number, number, number];
|
|
786
|
+
readonly wasmgraph_unionMany: (a: number, b: number) => [number, number, number];
|
|
787
|
+
readonly wasmgraph_vcount: (a: number) => number;
|
|
788
|
+
readonly wasmgraph_vertexColoring: (a: number) => [number, number, number, number];
|
|
789
|
+
readonly wasmgraph_vertexConnectivity: (a: number) => [number, number, number, number];
|
|
790
|
+
readonly wasmgraph_vertexDisjointPaths: (a: number, b: number, c: number) => [number, number, number, number];
|
|
791
|
+
readonly wasmgraph_voronoi: (a: number, b: number, c: number, d: number, e: number, f: number, g: number) => [number, number, number, number];
|
|
792
|
+
readonly wasmgraph_walktrap: (a: number) => [number, number, number, number];
|
|
793
|
+
readonly wasmgraph_wattsStrogatz: (a: number, b: number, c: number, d: bigint) => [number, number, number];
|
|
794
|
+
readonly wasmgraph_wattsStrogatzGame: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
795
|
+
readonly wasmgraph_wheelGraph: (a: number, b: number, c: number, d: number) => [number, number, number];
|
|
796
|
+
readonly wasmgraph_writeDl: (a: number) => [number, number, number, number];
|
|
797
|
+
readonly wasmgraph_writeDot: (a: number) => [number, number, number, number];
|
|
798
|
+
readonly wasmgraph_writeEdgelist: (a: number) => [number, number, number, number];
|
|
799
|
+
readonly wasmgraph_writeGml: (a: number) => [number, number, number, number];
|
|
800
|
+
readonly wasmgraph_writeGraphml: (a: number) => [number, number, number, number];
|
|
801
|
+
readonly wasmgraph_writeLeda: (a: number) => [number, number, number, number];
|
|
802
|
+
readonly wasmgraph_writeLgl: (a: number) => [number, number, number, number];
|
|
803
|
+
readonly wasmgraph_writeNcol: (a: number) => [number, number, number, number];
|
|
804
|
+
readonly wasmgraph_writePajek: (a: number) => [number, number, number, number];
|
|
805
|
+
readonly wasmgraph_hypercubeGraph: (a: number, b: number) => [number, number, number];
|
|
806
|
+
readonly wasmgraph_famousGraph: (a: number, b: number) => [number, number, number];
|
|
807
|
+
readonly __wbindgen_externrefs: WebAssembly.Table;
|
|
808
|
+
readonly __externref_table_dealloc: (a: number) => void;
|
|
809
|
+
readonly __wbindgen_free: (a: number, b: number, c: number) => void;
|
|
810
|
+
readonly __wbindgen_malloc: (a: number, b: number) => number;
|
|
811
|
+
readonly __wbindgen_realloc: (a: number, b: number, c: number, d: number) => number;
|
|
812
|
+
readonly __externref_drop_slice: (a: number, b: number) => void;
|
|
813
|
+
readonly __externref_table_alloc: () => number;
|
|
814
|
+
readonly __wbindgen_start: () => void;
|
|
815
|
+
}
|
|
816
|
+
|
|
817
|
+
export type SyncInitInput = BufferSource | WebAssembly.Module;
|
|
818
|
+
|
|
819
|
+
/**
|
|
820
|
+
* Instantiates the given `module`, which can either be bytes or
|
|
821
|
+
* a precompiled `WebAssembly.Module`.
|
|
822
|
+
*
|
|
823
|
+
* @param {{ module: SyncInitInput }} module - Passing `SyncInitInput` directly is deprecated.
|
|
824
|
+
*
|
|
825
|
+
* @returns {InitOutput}
|
|
826
|
+
*/
|
|
827
|
+
export function initSync(module: { module: SyncInitInput } | SyncInitInput): InitOutput;
|
|
828
|
+
|
|
829
|
+
/**
|
|
830
|
+
* If `module_or_path` is {RequestInfo} or {URL}, makes a request and
|
|
831
|
+
* for everything else, calls `WebAssembly.instantiate` directly.
|
|
832
|
+
*
|
|
833
|
+
* @param {{ module_or_path: InitInput | Promise<InitInput> }} module_or_path - Passing `InitInput` directly is deprecated.
|
|
834
|
+
*
|
|
835
|
+
* @returns {Promise<InitOutput>}
|
|
836
|
+
*/
|
|
837
|
+
export default function __wbg_init (module_or_path?: { module_or_path: InitInput | Promise<InitInput> } | InitInput | Promise<InitInput>): Promise<InitOutput>;
|