Let G be a graph and δ(G) the minimum degree of a vertex. Describe an algorithm in pseudocode that, for a given tree 开发者_如何学编程T with k<= δ(G) edges, should be build (in polinomial time) a
I have a directed graph data structure, where I am trying to implement individual version control for each vertex. This creates some interesting scenarios, and I would much appreciate any ideas that y
I have a code that try to find the Eulerian path like this. But somehow it doesn\'t work. What\'s wrong with the code?
I\'m sure most are familiar with the closest pair problem, but is there another alogrithm or a way to modify the current CP algorithm to get the 开发者_运维技巧next closest pair?Easy one, in O(n log(n
How to find all chordless cycles in an undirected graph? For example, given the graph 0 --- 1 \\ \\ 4 --- 3 - 2
Suppose I am given a weighted, connected graph. I\'d开发者_运维技巧 like to find a list of edges that can be removed from the graph leaving it split into two components and so that the sum of the weig
Is there a re开发者_开发技巧liable and well-documented Python library with a fast implementation of an algorithm that finds maximum flows and minimum cuts in directed graphs?
I have a graph I\'ve created in graphviz, but the problem is that edges overlap each other (I have开发者_开发问答 5-7 nodes in each row), so it is hard to tell for each node which are the nodes it con
I want to create a graph (Graph Theory) where certain edges have a different colour to other edges, which would be used to highlight a path in the graph from one vertex to another.
I have written some matlab code for image analysis that searches for clusters in an image and that builds an adjacency matrix for those clusters, discribing which clusters are touiching eachother in t
加载中,请稍侯......