arcs | 🌈Scaffold genome sequence assemblies | Genomics library

I'm struggling with the following issue. I visualized a big social network and would like to customize the color palette of the edges captured in geom_segmentfor better visibility. For instance, I want to replace my blue scale by a red scale. How can I achieve that in the easiest way possible?

I have the following code which is working fine:

I am new to zimpl and I am currently trying to modell the GTSP. The setting is that we have nodes which are grouped into clusters. My problem is i dont know how to implement in zimpl which node belongs to which cluster.

What I did so far:

set V:= {1..6}; set A:= { in V*V with i < j};
set C:= {1,2,3};
set W:= { in C*C with p < q};
set P[]:= powerset(C); set K:= indexset(P);

I am guessing something is missing because i want to group node 1,2 in cluster 1, 3,4 in cluster 2 and 5,6 in cluster 3.

Some background Information:

Let G = (V, A) be a graph where V=1,2,...,n is the set of nodes and A = {(i, j): i, j ∈ V, i ≠ j} is the set of directed arcs (or edges), and let c_ij be the travel distance (or cost or time) from node i to node j. Let V1, V2, ... , Vk be disjoint subsets of V such that union of these subsets equals to V. These subsets are called clusters. The GTSP is to find the tour that (i) starts from a node and visits exactly one node from each cluster and turns back to the starting node (ii) never visit a node more than once and (iii) has the minimum total tour length. Associated with each arc, let x_ij be a binary variable equal to “1” if the traveler goes from node i to node j, and “0” otherwise.

Thats the mathematicl model I want to model: min∑i∈V ∑j∈V\{i} cijxij subject to: ∑i∈Vp ∑j∈V\Vp xij = 1 (p= 1, ..., k) ∑i∈V\Vp ∑j∈Vp xij = 1 (p= 1, ..., k) ∑j∈V\{i} xji − ∑j∈V\{i} xij = 0 (∀i∈V) xij∈{0,1} ∀(i, j)A up−uq+k ∑i∈Vp ∑j∈Vq xij+(k−2)∑i∈Vq ∑j∈Vp xij ≤ k−1 (p≠q;p,q=2,...,k) up≥0 (p=2, ..., k) (Thats the link for the paper: http://www.wseas.us/e-library/conferences/2012/Vouliagmeni/MMAS/MMAS-09.pdf)

Maybe someone can help! thanks

How can I make a Box like this the easiest way?

I tried a lot with CustomPainter and Arcs or CustomClippers but failed. I know its possible with those techniques but I could not manage to do it. (Please include the code if possible I lost way too much time on this already)

The topic link: https://codeforces.com/problemset/problem/600/D

For the question, I'm wrong answer on test28, which could look like this:

correct answer:119256.95877838134765625000

my answer: 120502.639190673828125

I guess it is caused by calculation accuracy, but I don't have evidence. Maybe algorithm itself is faulty, please point it out.

Algorithm ideas:

For any given two circles, in order to simplify the calculation, we can translate the origin of the coordinates to the center of one of the circles, and then rotate the other circle to the x-axis by rotating. For calculating the intersection area of the circles, before and after are equivalent, and finally a purple circle and a red circle are formed. In fact, the final intersection area is equal to the sum of the areas of the two sectors minus the area of the diamond in the middle(the figure below, Horizontal axis x, vertical axis y). However, before that, we must first calculate the intersection point of the two circles.

The coordinates of the center of the first circle at the beginning: .

The coordinates of the center of the second circle at the beginning: .

The coordinates of the center of the first circle after a series of transformations: .

The coordinates of the center of the second circle after a series of transformations: ,

.

The equations of two circles are combined:

are the radius of the first and second circles respectively,so:

we can use the sector area formula : ,

, .

In this place, there will be problems with the positive and negative values of the radian(the two figures below), but it can be proved that they can be absorbed in the final result.

The final result is the sum of the areas of the two arcs minus the area of the middle diamond.

mycode:

So I've been trying to create a donut chart in d3.js and am having trouble adding labels to the chart. My chart data is in an array, but I think because of the "pie" variable, only the "value" from the data is being passed through and not the "text". Have tried multiple ways to try and bring the "text" in but with no luck. Hopefully a fresh set of eyes can see where my mistake is!

I have an application where for a given fixed number of vertices, there is a need to solve large number of different max-flow algorithms from a given fixed source (S) to a given fixed sink (T). Each max-flow problem differs in that the directed arcs themselves change along with their capacities. As an example, see below.

The number of vertices remains fixed, but the actual arcs and their capacities differ from one problem to the next.

I have the following code that solves the max-flow problem iteratively for Graph 1 and Graph 2 in the figure above using boost thus (apologies for the wall of text, I have tried to make it as minimal as possible. The code below fully compiles on g++ on my linux box, but I am unable to have this correcly compile on online compilers such as wandbox, etc.):

I have started to learn d3.js. My main goal is zoomable sunburst chart but trying to learn whole library and using it I am trying to create a pie chart. In the pie chart all the arcs are not showing. Please guide regarding this.

CSS:

I have been using the following references to try to determine if a Point is inside of a 2D Polygon that has Arcs:

Is a point inside of 2D polygon, no curves

Is a point inside a compound polygon (C#)

Is a point inside a curve (Theory)

My approach uses Ray Casting to determine if a point is within the polygon boundary. This is my code that attempts to string the references together (C#):

This question is a bit specific. Assume for simplicity that I have a unit circle, i.e. a circle centered on the origin (0,0) with radius 1. On this circle I have three points: A, B, and C. Assume that B and C are fixed, and that A can be moved along the circle's circumference.

Question: What conditions can I check efficiently to ensure that A is not moved outside the arc between B and C originally containing it?

As a point of clarification: I do not just wish to detect whether the point is on this arc or not (i.e., get a boolean), but to have a quantifiable measure (for example, of distance) so I can prevent it from being moved outside. You can imagine my setup like this, restricting point A to the red arc:

Here are some ideas I have pondered so far, but none were successful:

• Limit the angle alpha of A = [cos(alpha),sin(alpha)] to the origin between the angles beta and gamma of B=[cos(beta),sin(beta)] and C=[cos(gamma),sin(gamma)], where alpha, beta, and gamma are angles in radians. Unfortunately, this naive case only works in scenario (a) above. If the arc to which A is restricted crosses the (in my case, western) discontinuity from +pi/-pi, a naive upper and lower bound won't do.
• Calculate the length of the arcs between A-to-B and A-to-C, then ensure that as A is moved this sum does not change. Unfortunately, I have only found this solution to calculate the arcs between two points, and it always calculates the shorter arc. In scenario (c), however, the correct arc A-to-B is the larger one.