Index
Modules:
nimnet,
nimnet/algorithms/all_pairs_shortest,
nimnet/algorithms/approximation,
nimnet/algorithms/bipartite,
nimnet/algorithms/bridges,
nimnet/algorithms/centrality,
nimnet/algorithms/chordal,
nimnet/algorithms/clique,
nimnet/algorithms/clustering,
nimnet/algorithms/coloring,
nimnet/algorithms/communicability,
nimnet/algorithms/community,
nimnet/algorithms/components,
nimnet/algorithms/connectivity,
nimnet/algorithms/core,
nimnet/algorithms/cuts,
nimnet/algorithms/cycles,
nimnet/algorithms/d_separation,
nimnet/algorithms/dag,
nimnet/algorithms/distance_measures,
nimnet/algorithms/dominating,
nimnet/algorithms/efficiency,
nimnet/algorithms/ego,
nimnet/algorithms/euler,
nimnet/algorithms/flow,
nimnet/algorithms/graph_hashing,
nimnet/algorithms/graph_products,
nimnet/algorithms/independent_set,
nimnet/algorithms/isolates,
nimnet/algorithms/isomorphism,
nimnet/algorithms/layout,
nimnet/algorithms/lca,
nimnet/algorithms/leiden,
nimnet/algorithms/link_prediction,
nimnet/algorithms/louvain,
nimnet/algorithms/matching,
nimnet/algorithms/min_cost_flow,
nimnet/algorithms/minors,
nimnet/algorithms/misc,
nimnet/algorithms/mst,
nimnet/algorithms/network_flow,
nimnet/algorithms/node_classification,
nimnet/algorithms/parallel,
nimnet/algorithms/planarity,
nimnet/algorithms/polynomials,
nimnet/algorithms/properties,
nimnet/algorithms/richclub,
nimnet/algorithms/shortest_paths,
nimnet/algorithms/similarity,
nimnet/algorithms/simple_paths,
nimnet/algorithms/smallworld,
nimnet/algorithms/spectral,
nimnet/algorithms/stats,
nimnet/algorithms/structural_holes,
nimnet/algorithms/swaps,
nimnet/algorithms/tournament,
nimnet/algorithms/traversal,
nimnet/algorithms/tree_decomposition,
nimnet/algorithms/triads,
nimnet/algorithms/tsp,
nimnet/algorithms/voronoi,
nimnet/algorithms/wiener,
nimnet/builder,
nimnet/compact,
nimnet/convert,
nimnet/datasets,
nimnet/digraph,
nimnet/generators/classic,
nimnet/generators/community,
nimnet/generators/degree_sequence,
nimnet/generators/directed,
nimnet/generators/duplication,
nimnet/generators/expanders,
nimnet/generators/geometric,
nimnet/generators/harary,
nimnet/generators/internet,
nimnet/generators/intersection,
nimnet/generators/joint_degree,
nimnet/generators/lattice,
nimnet/generators/line_graph,
nimnet/generators/misc_generators,
nimnet/generators/mycielski,
nimnet/generators/nonisomorphic_trees,
nimnet/generators/random,
nimnet/generators/small,
nimnet/generators/stochastic,
nimnet/generators/trees,
nimnet/generators/triad_generator,
nimnet/graph,
nimnet/io/adjlist,
nimnet/io/dot,
nimnet/io/edgelist,
nimnet/io/gexf,
nimnet/io/gml,
nimnet/io/graph6,
nimnet/io/graphml,
nimnet/io/json_graph,
nimnet/io/leda,
nimnet/io/multiline_adjlist,
nimnet/io/network_text,
nimnet/io/pajek,
nimnet/io/svg,
nimnet/multigraph,
nimnet/operators,
nimnet/static_graph,
nimnet/types,
nimnet/utils,
nimnet/views.
API symbols
- `$`:
- `+`:
- `-`:
- `<`:
- `==`:
- `[]=`:
- `[]`:
- adamicAdar:
- addCycle:
- addEdge:
- addEdgesFrom:
- addNode:
- addNodesFrom:
- addPath:
- addStar:
- addWeightedEdge:
- addWeightedEdgesFrom:
- adjacency:
- adjacencyData:
- adjacencyGraph:
- adjacencyMatrix:
- adjacencySpectrum:
- adjacencySpectrumAll:
- adjacencyTable:
- algebraicConnectivity:
- allPairsLowestCommonAncestor:
- allSimplePaths:
- allSimplePathsSeq:
- allTopologicalSorts:
- allTriads:
- allTriangles:
- allTriplets:
- AmbiguousSolution:
- ancestors:
- antichains:
- approxAverageClusteringCoefficient:
- approxDiameter:
- approxMaxClique:
- approxNodeConnectivity:
- arfLayout:
- articulationPoints:
- astarPath:
- astarPathLength:
- attractingComponents:
- averageClustering:
- averageDegree:
- averageDegreeConnectivity:
- averageLocalEfficiency:
- averageNeighborDegree:
- averageNodeConnectivity:
- averageShortestPathLength:
- balancedTree:
- barabasiAlbertGraph:
- barbellGraph:
- barycenter:
- bellmanFordDistances:
- bellmanFordPath:
- betheHessianMatrix:
- betheHessianSpectrum:
- betweennessCentrality:
- bfsCSR:
- bfsEdges:
- bfsLayers:
- bfsPredecessors:
- bfsSuccessors:
- bfsTree:
- biconnectedComponentEdges:
- biconnectedComponents:
- binomialTree:
- bipartiteClustering:
- bipartiteLayout:
- bipartiteProjection:
- bipartiteRedundancy:
- bipartiteSets:
- bipartiteWeightedProjection:
- bookGraph:
- boruvkaMST:
- boundaryExpansion:
- bridges:
- build:
- bullGraph:
- cartesianProduct:
- caterpillarTree:
- cavemanGraph:
- center:
- chainDecomposition:
- chordalCycleGraph:
- chordalGraphCliques:
- chromaticNumber:
- chromaticPolynomial:
- chvatalGraph:
- circulantGraph:
- circularLadderGraph:
- circularLayout:
- clear:
- clearEdges:
- cliqueNumber:
- closenessCentrality:
- closenessVitality:
- clustering:
- clusteringCoefficient:
- commonNeighbors:
- communicability:
- communicabilityExp:
- CompactDiGraph:
- CompactGraph:
- complement:
- completeBipartiteGraph:
- completeGraph:
- completeMultipartiteGraph:
- completeToChordal:
- compose:
- condensation:
- conductance:
- configurationModel:
- connectedCavemanGraph:
- connectedComponents:
- connectedDoubleEdgeSwap:
- connectedWattsStrogatzGraph:
- constraint:
- contains:
- contractedEdge:
- contractedNodes:
- convertNodeLabelsToIntegers:
- copy:
- coreNumber:
- coronaProduct:
- couldBeIsomorphic:
- coverage:
- createEmptyCopy:
- cubicalGraph:
- cutSize:
- cutSizeWeighted:
- cycleBasis:
- cycleGraph:
- cytoscapeData:
- cytoscapeGraph:
- dagLongestPath:
- dagLongestPathLength:
- davisSouthernWomenGraph:
- davisWomenGraph:
- dedensify:
- defaultSvgOptions:
- degree:
- degreeAssortativity:
- degreeCentrality:
- degreeCSR:
- degreeHistogram:
- degreeMixingMatrix:
- degreePearsonCorrelation:
- degreeSequence:
- degreeSequenceTree:
- density:
- desarguesGraph:
- descendants:
- descendantsAtDistance:
- dfsEdges:
- dfsLabeledEdges:
- dfsPostorderNodes:
- dfsPredecessors:
- dfsPreorderNodes:
- dfsSuccessors:
- dfsTree:
- diameter:
- diamondGraph:
- difference:
- DiGraph:
- DiGraphBuilder:
- DiGraphView:
- dijkstraPath:
- dijkstraPathLength:
- dinitz:
- directedCombinatorialLaplacianMatrix:
- directedConfigurationModel:
- directedHavelHakimiGraph:
- directedLaplacianMatrix:
- directedModularityMatrix:
- disjointUnion:
- dispersion:
- display:
- dodecahedralGraph:
- dolphinsSocialNetwork:
- dominanceFrontiers:
- dominationNumber:
- dorogovtsevGoltsevMendesGraph:
- doubleEdgeSwap:
- dualBarabasiAlbertGraph:
- duplicationDivergenceGraph:
- eccentricity:
- eccentricityMap:
- Edge:
- EdgeAttr:
- edgeBetweennessCentrality:
- edgeBfs:
- edgeBoundary:
- edgeConnectivity:
- edgeDfs:
- edgeDisjointPaths:
- edgeExpansion:
- EdgeNotFound:
- edges:
- edgeSeq:
- edgeSubgraph:
- edgesWithAttr:
- edmondsKarp:
- effectiveSize:
- egoGraph:
- eigenvectorCentrality:
- emptyGraph:
- enumerateAllCliques:
- equitableColor:
- erdosRenyiGraph:
- eulerianCircuit:
- eulerianPath:
- ExceededMaxIterations:
- expectedDegreeGraph:
- extendedBarabasiAlbertGraph:
- fiedlerVector:
- findCliques:
- findCycle:
- findMinimalDSeparator:
- flatten:
- florentineFamiliesGraph:
- florentineFamiliesMarriageGraph:
- flowHierarchy:
- floydWarshall:
- floydWarshallPaths:
- fluidCommunities:
- forceAtlas2Layout:
- freeze:
- friendshipGraph:
- fromAdjacencyMatrix:
- fromDictOfDicts:
- fromDictOfDictsDirected:
- fromDictOfLists:
- fromDictOfListsDirected:
- fromEdgeList:
- fromEdgeListDirected:
- fruchtGraph:
- fullJoin:
- fullRaryTree:
- gaussianRandomPartitionGraph:
- generalizedDegree:
- generalizedPetersenGraph:
- generalRandomIntersectionGraph:
- generateMultilineAdjlist:
- generateNetworkText:
- generateUniqueNode:
- geographicalThresholdGraph:
- geometricSoftConfigurationGraph:
- getAttrFloat:
- getEdgeAttr:
- getNodeAttr:
- getStr:
- getWeight:
- girth:
- girvanNewman:
- globalEfficiency:
- globalReachingCentrality:
- gncGraph:
- gnGraph:
- gnmRandomGraph:
- gnrGraph:
- gomoryHuTree:
- graph:
- Graph:
- GraphBuilder:
- graphEditDistance:
- graphIsomorphismMapping:
- GraphView:
- greedyColor:
- greedyModularityCommunities:
- grid2dGraph:
- gridGraph:
- groups:
- harmonicCentrality:
- harmonicFunction:
- HasACycle:
- hasBridges:
- hasCycle:
- hasEdge:
- hasEulerianPath:
- hasKey:
- hasNegativeCycle:
- hasNode:
- hasPath:
- hasSelfLoop:
- havelHakimiGraph:
- heawoodGraph:
- hexagonalLatticeGraph:
- hits:
- hknHararyGraph:
- hnmHararyGraph:
- hoffmanSingletonGraph:
- houseGraph:
- houseXGraph:
- hypercubeGraph:
- hyperWienerIndex:
- icosahedralGraph:
- immediateDominators:
- incidenceMatrix:
- inDegree:
- inDegreeCentrality:
- inDegreeIter:
- IndexedGraph:
- info:
- initDiGraphBuilder:
- initGraphBuilder:
- intersection:
- intervalGraph:
- inverseLineGraph:
- isAperiodic:
- isArborescence:
- isAttractingComponent:
- isBiconnected:
- isBipartite:
- isBranching:
- isChordal:
- isComplete:
- isConnected:
- isDAG:
- isDigraphical:
- isDirected:
- isDirectedAcyclicGraph:
- isDistanceRegular:
- isDominatingSet:
- isDSeparator:
- isEdgeCover:
- isEmpty:
- isEulerian:
- isEulerianDirected:
- isForest:
- isFrozen:
- isGraphical:
- isHamiltonian:
- isIndependentSet:
- isIsolate:
- isIsomorphic:
- isKRegular:
- isMatching:
- isMaximalMatching:
- isMinimalDSeparator:
- isMultigraph:
- isMultigraphical:
- isNegativelyWeighted:
- isolates:
- isPartition:
- isPath:
- isPerfectMatching:
- isPlanar:
- isProperColoring:
- isPseudographical:
- isRegular:
- isSemiconnected:
- isSemiEulerian:
- isSimplePath:
- isStronglyConnected:
- isStronglyRegular:
- isThresholdGraph:
- isTournament:
- isTournamentReachable:
- isTree:
- isTriad:
- isValidJointDegree:
- isWeaklyConnected:
- isWeighted:
- items:
- jaccardCoefficient:
- johnsons:
- jointDegreeGraph:
- kamadaKawaiLayout:
- karateClubGraph:
- katzCentrality:
- kCore:
- kCorona:
- kCrust:
- kernighanLinBisection:
- kneserGraph:
- krackardtKiteGraph:
- kRandomIntersectionGraph:
- kruskalMST:
- kruskalMSTWeight:
- kShell:
- kTruss:
- labelPropagationCommunities:
- ladderGraph:
- laplacianCentrality:
- laplacianMatrix:
- laplacianSpectrum:
- laplacianSpectrumAll:
- latticeReference:
- Layout:
- lcfGraph:
- leidenCommunities:
- len:
- lessMiserablesGraph:
- lexicographicalTopologicalSort:
- lexicographicProduct:
- lfrBenchmarkGraph:
- lineGraph:
- loadCentrality:
- loadFromEdgeListFile:
- loadFromEdgeListString:
- loadMatrixMarket:
- loadSNAP:
- loadSNAPDigraph:
- localAndGlobalConsistency:
- localBridges:
- localConstraint:
- localEfficiency:
- localReachingCentrality:
- lollipopGraph:
- louvainCommunities:
- lowestCommonAncestor:
- makeMaxCliqueGraph:
- margulisGabberGalilGraph:
- maxClique:
- maxCut:
- maximalMatching:
- maximumFlowValue:
- maximumIndependentSet:
- maximumMatching:
- maximumSpanningTree:
- maximumSpanningTreeWeight:
- maxWeightClique:
- maxWeightMatching:
- minEdgeCover:
- minimumCostFlow:
- minimumCut:
- minimumCycleBasis:
- minimumDominatingSet:
- minimumEdgeCut:
- minimumNodeCut:
- minimumVertexCover:
- minWeightMatching:
- mixingExpansion:
- modularity:
- modularityMatrix:
- modularitySpectrum:
- modularProduct:
- moebiusKantorGraph:
- moralGraph:
- MultiDiGraph:
- MultiGraph:
- multipartiteLayout:
- mycielskian:
- mycielskiGraph:
- navigableSmallWorldGraph:
- neighbors:
- neighborsCSR:
- newDiGraph:
- newEdgeAttr:
- newGraph:
- newmanWattsStrogatzGraph:
- newMultiDiGraph:
- newMultiGraph:
- newNodeAttr:
- NimNetAlgorithmError:
- NimNetError:
- NimNetNoCycle:
- NimNetNoPath:
- NimNetNotImplemented:
- NimNetPointlessConcept:
- NimNetUnbounded:
- NimNetUnfeasible:
- Nodeable:
- NodeAttr:
- nodeBoundary:
- nodeCliqueNumber:
- nodeConnectedComponent:
- nodeConnectivity:
- nodeDisjointPaths:
- NodeNotFound:
- nodes:
- nodeSeq:
- nodesWithAttr:
- nonEdges:
- nonisomorphicTrees:
- nonNodes:
- nonRandomness:
- normalizedCutSize:
- normalizedLaplacian:
- normalizedLaplacianSpectrum:
- nullGraph:
- numberOfAttractingComponents:
- numberOfCliques:
- numberOfConnectedComponents:
- numberOfEdges:
- numberOfIsolates:
- numberOfNodes:
- numberOfNonisomorphicTrees:
- numberOfSelfLoops:
- numberOfStronglyConnectedComponents:
- numberOfWalks:
- octahedralGraph:
- omega:
- onionLayers:
- order:
- outDegree:
- outDegreeCentrality:
- outDegreeIter:
- overallReciprocity:
- pageRank:
- pairs:
- pairwise:
- pairwiseIter:
- paleyGraph:
- pappusGraph:
- parallelBetweennessCentrality:
- parallelClosenessCentrality:
- parallelClustering:
- parallelJohnsons:
- parallelPageRank:
- parseLeda:
- parseMultilineAdjlist:
- partialDuplicationGraph:
- pathGraph:
- pathWeight:
- percolationCentrality:
- perfectEliminationOrder:
- performance:
- periphery:
- petersenGraph:
- planarLayout:
- plantedPartitionGraph:
- Position:
- power:
- PowerIterationFailedConvergence:
- powerLawClusterGraph:
- predecessors:
- predictedEdges:
- preferentialAttachment:
- prefixTree:
- primMST:
- quotientGraph:
- radius:
- ramseyR2:
- randomCograph:
- randomDegreeSequenceGraph:
- randomGeometricGraph:
- randomInternetAsGraph:
- randomKOutGraph:
- randomLabeledRootedTree:
- randomLabeledTree:
- randomLayout:
- randomLobster:
- randomPartitionGraph:
- randomPowerlawTree:
- randomReference:
- randomRegularGraph:
- randomShellGraph:
- randomTournament:
- randomTree:
- randomTriad:
- readAdjlist:
- readEdgelist:
- readGexf:
- readGexfDirected:
- readGml:
- readGraph6:
- readGraphml:
- readJsonGraph:
- readLeda:
- readMultilineAdjlist:
- readPajek:
- readPajekDigraph:
- readSparse6:
- reciprocity:
- relabelNodes:
- relaxedCavemanGraph:
- removeEdge:
- removeNode:
- removeSelfLoops:
- resourceAllocationIndex:
- reverse:
- reverseCuthillMckeeOrdering:
- richClubCoefficient:
- ringOfCliques:
- rootedProduct:
- scaleFreeGraph:
- scoreSequence:
- secondOrderCentrality:
- sedgewickMazeGraph:
- selfLoopEdges:
- selfLoopNodes:
- setEdgeAttr:
- setNodeAttr:
- shellLayout:
- shortestPath:
- shortestPathLength:
- shortestSimplePaths:
- sigma:
- simpleCyclesDirected:
- simrankSimilarity:
- singleSourceDijkstra:
- singleSourceShortestPathLength:
- size:
- sMetric:
- softRandomGeometricGraph:
- spanner:
- spectralBisection:
- spectralLayout:
- spectralOrdering:
- spiralLayout:
- springLayout:
- squareClustering:
- starGraph:
- starTree:
- staticDiGraph:
- staticGraph:
- staticWeightedGraph:
- steinerTree:
- stochasticBlockModel:
- stochasticGraph:
- stoerWagnerMinCut:
- stronglyConnectedComponents:
- strongProduct:
- subgraph:
- subgraphCentrality:
- SubGraphView:
- subgraphView:
- successors:
- sudokuGraph:
- SvgOptions:
- symmetricDifference:
- tadpoleGraph:
- tensorProduct:
- tetrahedralGraph:
- thresholdedRandomGeometricGraph:
- toAdjacencyMatrix:
- toCompact:
- toDictOfDicts:
- toDictOfLists:
- toDirected:
- toDotString:
- toEdgelist:
- toGraph:
- toIndexed:
- toIndexedDi:
- toJsonNode:
- topologicalGenerations:
- topologicalSort:
- toSvgString:
- toUndirected:
- tournamentHamiltonianPath:
- transitiveClosure:
- transitiveReduction:
- transitivity:
- treeAllPairsLowestCommonAncestor:
- treeBroadcastCenter:
- treeBroadcastTime:
- treeCentroid:
- treeData:
- treeDecomposition:
- treeGraph:
- treewidthUpperBound:
- triadGraph:
- triadicCensus:
- TRIAD_NAMES:
- triadNames:
- triadsByType:
- triadType:
- triangles:
- trianglesMap:
- triangularLatticeGraph:
- trivialGraph:
- trophicLevels:
- truncatedCubeGraph:
- truncatedTetrahedronGraph:
- tsp2Opt:
- tspGreedy:
- tspNearestNeighbor:
- turanGraph:
- tutteGraph:
- tuttePolynomial:
- uniformRandomIntersectionGraph:
- union:
- view:
- visibilityGraph:
- volume:
- volumeWeighted:
- voronoiCells:
- voteRank:
- wattsStrogatzGraph:
- waxmanGraph:
- weaklyConnectedComponents:
- weight:
- WeightedEdge:
- weisfeilerLehmanHash:
- weisfeilerLehmanSubgraphHashes:
- wheelGraph:
- wienerIndex:
- windmillGraph:
- writeAdjlist:
- writeDot:
- writeEdgelist:
- writeEdgelistDigraph:
- writeGexf:
- writeGml:
- writeGraph6:
- writeGraphml:
- writeJsonGraph:
- writeMultilineAdjlist:
- writeNetworkText:
- writePajek:
- writeSparse6:
- writeSvg:
Made with Nim. Generated: 2026-03-30 08:39:45 UTC