Tag Info

New answers tagged

3

Various graph representations exist. Yours is an adjacency list with explicit vertices and implicit edges: Each vertex stores its adjacent vertices, each of which implies a directed edge to it. In the above, blue squares are vertex objects, arrows are references vertex A's list of vertices is [ B ] vertex B's list of vertices is [ A, C ] vertex C's list ...


-1

Have you tried to create your own class/struct to represent the nodes? You don't tell much about what your nodes are but with a Node class made by you you'd be able to stock anything you need inside and still use it as Dictionary key. That way, when you walk through your dictionary you can always know Nodes weight. But you can also save the list of ...



Top 50 recent answers are included