Connectivity ID number considering shortest paths only

Share:

Description

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

Usage

1

Arguments

g

a graph as a graphNEL object.

deg

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

Value

This method works like the connectivityID method, but it only sums the weights of all the shortest paths in the graph. This results in different values only if the graph contains cycles.

Author(s)

Michael Schutte

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

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

minConnectivityID(g)

Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.