node label is different than edge label in the original gspan algorithm

[Youmna-Salah]

I wanted to bring to your attention a difference I observed between your implementation and the gSpan algorithm implemented in Java, which I have been using as an alternative. In the Java implementation (https://github.com/nphdang/gSpan/tree/master/Data), the treatment of node labels differs from that of edge labels. However, in your code, I noticed that the node label and the edge label are used interchangeably.

I appreciate your work and am reaching out to understand if there's a specific reason for this difference in label handling. Your insights on this matter would be valuable.

Thank you for your time and consideration.

[Youmna-Salah]

To clarify with an example: If I get in the output
v 0 120
v 1 12
e 0 1 10

10 in the input graph is a node but in the output, as far as I understand, it's an edge label. Did I get that correctly? If so why are node ids being used as edge labels in the output?