graph - Layout's location algo apply to filtered set of Vertexes -

graph - Layout's location algo apply to filtered set of Vertexes -

the job of layout place vertexes @ given locations. if layout iterative, layout's job iterate through algo, moving vertexes each step, until final layout configuration achieved.

i have multi-level graph - 100 objects of type a; each object has 10 objects children; phone call children type b objects.

i layout location placement algos operate on objects of type (let's say) - , ignore b objects.

the cleanest way accomplish objective might define transform expose elements should participate in 'algo' placement operation via step method.

currently, step methods, assuming respect lock flag @ all, calculations including locked vertexes first - lock/unlock won't work in case.

is possible somehow without resorting multiple graph objects?

if want ignore b objects entirely, simplest alternative create graph consisting of objects, lay out, , utilize locations layout.

that said, it's not clear how intend assign locations b objects. , if objects aren't connected each other @ all, approach won't create much sense. (otoh, if aren't connected each other you're laying out bunch of trees.)

layout graph vertex jung jung2