graph-algorithm

相关标签：javascript jquery android 多少钱 iPhone

Cheapest cost traversal on Complete graph

I was wondering if there is an algorithm which: given a fully connected graph of n-nodes (with different weigh开发者_StackOverflow社区ts)... will give me the cheapest cycle to go from node A (a start[详细]

2023-03-26 11:18 分类：问答
Tree root finding

How could I get from s开发者_如何学运维et of nodes and edges get tree with a root? (I\'m working with connectivity-matrix, each edge has weight: graph[i][j], without any negative edges). Later I need[详细]

2023-03-26 01:02 分类：问答
shortest paths & geodesics

given a mesh made entirely of quads, where every vertex has valence n (with n >= 3), and does not lie on the same plane, I need to find the distance of every vertex in the 开发者_JAVA技巧mesh from a c[详细]

2023-03-26 00:18 分类：问答
Is there any difference in time complexity for mean shortest path length and diameter algorithms for a graph?

For an undirected, unweighted graph, is there any difference in the time complexity of the algorithm to compute its开发者_开发问答 average shortest path length vs, the complexity of the algorithm whic[详细]

2023-03-25 19:57 分类：问答
Negative weights using Dijkstra's Algorithm

I am trying to understand why Dijkstra\'s algorithm will not work with negative weights. Reading an example on Shortest Paths, I am trying to figure out the following scenario:[详细]

2023-03-22 15:17 分类：问答
What is the problem name for Traveling salesman problem(TSP) without considering going back to starting point?

I would like to know what is the problem name for TSP w/o considering the way of going back to starting point and what is th开发者_如何学Goe algorithm to solve this.[详细]

2023-03-21 05:52 分类：问答
compare topologically sorted list with the original list

i have a vector of vertices from mygraph, and i topologically sort the vertices. typedef typename boost::adjacency_list<boost::listS, boost::vecS,[详细]

2023-03-20 03:09 分类：问答
Weighted Directed Acyclic Graphs: algorithm to find edge weights such that they define a distance function?

I have this technical problem that can be formuated with a Directed Acyclic Graph (DAG). Nodes represent events (with unknown timing), with directed edges encoding the relation ship: \"I\'m younger th[详细]

2023-03-17 03:34 分类：问答
Name for this distributed-database data-location optimization algorithm?

Say we have a large graph of databases connected to each other, effectively one giant distributed database.Any node on the graph can query the whole datab开发者_开发技巧ase by querying its neighbors r[详细]

2023-03-16 14:02 分类：问答
Algorithm for finding optimal node pairs in hexagonal graph

I\'m searching for an algorithm to find pairs of adjacent nodes on a hexagonal (honeycomb) graph that minimizes a cost function.[详细]

2023-03-14 17:23 分类：问答