If I am given the adjacency matrix
then how do I find the number of vertices to determine if it's strongly connected?
I guess this example could easily be graphed, but for a more complex scenario what would be a rigorous method?
If I am given the adjacency matrix
then how do I find the number of vertices to determine if it's strongly connected?
I guess this example could easily be graphed, but for a more complex scenario what would be a rigorous method?