Repeated edges in traffic assignment output (Algorithm B)?

[finnwiz]

Hi there,

Firstly, thank you for this extraordinary library. Documentation is great; and we're using it in a project.

Secondly, perhaps I'm misunderstanding something, but when I use assign_traffic according to:

traffic <- assign_traffic(Graph = sgr,
                          from = od_df$from,
                          to = od_df$to,
                          demand = od_df$tons,
                          max_gap = max_gap,
                          algorithm = "dial",
                          verbose = TRUE,
                          aon_method="d",
                          max_it=max_iterations)

The output file (which I'm writing to parquet), actually has edges with repeated vertices. That is, I see:

Is this behavior expected? Do I need to aggregate the traffic output before using? Are there requirements on the input network dataframe ordering that are leading to this unexpected outcome? Appreciate any guidance and thank you in advance for the help!

[finnwiz]

Well. Writing down my question made me re-examine my graph, which I've erroneously constructed as a multi-digraph. My fault! Closing but thanks again.