code: def test_digraph_strongly_connected(self):
      g1 = check_digraph_strongly_connected.Graph(5)
      g1.add_edge(0, 1)
      g1.add_edge(1, 2)
      g1.add_edge(2, 3)
      g1.add_edge(3, 0)
      g1.add_edge(2, 4)
      g1.add_edge(4, 2)
      self.assertTrue(g1.is_strongly_connected())
  
      g2 = check_digraph_strongly_connected.Graph(4)
      g2.add_edge(0, 1)
      g2.add_edge(1, 2)
      g2.add_edge(2, 3)
      self.assertFalse(g2.is_strongly_connected())
  
imports: from algorithms.graph import Tarjan
  from algorithms.graph import check_bipartite
  from algorithms.graph.dijkstra import Dijkstra
  from algorithms.graph import ford_fulkerson
  from algorithms.graph import edmonds_karp
  from algorithms.graph import dinic
  from algorithms.graph import maximum_flow_bfs
  from algorithms.graph import maximum_flow_dfs
  from algorithms.graph import all_pairs_shortest_path
  from algorithms.graph import bellman_ford
  from algorithms.graph import count_connected_number_of_component
  from algorithms.graph import prims_minimum_spanning
  from algorithms.graph import check_digraph_strongly_connected
  from algorithms.graph import cycle_detection
  from algorithms.graph import find_path
  from algorithms.graph import path_between_two_vertices_in_digraph
  import unittest
label_desc: Use image node_id 1 for calling the TestDigraphStronglyConnected obj's underlying member method code with example usage: obj.test_digraph_strongly_connected() without return types