Type of graph for keeping track of state (visited nodes) in an undirected weighted graph


Type of graph for keeping track of state (visited nodes) in an undirected weighted graph



I'm working on a problem that can be described using a (potentially asymmetric) undirected weighted graph, but with what I would intuitively call 'prerequisites'. That is, a given edge/vertex {A, B} might have a weight of x if node C has already been visited, but a weight of y in all other cases.



The solution I am currently working with simply uses separate nodes (e.g. Ac for "A but has visited C", etc., but there is clearly a potential for the number of nodes to handle getting out of hand.



So my question is, is there a pre-existing type of graph that would more effectively handle managing the 'state' of the nodes that I should know about?









By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Comments

Popular posts from this blog

paramiko-expect timeout is happening after executing the command

how to run turtle graphics in Colaboratory

Export result set on Dbeaver to CSV