Distinguishing vertices of DiGraph

[Brandon Gontmacher]

I have a tree structure where the same point shows up on different levels, but I want to treat these as distinct points on the graph. Currently the only workaround is to add an integer to each of the points to distinguish them. Is there a way to change the label on the vertex but keep the points differentiated in the dictionary?

We know an alternate way to construct a directed graph is to call DiGraph on an adjacency matrix, but as it stands I only see a way to label vertices when we feed the function a dictionary. I am wondering if it is possible to label the rows of the adjacency matrix (which represent one vertex each) so that DiGraph outputs a graph with vertices labelled something other than 0, ..., n. I think this would fix the issue, since I'd be able to give different rows the same label.