java - Looking for the right algorithm -

If I have a set of nodes such as other nodes with ids and pointers:

  1 - & gt; 2 2 - & gt; 4 2 - & gt; 3 3 - & gt; 4-5 - & gt; 1 ...  

How can I show this article in 2 dimensions (on the x-y plane)? Is there any way to present 1D issue in 2D? I'm looking for someone to point me out an algorithm which I can use.

Thanks in advance.

see

then you can use the point in the polygon return value and You can pull the connection you want.