minBalabanID: Balaban ID number considering shortest paths only

Description Usage Arguments Value Author(s) References Examples

View source: R/minBalabanID.R

Description

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

Usage

1

Arguments

g

a graph as a graphNEL object.

dist

the pre-computed distance matrix of the graph. Will be calculated automatically if NULL.

Value

This method works like the balabanID 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)

minBalabanID(g)

QuACN documentation built on May 2, 2019, 5:46 p.m.