minConnectivityID: Connectivity ID number considering shortest paths only

Description

This method calculates a modified, faster version of the connectivity ID number.

Usage

minConnectivityID(g, deg=NULL)

Arguments

a graph as a graphNEL object.

deg

the degree of each node of g. Will be automatically calculated if not supplied.

Value

sums the weights of all the shortest paths in the graph. This results in different values only if the graph contains cycles.

References

O. Ivanciuc and A. Balaban. Design of Topological Indices. Part 3. New Identification Numbers for Chemical Structures: MINID and MINSID. Croatica chemica acta, 69:9-16, 1996

Examples

Run this code

set.seed(987)
g <- randomEGraph(LETTERS[1:10], 0.3)

minConnectivityID(g)

Run the code above in your browser using DataLab