[Tutor] plot

[lina]

<snip>

May I ask something I met during reading the graph links provided?

For the case I faced now,

...
[['76', '34', '76'], ['1', '5', '1']]
[['64', '62', '58'], ['64', '58', '64'], ['13', '46', '64']]
...
[['64', '75', '64'], ['62', '46', '13'], ['64', '75', '64'], ['64',
'75', '62'], ['64', '75', '64'], ['64', '75', '64'], ['76', '34',
'32'], ['13', '75', '64']]
...

I don't know which algorithms I should look up into it.

It's directed graph, but not a network flow, cause there is no certain
source or sink, neither there is no capacity limit, but it would be
wonderful to get the "flow" among those paths (strictly speaking, not
flow, just the load of each edge, the occurence of the path).
Sorry I don't have CS backgrounds, so it's a bit hard for me to get start.

Thanks for any suggestions,

Best regards,