1 package org.apache.maven.plugin.dependency.treeSerializers;
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22 import org.apache.maven.shared.dependency.graph.DependencyNode;
23 import org.apache.maven.shared.dependency.graph.traversal.DependencyNodeVisitor;
24
25 import java.io.Writer;
26 import java.util.List;
27
28
29
30
31
32
33
34
35 public class DOTDependencyNodeVisitor
36 extends AbstractSerializingVisitor
37 implements DependencyNodeVisitor
38 {
39
40
41
42
43
44
45 public DOTDependencyNodeVisitor( Writer writer )
46 {
47 super( writer );
48 }
49
50
51
52
53
54 public boolean visit( DependencyNode node )
55 {
56 if ( node.getParent() == null || node.getParent() == node )
57 {
58 writer.write( "digraph \"" + node.toNodeString() + "\" { \n" );
59 }
60
61
62
63 List<DependencyNode> children = node.getChildren();
64
65 for ( DependencyNode child : children )
66 {
67 StringBuffer sb = new StringBuffer();
68 sb.append( "\t\"" );
69 sb.append( node.toNodeString() );
70 sb.append( "\" -> \"" );
71 sb.append( child.toNodeString() );
72 sb.append( "\" ; " );
73 writer.println( sb.toString() );
74 }
75
76 return true;
77 }
78
79
80
81
82 public boolean endVisit( DependencyNode node )
83 {
84 if ( node.getParent() == null || node.getParent() == node )
85 {
86 writer.write( " } " );
87 }
88 return true;
89 }
90
91 }