Hi - I'm working on a hw problem that asks me this: given a finite set of numbers, and a target number, find if the set can be used to calculate the target number using basic math operations (add, sub, mult, div) and using each number in the set exactly once (so I need to exhaust the set). This has to be done with recursion. So, for...
Anyone has a ready implementation of the Reverse Breadth First traversal algorithm in C#? By Reverse Breadth First traversal , I mean instead of searching a tree starting from a common node, I want to search the tree from the bottom and gradually converged to a common node. Let's see the below figure, this is the output of a Breadth Fi...
I'm looking for an open source (GPL, LGPL etc) graph layout library for .net framework, preferably fully managed code. Im not worried about the visualisation aspect of things. I can find lots of them for Java, but none for .net... Thanks! ...
Hi all, I am newbie for integer linear programming. I plan to use a integer linear programming solver to solve my combinatorial optimization problem. I am more familiar with C++/object oriented programming on an IDE. Now I am using NetBeans with Cygwin to write my applications most of time. May I ask if there is an easy use ILP solver f...
Given a weighted graph (directed or undirected) I need to find the cycle of the graph with the maximum weight. The weight of a cycle being the sum of the weight of the edges of the graph. It can be any cycle, not just base cycle for which we can find all base cycle (see http://stackoverflow.com/questions/1607124/algorithms-to-identif...
Given a graph undirected G = (V,E) and a set of nodes P. I need to find a cycle (not the shortest length cycle) containing these nodes? How do I find this cycle? ...
This is a long shot, but I thought I might try before starting the dirty work. I've got a project to build an application which will, for a defined input stations (vertices) and lines (edges), that is, a real map of some public transportation, schematize a given map into a metro map. I've done some research on the problem and it's an NP...
Hello, I'm attempting to design an algorithm that does the following. Input: I've a set of keys (total n) that are mapped to set of properties. The properties contain the weight for each property and the value for the property. Output: Identify a set of keys that are qualified (total k) based on the set of properties and their ...
I have some data that represents a flowchart. (A bunch of Jira statuses and their transitions to other statuses.) I also have a crude way to position each flowchart item on an A4 page in an OpenOffice Draw document. (Though better suggestions welcome for that.) However, I'd prefer not to have to output a line of boxes and re-arrange th...
I have an unweighted, connected graph. I want to find a connected subgraph that definitely includes a certain set of nodes, and as few extras as possible. How could this be accomplished? Just in case, I'll restate the question using more precise language. Let G(V,E) be an unweighted, undirected, connected graph. Let N be some subset...
For instance A+B=C C+D=E E+F=G as changes are made to each node the associated nodes are recalculated. The image below is a simplistic example of what I am trying to do. Further clarification The structure for each object is identical. the inputs would be prices as each price changes it would have a cascading effect on the prices do...
Given a undirected and connected graph G, find a spanning tree whose diameter is the minimum. ...
Is there any efficient algorithm to find the set of edges with the following properties, in a complete weighted graph with an even number of vertices. the set has the smallest, maximum edge weight for any set that meats the other criteria possible every vertex is connected to exactly one edge in the set All weights are positive dI c...