Debian Codegraph @

doc/man/botch-graph-ancestors.pod

raw
1 =head1 NAME
2
3 botch-graph-ancestors - find all ancestors of a vertex in a graph in GraphML or dot format
4
5 =head1 SYNOPSIS
6
7 =over
8
9 =item B<botch-graph-ancestors> [options] --target I<TARGET> [--target I<TARGET> ...] [I<ingraph>] [I<outgraph>]
10
11 =back
12
13 =head1 DESCRIPTION
14
15 Extract the subgraph of all ancestors of a specific node in the input graph.
16
17 The B<--target> option is mandatory and can be specified more than once.
18
19 If either (or both) of the positional arguments is/are omitted, then read
20 GraphML or dot from standard input and/or write GraphML or dot to standard
21 output, respectively. Passing a '-' as either argument, explicitly specifies
22 to read the input from standard input and write the output to standard output,
23 respectively.
24
25 The input graph type will be determined automatically. If the output graph is
26 given as a filename, then the output type will be GraphML if the filename ends
27 with .xml and dot if the filename ends with .dot. If the output is done on
28 standard output then it will happen in the same format as the input graph.
29
30 =head1 OPTIONS
31
32 =over 4
33
34 =item B<-h, --help>
35
36 Display help.
37
38 =item B<--target=>I<TARGET>
39
40 This option picks the target vertex of which the ancestors are computed. The
41 TARGET argument is a key/value pair (separated by a colon) of a graph attribute
42 and its desired value. If more than one vertex matches the given key/value
43 pair, then the smallest (by node comparison) is chosen.
44
45 The special key C<__ID__> allows one to select the unique vertex identifier.
46
47 This option can be specified more than once. The final set of vertices is
48 chosen such that all vertices match all key/value pairs. Multiple B<--target>
49 options thus form a logical conjunction (they are AND-ed together).
50
51 =item B<-v, --verbose>
52
53 Be verbose.
54
55 =back
56
57 =head1 EXAMPLE
58
59 Extract the subgraph of all ancestors of a binary packages vertex with name
60 "build-essential" and version "11.7".
61
62 botch-graph-ancestors --target name:build-essential --target version:11.7 --target type:bin < in.xml > out.xml
63
64 or giving input and output as positional arguments:
65
66 botch-graph-ancestors --target name:build-essential --target version:11.7 --target type:bin in.xml out.xml
67
68 Find all source packages that build depend on C<texlive-binaries:amd64 (=2015.20150524.37493-5)>.
69
70 Using package selection and reverse dependency cone computation by ceve:
71
72 dose-ceve -r "texlive-binaries:amd64 (= 2015.20150524.37493-5)" --deb-native-arch=amd64 -G pkg -T grml deb://Packages debsrc://Sources \
73 | botch-graph-sources - - \
74 | botch-graph2text - "{realpackage} (= {realversion})" --vertex type:src \
75 | sort
76
77 Using package selection and ancestor vertex computation by botch:
78
79 dose-ceve --deb-native-arch=amd64 -G pkg -T grml deb://Packages debsrc://Sources \
80 | botch-graph-ancestors --target realpackage:texlive-binaries:amd64 --target realversion:2015.20150524.37493-5 - - \
81 | botch-graph-sources - - \
82 | botch-graph2text - "{realpackage} (= {realversion})" --vertex type:src \
83 | sort
84
85 =head1 BUGS
86
87 See L<http://bugs.debian.org/botch>.
88
89 =head1 SEE ALSO
90
91 Debian doc-base Manual F</usr/share/doc/botch/wiki/Home.html>
92
93 =head1 AUTHOR
94
95 This man page was written by Johannes Schauer. Botch is written by Johannes
96 Schauer and Pietro Abate.
97
98 =head1 COPYRIGHT
99
100 Copyright 2012-2014 Johannes Schauer, Pietro Abate
101
102 This program is free software: you can redistribute it and/or modify it under
103 the terms of the GNU Lesser General Public License as published by the Free
104 Software Foundation, either version 3 of the License, or (at your option) any
105 later version. A special linking exception to the GNU Lesser General Public
106 License applies to this library, see the COPYING file for more information.
107