C-Plus-Plus
C-Plus-Plus copied to clipboard
Add Warshall's Transitive Closure Algorithm to Graph folder
Detailed description
Warshall's algorithm is used to determine the transitive closure of a directed graph or all paths in a directed graph by using the adjacency matrix. For this, it generates a sequence of n matrices. Where, n is used to describe the number of vertices.
Context
In mathematics, the transitive closure of a binary relation R on a set X is the smallest relation on X that contains R and is transitive. In computer science, the concept of transitive closure can be thought of as constructing a data structure that makes it possible to answer reachability questions. Warshall's algorithm can be implemented in both cases.
Possible implementation
No response
Additional information
No response
I'd like to work on this issue!
abhilipsasahoo03
Thanks for showing interest in contributing to the repository.
Please raise a pr with the relevant code it will get reviewed.
Before you start coding please read Contribution Guidelines
I would like to work on this issue
I would like to work on this issue
Hi, a PR has already been created for this issue and is under review.
Hello sir, I would like to contribute kindly assign me the issue.
Hello Sir, I would like to do this task could you assign me this task.
Hello Sir,
I would like to do this task could you assign me this task.
Thanks for showing interest. The issue has already be taken. Please connect with us on gitter or discord.
This issue has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.
Please ping one of the maintainers once you add more information and updates here. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions!