Revision history [back]
 | 1 | initial version |
It's unclear what do you mean under "distinguish". If it's about creation/generation of unlabeled graphs, then both Graph or DiGraph produce unlabeled (di)graphs unless one specifies labels for vertices and/or edges. If it's about comparison of unlabeled graphs, then this can be done via comparison of their canonical labels (`.canonical_label()'). So, example of what you want to achieve would be helpful.
| | 2 | No.2 Revision |
It's unclear what do you mean under "distinguish". If it's about creation/generation of unlabeled graphs, then both Graph or DiGraph produce unlabeled (di)graphs unless one specifies labels for vertices and/or edges. If it's about comparison of unlabeled graphs, then this can be done via comparison of their canonical labels (`.canonical_label()'). (.canonical_label()). So, example of what you want to achieve would be helpful.
| | 3 | No.3 Revision |
It's unclear what do you mean under "distinguish". If it's about creation/generation of unlabeled graphs, then both many graph construction methods produce unlabeled Graph or DiGraph(di)graphs unless one specifies labels for vertices and/or edges. (di)graphs. If it's about comparison of unlabeled graphs, then this can be done via comparison of their canonical labels (.canonical_label()). So, example of what you want to achieve would be helpful.
