Folyamatábra tervezéshez szoftvert keresek

Iroda

Sziasztok!

Nagyon egyszerű, de gyakran bővülő folyamatábrák tervezéséhez keresek Linuxos szoftvert.
Szempontok:
- Egyszerű legyen
- Ne nekem kelljen rajzolni, nem rajzprogramot keresek
- Tudjon nyomtatni akár sok lapra szétterítve is, vagy csak egy részét az ábrának

  • 2523 megtekintés

( gelei v | 2015. 08. 19., sze – 15:35 )

Visio, Adonis

Bocs, write only voltam

( Gregor | 2015. 08. 19., sze – 16:50 )

Én legutóbb a LibreOffice Draw-t használtam. Bár az ábra nem volt valami nagy, csak egy oldal.

( bzs v | 2015. 08. 19., sze – 18:46 )

Regebben hasznaltam ezt ha jol emlexem.

prune(1) General Commands Manual prune(1)

NAME
prune - Prune directed graphs

SYNOPSIS
prune [ -n node ] [ -N attrspec ] [ files ... ]

DESCRIPTION
prune reads directed graphs in the same format used by dot(1) and removes subgraphs rooted at nodes
specified on the command line via options. These nodes themselves will not be removed, but can be given
attributes so that they can be easily located by a graph stream editor such as gvpr(1). prune correctly
handles cycles, loops and multi‐edges.

Both options can appear multiple times on the command line. All subgraphs rooted at the respective nodes
given will then be processed. If a node does not exist, prune will skip it and print a warning message
to stderr. If multiple attributes are given, they will be applied to all nodes that have been pro‐
cessed. prune writes the result to the stdout.

OPTIONS
-n name
Specifies name of node to prune.

-N attrspec
Specifies attribute that will be set (or changed if it exists) for any pruned node. attrspec is
a string of the form attr=value.

EXAMPLES
An input graph test.dot of the form

digraph DG {
A -> B;
A -> C;

B -> D;
B -> E;
}

, processed by the command

prune -n B test.dot

would produce the following output (the actual code might be formatted in a slightly different way).

digraph DG {
A -> B;
A -> C;
}

Another input graph test.dot of the form

digraph DG {
A -> B;
A -> C;

B -> D;
B -> E;

C -> E;
}

(note the additional edge from C to E ), processed by the command

prune -n B -N color=red test.dot

results in

digraph DG {
B [=red];
A -> B;
A -> C;
A -> C;
C -> E;
}

Node E has not been removed since its second parent C is not being pruned.

EXIT STATUS
prune returns 0 on successful completion. It returns 1 if an error occurs.

SEE ALSO
dot(1), gvpr(1)

AUTHOR
Marcus Harnisch

prune(1)

Ugy emlekszem exportaltam a keletkezett folyamatabrat pixeles kepbe, szoval nem te rajzolod oket.

---
--- A gond akkor van, ha látszólag minden működik. ---
---