1

I need a software, which will allow me to convert a table with tree-like dependences between objects to a picture.

For example table like this:

object dependsOn
B      A
C      A
D      B
E      B
F      G

Should be converted to a trees like this:

A - B - D
  \   \ 
    C  E
G - F

The table contains about 500 rows.

I would prefer online site, or mac software.

  • If that can be simply translated to pairs like B -> A, that looks like a perfect case for Graphviz (see my answer here). – Izzy Mar 6 '15 at 13:00
2

This is a very specific request and I think that it is unlikely that you will find some s/w that does that, just as you want it, without any effort on your part.

Therefor, I will offer as suggestion that requires you to put in a little work.

Probably the single most widely used tool for visualizing data is GraphViz.

It lets you generate a diagram like this enter image description here from descriptive text like this

digraph G {

    subgraph cluster_0 {
        style=filled;
        color=lightgrey;
        node [style=filled,color=white];
        a0 -> a1 -> a2 -> a3;
        label = "process #1";
    }

    subgraph cluster_1 {
        node [style=filled];
        b0 -> b1 -> b2 -> b3;
        label = "process #2";
        color=blue
    }
    start -> a0;
    start -> b0;
    a1 -> b3;
    b2 -> a3;
    a3 -> a0;
    a3 -> end;
    b3 -> end;

    start [shape=Mdiamond];
    end [shape=Msquare];
}

It can be extremely more powerful than that, but I chose the simplest example in the gallery.

What I am getting is that with a few global edits, you could quickly manually create the necessary input.

And, if you are a programmer, it would be extremely simple to automate the process.

Sorry that it's not an exact match, but its what I always use when face with this sort of thing. HTH

| improve this answer | |

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.