algorithm - How to draw graph with disjoint edges? -


I have the proximity matrix for the graph without having to intersect the edges I need to see this article. I peak in the graph irregular Can be arranged in the form I know a solution - calculation of all edges for intersections, if the edges have to change each other one another, then rearrange the head, but too many numbers (more than 20) costly is. How does another view look to intersect the edges?

It is really easy to visualize any graph in any 3D graphics with decomposed edges.

1) Place all the vertices on any point in the 3D plane so that no three corners can be colored and no four corners are in the same plane.

2) Travers draw a line / curve to connect through adjacent matrix and corner.

In a 2D plane it is not guaranteed for the existence of a solution, for example, take the worst case scenario that it has some 10 corners and each top is connected to each other.


Comments

Popular posts from this blog

Pass DB Connection parameters to a Kettle a.k.a PDI table Input step dynamically from Excel -

multithreading - PhantomJS-Node in a for Loop -

c++ - MATLAB .m file to .mex file using Matlab Compiler -