Unlike a regular graph, there is no maximum limit for the size of the edges' multiset. In our case, an edge can be repeated at most three times within the multiset. This means that given the cardinality of nodes within a multigraph, the maximum size of the set of edges will be 3(𝑛 2 ), indicating a space complexity of 𝑂(𝑛 2 ). In this context, we are examining multigraphs characterized by a node size on the order of 10 3 and a range of edge numbers spanning from 10 6 to 10 7 . Intuitively, managing such graphs represents a challenge.