QuACN-package           QuACN: Quantitative Analysis of Complex
                        Networks
adjacencyMatrix         Adjacency Matrix
atomBondConnectivity    Atom-bond connectivity (ABC) index
augmentedMatrix         Augmented Matrix
augmentedZagreb         Augmented Zagreb index
balabanID               Balaban ID number
balabanJ                The Balaban J index
balabanlike1            BALABAN-like information index U(G)
balabanlike2            BALABAN-like information index XU(G)
bertz                   Bertz complexity index
bonchev1                Magnitude-based information index by Bonchev
                        I_D(G)
bonchev2                Magnitude-based information index by Bonchev
                        I_D^W(G)
bonchev3                Mean information content of the distance
                        equalities
bondOrderID             Conventional bond order ID number
calculateDescriptors    Generalized descriptor calculation
chemicalElements        Information about chemical elements
compactness             Compactness
complexityIndexB        The complexity index B
connectivityID          Randi\'c connectivity ID number
degreeDistribution      Degree Distribution
diameter                Diameter
distSumConnectMatrix    Distance-sum-connectivity matrix
distanceCodeCentric     Distance code centric index
distanceDegreeCentric   Distance degree centric index
distanceDegreeCompactness
                        Compactness measure based on distance degrees
distanceDegreeEquality
                        Mean information content of distance-degree
                        equality
distanceDegreeMIC       Mean information content of the distance
                        degrees
distanceMatrix          Distance Matrix
distancePathMatrix      Distance Path Matrix
dobrynin                Dobrynin inidces
edgeDeletedSubgraphs    Edge-deleted subgraphs
edgeEqualityMIC         Mean information content on the edge equality
edgeMagnitudeMIC        Mean information content on the edge magnitude
efficiency              Efficiency complexity index
eigenvalueBased         Eigenvalue-based Descriptors
energy                  Graph energy
estrada                 Estrada index
extendedAdjacencyMatrix
                        Extended Adjacency Matrix
geometricArithmetic1    First geometric-arithmetic index
geometricArithmetic2    Second geometric-arithmetic index
geometricArithmetic3    Third geometric-arithmetic index
getLabels               This method returns the label of a descripor as
                        expression.
getLargestSubgraph      A function to extract the largest subgraph from
                        a graphNEL object
globalClusteringCoeff   Global Clustering Coefficient
graphDistanceComplexity
                        Graph distance complexity measure
graphIndexComplexity    Graph index complexity measure
graphVertexComplexity   Graph Vertex Complexity
harary                  Harary Index
huXuID                  Hu-Xu ID number
hyperDistancePathIndex
                        Hyper Distance Path Index
infoTheoreticGCM        Information theoretic graph complexity
                        meassures
infoTheoreticLabeledE   Information functional for edge-labeled graphs
infoTheoreticLabeledV1
                        V1 information functional for vertex-labeled
                        graphs
infoTheoreticLabeledV2
                        V2 information functional for vertex-labeled
                        graphs
infoTheoreticSum        Add the results of two information functionals
informationBondIndex    Information bond index
informationLayerIndex   Information layer index
konstantinova           Konstantinova
laplaceMatrix           Laplacian Matrix
laplacianEnergy         Laplacian energy of a graph
laplacianEstrada        Laplacian Estrada index
layerMatrix             Layer (sphere) matrix
localClusteringCoeff    Local Clustering Coefficient
meanDistanceDeviation   Mean Distance Deviation
mediumArticulation      Medium articulation index
minBalabanID            Balaban ID number considering shortest paths
                        only
minConnectivityID       Connectivity ID number considering shortest
                        paths only
modifiedZagreb          Modified Zagreb index
narumiKatayama          Narumi-Katayama index
normalizedEdgeComplexity
                        Normalized Edge Complexity
offdiagonal             Offdiagonal complexity index
oneEdgeDeletedSubgraphComplexity
                        One-edge-deleted subgraph complexity measures
primeID                 Prime ID number
productOfRowSums        Product of Row Sums
radialCentric           Radial Centric Information Index
randic                  Randic connectivity index
randomWalkMatrix        Random Walk Markov Matrix
spanningTreeSensitivity
                        Spanning tree sensitivity measures
spectralRadius          Spectral radius
symmetryIndex           Symmetry Index
topologicalInfoContent
                        Topological Information Conten
totalAdjacency          Index of total Adjacency
twoEdgesDeletedSubgraphComplexity
                        Two-edges-deleted subgraph complexity
variableZagreb          Variable Zagreb index
vertConnectMatrix       Vertex Connectivity Matrix
vertexDegree            Vertex degree equality-based information index.
weightStrucFuncMatrix_exp
                        Weighted Structure Function Matrix
weightStrucFuncMatrix_lin
                        Weighted Structure Function Matrix
weightedID              Weighted ID number
wiener                  Wiener index
zagreb1                 Zagreb group index 1
zagreb2                 Zagreb group index 2
