(tdn@homer.) (Mon Dec 04 04:54 ) {P:0 H:517}
(~/wc/university/videregaaende-algoritmik/p1/besvarelse/grafer) dot -Tps  graf0.dot -o graf0.ps
ls: invalid tab size: ps
(tdn@homer.) (Mon Dec 04 04:54 ) {P:0 H:518}
(~/wc/university/videregaaende-algoritmik/p1/besvarelse/grafer) cat graf0.dot
diggraph G {
        v_1 -> v_2;
        v_2 -> v_5;
        v_3 -> v_1;
        v_3 -> v_2;
        v_3 -> v_4;
        v_4 -> v_1;
        v_4 -> v_5;
        v_5 -> v_3;
}
(tdn@homer.) (Mon Dec 04 04:54 ) {P:0 H:519}
(~/wc/university/videregaaende-algoritmik/p1/besvarelse/grafer)           
(tdn@homer.) (Mon Dec 04 04:57 ) {P:0 H:507}
(~/wc/university/videregaaende-algoritmik/p1/besvarelse/grafer) dot -Tps graf0.dot > graf0.ps
ls: invalid tab size: ps
(tdn@homer.) (Mon Dec 04 04:57 ) {P:0 H:508}
(~/wc/university/videregaaende-algoritmik/p1/besvarelse/grafer)

(tdn@homer.) (Mon Dec 04 04:57 ) {P:0 H:508}
(~/wc/university/videregaaende-algoritmik/p1/besvarelse/grafer) dot -Tps graf0.dot -ograf0.ps
ls: invalid tab size: ps
(tdn@homer.) (Mon Dec 04 04:57 ) {P:0 H:509}
(~/wc/university/videregaaende-algoritmik/p1/besvarelse/grafer)