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