In which of the following tree traversal all the child nodes are visited first before the parent node [closed]
Closed 9 years ago.
Number of sequences when no adjacent items can be the same
I came across this one problem,
In a mutual credit network, how would you program an automatic jubilee?
A little explanation might be needed. I mean mutual credit the way that it’s defined here:
Shortest path to visit all nodes [duplicate]
This question already has answers here: Algorithm for an exact solution to the Travelling Purchaser Problem (3 answers) Closed 9 years ago. I am given a set of tourist attractions(nodes identified by x, y) and i need to find the shortest path to visit them. The way i thought of it, is i will ignore […]
Shortest path to visit all nodes [duplicate]
This question already has answers here: Algorithm for an exact solution to the Travelling Purchaser Problem (3 answers) Closed 9 years ago. I am given a set of tourist attractions(nodes identified by x, y) and i need to find the shortest path to visit them. The way i thought of it, is i will ignore […]
Mathematically correct A* heuristic / distance estimator for a latitude / longitude graph
I have a graph in which each node is a geographical point on the surface of the earth, defined by it’s latitude / longitude coordinates.
Mathematically correct A* heuristic / distance estimator for a latitude / longitude graph
I have a graph in which each node is a geographical point on the surface of the earth, defined by it’s latitude / longitude coordinates.
Mathematically correct A* heuristic / distance estimator for a latitude / longitude graph
I have a graph in which each node is a geographical point on the surface of the earth, defined by it’s latitude / longitude coordinates.
Algorithm or domain for finding cheapest subgraphs that connect vertex pairs
I am currently working on a project inspired by the Ticket to Ride board game. This board game is played on an undirected graph where each vertex represents a city and each edge represents a claimable train line connecting two cities. Players get points by claiming an edge for themselves, scoring points based upon how many cars the route requires to claim. There are also tickets that give bonus points if the player is able to claim a path that connects the two cities. Each player has only 45 cars, so this is a resource allocation problem.
Algorithm or domain for finding cheapest subgraphs that connect vertex pairs
I am currently working on a project inspired by the Ticket to Ride board game. This board game is played on an undirected graph where each vertex represents a city and each edge represents a claimable train line connecting two cities. Players get points by claiming an edge for themselves, scoring points based upon how many cars the route requires to claim. There are also tickets that give bonus points if the player is able to claim a path that connects the two cities. Each player has only 45 cars, so this is a resource allocation problem.