class_docstr: Test for the file tarjan.py
  
  Arguments:
      unittest {[type]} -- [description]
class_docstr_tok: ["Test","for","the","file","tarjan.py","Arguments",":","unittest","{","[","type","]","}","--","[","description","]"]
code: def test_tarjan_example_2(self):
      # Graph from https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm#/media/File:Tarjan%27s_Algorithm_Animation.gif
      example = {
          "A": ["E"],
          "B": ["A"],
          "C": ["B", "D"],
          "D": ["C"],
          "E": ["B"],
          "F": ["B", "E", "G"],
          "G": ["F", "C"],
          "H": ["G", "H", "D"],
      }
  
      g = Tarjan(example)
      self.assertEqual(
          g.sccs, [["A", "B", "E"], ["C", "D"], ["F", "G"], ["H"]]
      )
  
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 2 for calling the TestTarjan obj's underlying member method code with example usage: obj.test_tarjan_example_2() without return types