graph-theory

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

Using Graph Theory in Vehicle Routing Problem

I am working on a Vehicle Routing Problem with a single depot. The problem definition is as follows. There are n vechiles that need to travel to m number of sites. Each site has its specific constrain[详细]

2023-01-29 04:16 分类：问答
Determine if an undirected graph can be colored using only 2 colors

Any hints to how can you determine if an undirected graph can be colored with only 2 colors? How could that be implemen开发者_JAVA百科ted in java?Do a breadth-first search on the graph.At every even d[详细]

2023-01-28 09:56 分类：问答
Help designing a hash function to detect duplicate records?

Let me explain my program thus far. It is a rubiks cube solver. I am given a scrambled cube (this is the initial state). This becomes the root node of a graph. I am using iterative deepening depth fir[详细]

2023-01-28 05:59 分类：问答
How to find mother vertex in a directed graph in O(n+m)? [closed]

Closed. This question needs to be more focused. It is not currently accepting answers. 开发者_运维技巧[详细]

2023-01-27 19:00 分类：问答
Traversing an undirected, unweighted graph with a twist: minimum visits to each node

I\'m trying to write code that will traverse an undirected, unweighted graph.Essentially, the method will be passed a node (which knows all its neighbors).The method then has to build a model of the g[详细]

2023-01-27 17:37 分类：问答
Fast question about minimum spanning trees

If any edge from a spanning tree T0 is contained in some minimum spanning tree T*, does this imply that T0 is also a minimum spanning tree ?[详细]

2023-01-27 01:28 分类：问答
Optimizations for longest path problem in cyclic graph

What optimizations exist for trying to find the longest path in a cyclic graph? Longest path in cyclic graphs is known to be NP-complete. What optimizations or heuristics can make finding the longest[详细]

2023-01-26 23:56 分类：问答
Build algorithm to determine if a graph is created with a given algorithm

Let: G - the graph V(G) - the vertices E(G) - the edges v,w particular vertices. the algorithm for building the graph:[详细]

2023-01-26 20:22 分类：问答
Counting Subgraph Instances

Let\'s say I have a large (several thousand node) directed graph G and a much smaller (3-5 node) directed graph g.I want to count how many isomorphisms of g are in G.In other words, I want to know how[详细]

2023-01-26 19:42 分类：问答
Does this python code employs Depth First Search (DFS) for finding all paths?

This code is given in python official essays on graph theory. Here\'s the code: def find_all_paths(graph, start, end, path=[]):[详细]

2023-01-26 15:10 分类：问答