ka | en
Authorisation

Logical entropy of Directed Graph's Strongly Connected Components
Author: Guram KashmadzeKeywords: Strongly connected components. logical entropy
Annotation:
The notion of logical entropy is applied to doubly-sided reachability relation vertecies. C++ program to find of logical entropy of strongly connected components is given.