docstr: Return the first largest when there are more than one largest subgraph
docstr_tok: ["Return","the","first","largest","when","there","are","more","than","one","largest","subgraph"]
code: def test_more_than_one_largest(self):
      """Return the first largest when there are more than one largest subgraph"""
  
      edges = [(0, 1), (1, 2), (3, 4), (3, 5)]
      sm = StructureModel()
      sm.add_edges_from(edges)
      largest_subgraph = sm.get_largest_subgraph()
  
      expected_edges = [(0, 1), (1, 2)]
      expected_graph = StructureModel()
      expected_graph.add_edges_from(expected_edges)
  
      assert set(largest_subgraph.nodes) == set(expected_graph.nodes)
      assert set(largest_subgraph.edges) == set(expected_graph.edges)
  
imports: import pytest
  from networkx.exception import NodeNotFound
  from causalnex.structure import StructureModel
label_desc: Use image node_id 2 for calling the TestStructureModelGetLargestSubgraph obj's underlying member method code with example usage: obj.test_more_than_one_largest() without return types