I have to create an algorithm for routing purposes in pipeline industry. Like we have 4 pipelines available and in between there can be either injection of oil or it can be taken out at any station. I
I have a graph-theoretic (which is also related to combinatorics) problem that is illustrated below, and wonder what is the best approach to design an algorithm to solve it.
I have a set of values, each value has a possible group. The value can ve repeating but in different group.
at first, please excuse my bad knowledge in english. I\'ve got the following Problem: I must find the shortest way between more then 2 Points in a fix order (e.g. A -> D -> F).
I wonder if someone can help me to find the area of a 2-D object in Cartesian plane , when we know coordinates of every points.
I have a monit开发者_StackOverfloworing application in python 2.6 that calculates the number of entries in a queue (queue_len). I want to create a simple function that can use these queue_len rate of
This question has a great answer for detecting cycles in a d开发者_JAVA技巧irected graph.Unfortunately, it does not seem easy to make a Map Reduce version of it.
Given a sequence of operations: a*b*a*b*a*a*b*a*b is there a way to get the optimal subdivision to enable reusage of substring.
i need to deform a mesh/grid (only in 2d z remains same) in opengl by deform i mean user will use mouse or touch and drag a particular vertice and rest will follow
I\'m cur开发者_如何学运维rently following Steve Yegge\'s advice on preparing for a technical programming interview: http://steve-yegge.blogspot.com/2008/03/get-that-job-at-google.html
加载中,请稍侯......