code: def load_dic28():
      
  
      dataset_path = _load('dic28')
  
      X = _load_csv(dataset_path, 'data')
      y = X.pop('label').values
  
      graph1 = nx.Graph(nx.read_gml(os.path.join(dataset_path, 'graph1.gml')))
      graph2 = nx.Graph(nx.read_gml(os.path.join(dataset_path, 'graph2.gml')))
  
      graph = graph1.copy()
      graph.add_nodes_from(graph2.nodes(data=True))
      graph.add_edges_from(graph2.edges)
      graph.add_edges_from(X[['graph1', 'graph2']].values)
  
      graphs = {
          'graph1': graph1,
          'graph2': graph2,
      }
  
      return Dataset(load_dic28.__doc__, X, y, accuracy_score,
                     stratify=True, graph=graph, graphs=graphs)
docs: DIC28 Dataset from Pajek.
  
      This network represents connections among English words in a dictionary.
      It was generated from Knuth's dictionary. Two words are connected by an
      edge if we can reach one from the other by
      - changing a single character (e. g., work - word)
      - adding / removing a single character (e. g., ever - fever).
  
      There exist 52,652 words (vertices in a network) having 2 up to 8 characters
      in the dictionary. The obtained network has 89038 edges.