Assume I have an undirected edge-weighted complete graph $G$ of $N$ nodes (every node is connected to every other node, and each edge has an associated weight). Assume that each node has a unique identifier.

Let's say I then have an input, $c$ of three edges (e.g $c=[4,7,6]$).
Does an algorithm exist that lets me search $G$ for instances of $c$, and returns the identifiers of the matching nodes?

The cycles it returns must be closed loops, such as $[A, D, B, \text{(then back to A)}]$, rather than $[D, A, B, A]$

Here is a poorly-drawn example: .