code: def get_irregular_edge_by_vertex(graph, vertex):
      
      for edge in graph.get_edges_by_vertex(vertex):
          if edge.is_irregular_edge:
              return edge
      return None
docs: Loops over all edges that are incident to supplied vertex and return a first irregular edge
          in "no repeat" scenario such irregular edge can be only one for any given supplied vertex