Code review comment: Yes, it's the same format as in `dependency:tree`

Code under review:
public void visit(DependencyNode node) {
        final Dependency dep = node.getDependency();
        if(dep == null) {
            return;
        }
        if(depth != null) {
            buf.setLength(0);
            if (!depth.isEmpty()) {
                for (int i = 0; i < depth.size() - 1; ++i) {
                    if (depth.get(i)) {
                        buf.append("|  ");
                    } else {
                        buf.append("   ");
                    }
                }
                if (depth.get(depth.size() - 1)) {
                    buf.append("|- ");
                } else {
                    buf.append("\\- ");
                }
            }
            buf.append(dep.getArtifact()).append(':').append(dep.getScope());
            buildTreeConsumer.accept(buf.toString());
        }
        visitEnter(node);
        final List<DependencyNode> children = node.getChildren();
        if(!children.isEmpty()) {
            final int childrenTotal = children.size();
            if(childrenTotal == 1) {
                if(depth != null) {
                    depth.add(false);
                }
                visit(children.get(0));
            } else {
                if(depth != null) {
                    depth.add(true);
                }
                int i = 0;
                while(true) {
                    visit(children.get(i++));
                    if(i < childrenTotal - 1) {
                        continue;
                    } else if(i == childrenTotal) {
                        break;
                    } else if(depth != null) {
                        depth.set(depth.size() - 1, false);
                    }
                }
            }
            if(depth != null) {
                depth.remove(depth.size() - 1);
            }
        }
        visitLeave(node);
    }

Line commented on: visitEnter(node);

Revised code:
public void visit(DependencyNode node) {
        final Dependency dep = node.getDependency();
        if(dep == null) {
            return;
        }
        if(depth != null) {
            buf.setLength(0);
            if (!depth.isEmpty()) {
                for (int i = 0; i < depth.size() - 1; ++i) {
                    if (depth.get(i)) {
                        
                        buf.append('\u2502').append("  ");
                    } else {
                        buf.append("   ");
                    }
                }
                if (depth.get(depth.size() - 1)) {
                    
                    buf.append('\u251c').append('\u2500').append(' ');
                } else {
                    
                    buf.append('\u2514').append('\u2500').append(' ');
                }
            }
            buf.append(dep.getArtifact()).append(':').append(dep.getScope());
            buildTreeConsumer.accept(buf.toString());
        }
        visitEnter(node);
        final List<DependencyNode> children = node.getChildren();
        if(!children.isEmpty()) {
            final int childrenTotal = children.size();
            if(childrenTotal == 1) {
                if(depth != null) {
                    depth.add(false);
                }
                visit(children.get(0));
            } else {
                if(depth != null) {
                    depth.add(true);
                }
                int i = 0;
                while(true) {
                    visit(children.get(i++));
                    if(i < childrenTotal - 1) {
                        continue;
                    } else if(i == childrenTotal) {
                        break;
                    } else if(depth != null) {
                        depth.set(depth.size() - 1, false);
                    }
                }
            }
            if(depth != null) {
                depth.remove(depth.size() - 1);
            }
        }
        visitLeave(node);
    }