I'm having problems with edges overlapping each other. In my previous question of how to force the nodes to be in the same column, found out how to force the nodes in to one column, but this causes some other problems to appear. digraph exmp { A -> B -> C -> D -> E C -> F [constraint=false] A -> C [style="dotted", constraint=false...
I want to draw a graph that will be something like this: You can see 3 pathes: a, b & c. How can I change position of elements (1,2,3...,9) to make long of the path as short as possible? I mean this lines should be as short as possible. Im very interested in it becouse I am drawing a graph with question, some kind of infographic like...
I have a graph with an s and t vertex that I need to find the shortest path between. The graph has a lot of special properties that I would like to capitalize on: *The graph is a DAG (directed acyclic graph). *I can create a topological sort in O(V) time, faster than the traditional O(V + E). *Within the topological sort, s is the first ...
I'm about to code some graphs and charts from scratch. Does anyone know of book that covers the reason for using some graphs and charts as well as the implementation of graph and charts. I'd prefer something combined computer science and the math of charts and graphs. Acceptable languages would be C, C++, but especially Objective-C ...
I am drawing a graph using the plot() function, but by default it doesn't show the axes. How do we enable showing the axes at x=0 and y=0 on the graph? Actually my graph is something like: And I want a horizontal line corresponding to y=0. How do I get that? ...
I'm looking at using Boost Graph Library as the basis for a dag graph. I haven't really used it all that much before, so not too familiar with how it works. Although I don't need edge weights and clever traversing algorithms, I would quite like to get the serialisation for free, plus the constraints enforcing dag graphs and disallowing ...
I'm trying to decide between going with a pre-made graph/node network library or to roll my own. I'm implementing some graph search algorithms which might require some significant customization to the class structure of the node and/or edges. The reason I'm not sure what to do is that I'm unsure if customization of a pre-made might be...
I am currently in the process of working on an scheduling application and have run into a small snag. Because the field is heavily regulated for safety reasons the software is required to check a number of interdependent conditions to ensure a trip is possible. Instead of a nice tree of conditions - which would be simple to implement - I...
For drawing Scatter plots of >100K points, Excel 2007/10 hangs under repeated refresh. What is a better tools for such tasks. I have 4 GB ram etc on this machine. ...
I have a file a.txt which is like: 0 0 0 3 4 3 0 0 3 0 3 4 0 1 0 4 4 4 0 1 3 1 3 5 0 2 0 5 4 5 0 3 0 0 4 0 These are vertices of triangles [x1 y1 x2 y2 x3 y3] that I need to plot on a 6x6 grid. I need to see these triangles on a single graph. How can this be done in MATLAB? ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~...
I'm looking to build an algorithm (or reuse one) that organizes nodes and edges on a 2 dimensional canvas where edges can have corresponding weights. Any starting material and info would be helpful. ...
I have this plot [Full Resolution] I need to make a straight vertical line at a point on x axis that the user enters and show the coordinates of the intersection of that vertical line with my plot. How can this be done in MATLAB? for example: the user enters 1020 then a straight vertical line will be drawn at 1020 that meets the pl...
I have a bipartite graph. I am looking for a maximum (1,n) "matching", which means that each vertex from partitation A has n associated vertices from partition B. The following figure shows a maximum (1,3) matching in a graph. Edges selected for the matching are red and unselected edges are black. This differs from the standard bipa...
Further to: http://stackoverflow.com/questions/326679/choosing-an-attractive-linear-scale-for-a-graphs-y-axis And what to do when some of the points are negative? I believe this part of the question was not answered but it seems I can't comment or extend that question so I've created a new one Values -100, 0, 100 with 5 ticks: ...
The graph size is in the billions of nodes, and tens of billions of vertices. It will store webpages urls, and links between webpages and it will be used for testing ranking algorithms. Any language is fine but java is prefered. Solutions i found so far: neo4j storing in sorted flat files Yes, i have already read Best Way to Store...
I have an application which utilizes graph (tree-like) custom structures. The structures are not real trees, but pretty much everything is connected together. The quantity of the data is also big (millions of nodes can exist). Tree-nodes can vary in type to make it more interesting (inheritance). I don't want to alter the data-structures...
I need to search through a DAG graph, but I don't want to advance past a node before I have seen all of the other nodes that have directed links pointing to it. Is there an existing algorithm to handle this particular situation, the depth first search and breath first search don't work for this order of traversal. Ie: A -> B B -> C C ...
Can anyone help me out how I can change the individual color of each series bar using Microsoft Graph PIA in C#? I have tried multiple ways but nothing works. There is this ChartFormatFill object inside the Series object but it is read only and doesnt allow me to change the color of the bars. I have also tried recording a macro and the...
Hi is ther a recommended way to clear a jquery flot graph? I couldn't find anything the in the api... ...
I'm currently working on an interesting graph problem, I can't find any algorithms or other stackoverflow questions which mention anything like this. If I have a graph (undirected, cyclic) and a list of commonly used paths, what is the best way to reduce the average path length by adding in N more edges? EDIT:: Important point, which m...