graph-theory
How to force node position (x and y) in graphviz
I am trying to force position of nodes. I have x and y coordinates of my nodes and its also directed graph. I can use the ra开发者_运维知识库nk=same to handle row (y coordinate), but can\'t figure out[详细]
2023-02-17 17:24 分类:问答Mathematical equation to link pages
It\'s kind mathematics query..I want a script in php that will do following Let\'s say I\'ve 100 pages page1.php, page2.php, page3.php, page4.php....goes on page100.php[详细]
2023-02-17 13:30 分类:问答Travelling salesman with repeat nodes & dynamic weights
Given a list of cities and the cost to fly between each city, I am trying to find the cheapest itinerary that visits all of these cities. I am currently using a MATLAB solution to find the cheapest ro[详细]
2023-02-16 04:07 分类:问答Does A* work with negative weights as long that the heuristic is admissible?
This seems true but I can\'t find anyone on the internet saying it is, so I\'d like to make sure. Please tell me if you agree and if so, why. Ideally a link to a paper, or, if you disagree, a countere[详细]
2023-02-15 08:35 分类:问答How's A* able to abandon a non efficient path following a better one?
Consider the A* algorithm. In Google it is possible to find a good pseudo-code: function A*(start,goal)[详细]
2023-02-13 14:06 分类:问答Creating simple path edges not contained in BFS
First off...here\'s the problem... Give an example of a directed graph G = (V, E), a source vertex s in V, and a set of tree edges F contained in E, such that for 开发者_运维知识库each vertex contai[详细]
2023-02-13 06:35 分类:问答Algorithms: max flow problem and s-t minimum cut
Let G be an input graph to the max flow problem. Let A be a minimum s-t cut in the graph. Suppose we add 1 to the capacity of every edge in the graph. Is it ne开发者_如何转开发cessarily[详细]
2023-02-12 07:06 分类:问答Finding all cycles in an undirected graph
If I have an undirected graph, how can I get a list of all cycles? For example, from the following graph, I would want the cycles:[详细]
2023-02-12 04:10 分类:问答Help with traversing through node/ input file read
So I have this assignment where I read in 1 line at a time separated by comma e.g. Atlanta, Philadelphia[详细]
2023-02-10 19:28 分类:问答How to find the shortest simple path in a Tree in a linear time?
Here is a problem from Algorithms book by Vazirani The input to this problem is a tree T with integer weights on the edges. The weight开发者_StackOverflow中文版s may be negative,[详细]
2023-02-10 06:11 分类:问答