Google Answers Logo
View Question
Q: Network Diagram Rendering Algorithm ( No Answer,   0 Comments )
Subject: Network Diagram Rendering Algorithm
Category: Computers > Algorithms
Asked by: gryphon5-ga
List Price: $10.00
Posted: 07 Sep 2006 07:47 PDT
Expires: 07 Oct 2006 07:47 PDT
Question ID: 763016
I am looking for an algorithm to render network nodes and their
connections into a diagram with the fewest number of "overlapping"
connections. The algorithm would need to position the nodes and their
connections given an array of node connections (this could be
presented to the algorithm by whichever means necessary). The
resulting diagram should be easy for humans to interpret (ie. all
nodes evenly placed apart and the map somewhat centered). I am sure
there are some examples on the expansive world wide web somewhere, but
my google searches have come up with nothing so far.

A coded example would be nice, but not essential.
There is no answer at this time.

There are no comments at this time.

Important Disclaimer: Answers and comments provided on Google Answers are general information, and are not intended to substitute for informed professional medical, psychiatric, psychological, tax, legal, investment, accounting, or other professional advice. Google does not endorse, and expressly disclaims liability for any product, manufacturer, distributor, service or service provider mentioned or any opinion expressed in answers or comments. Please read carefully the Google Answers Terms of Service.

If you feel that you have found inappropriate content, please let us know by emailing us at with the question ID listed above. Thank you.
Search Google Answers for
Google Answers  

Google Home - Answers FAQ - Terms of Service - Privacy Policy