source: general/genutils/graphviz.xml@ 6732c094

10.0 10.1 11.0 11.1 11.2 11.3 12.0 12.1 6.3 6.3-rc1 6.3-rc2 6.3-rc3 7.10 7.4 7.5 7.6 7.6-blfs 7.6-systemd 7.7 7.8 7.9 8.0 8.1 8.2 8.3 8.4 9.0 9.1 basic bdubbs/svn elogind gnome kde5-13430 kde5-14269 kde5-14686 kea ken/TL2024 ken/inkscape-core-mods ken/tuningfonts krejzi/svn lazarus lxqt nosym perl-modules plabs/newcss plabs/python-mods python3.11 qt5new rahul/power-profiles-daemon renodr/vulkan-addition systemd-11177 systemd-13485 trunk upgradedb xry111/intltool xry111/llvm18 xry111/soup3 xry111/test-20220226 xry111/xf86-video-removal
Last change on this file since 6732c094 was 6732c094, checked in by Randy McMurchy <randy@…>, 17 years ago

Updated all the XML files (and the one stylesheet) to use the 4.5 version of DocBook XML DTD

git-svn-id: svn://svn.linuxfromscratch.org/BLFS/trunk/BOOK@6716 af4574ff-66df-0310-9fd7-8a98e5e911e0
  • Property mode set to 100644
File size: 24.3 KB
Line 
1<?xml version="1.0" encoding="ISO-8859-1"?>
2<!DOCTYPE sect1 PUBLIC "-//OASIS//DTD DocBook XML V4.5//EN"
3 "http://www.oasis-open.org/docbook/xml/4.5/docbookx.dtd" [
4 <!ENTITY % general-entities SYSTEM "../../general.ent">
5 %general-entities;
6
7 <!ENTITY graphviz-download-http "http://www.graphviz.org/pub/graphviz/ARCHIVE/graphviz-&graphviz-version;.tar.gz">
8 <!ENTITY graphviz-download-ftp " ">
9 <!ENTITY graphviz-md5sum "ca921b4a9bcd86da4a1092bb17a57d83">
10 <!ENTITY graphviz-size "4.2 MB">
11 <!ENTITY graphviz-buildsize "124 MB">
12 <!ENTITY graphviz-time "2.1 SBU">
13]>
14
15<sect1 id="graphviz" xreflabel="Graphviz-&graphviz-version;">
16 <?dbhtml filename="graphviz.html"?>
17
18 <sect1info>
19 <othername>$LastChangedBy$</othername>
20 <date>$Date$</date>
21 </sect1info>
22
23 <title>Graphviz-&graphviz-version;</title>
24
25 <indexterm zone="graphviz">
26 <primary sortas="a-Graphviz">Graphviz</primary>
27 </indexterm>
28
29 <sect2 role="package">
30 <title>Introduction to Graphviz</title>
31
32 <para>The <application>Graphviz</application> package contains graph
33 visualization software. Graph visualization is a way of representing
34 structural information as diagrams of abstract graphs and networks.
35 <application>Graphviz</application> has several main graph layout
36 programs. It also has web and interactive graphical interfaces, auxiliary
37 tools, libraries, and language bindings.</para>
38
39 <para>The <application>Graphviz</application> layout programs take
40 descriptions of graphs in a simple text language, and creates diagrams in
41 several useful formats such as images and SVG for web pages, Postscript for
42 inclusion in PDF or other documents, or as objects displayed in an
43 interactive graph browser. (Graphviz also supports GXL, an XML dialect.) In
44 practice, graphs are usually generated from external data sources, but they
45 can also be created and edited manually, either as raw text files or within
46 a graphical editor. (Graphviz was not intended to be a
47 <application>Visio</application> replacement, so it would probably be
48 frustrating to try to use it that way.)</para>
49
50 <para>This package is useful for automatic graph drawing which has many
51 important applications in software engineering, database and web design,
52 networking, and in visual interfaces for many other domains. Graphviz has
53 many useful features for concrete diagrams, such as options for colors,
54 fonts, tabular node layouts, line styles, hyperlinks, and custom
55 shapes.</para>
56
57 <bridgehead renderas="sect3">Package Information</bridgehead>
58 <itemizedlist spacing="compact">
59 <listitem>
60 <para>Download (HTTP): <ulink url="&graphviz-download-http;"/></para>
61 </listitem>
62 <listitem>
63 <para>Download (FTP): <ulink url="&graphviz-download-ftp;"/></para>
64 </listitem>
65 <listitem>
66 <para>Download MD5 sum: &graphviz-md5sum;</para>
67 </listitem>
68 <listitem>
69 <para>Download size: &graphviz-size;</para>
70 </listitem>
71 <listitem>
72 <para>Estimated disk space required: &graphviz-buildsize;</para>
73 </listitem>
74 <listitem>
75 <para>Estimated build time: &graphviz-time;</para>
76 </listitem>
77 </itemizedlist>
78
79 <bridgehead renderas="sect3">Graphviz Dependencies</bridgehead>
80
81 <bridgehead renderas="sect4">Optional</bridgehead>
82 <para role="optional"><xref linkend="x-window-system"/>,
83 <xref linkend="pkgconfig"/>,
84 <xref linkend="expat"/>,
85 <xref linkend="libpng"/>,
86 <xref linkend="libjpeg"/>,
87 <xref linkend="freetype2"/>,
88 <xref linkend="fontconfig"/>,
89 <xref linkend="tcl"/>,
90 <xref linkend="tk"/>, and
91 <ulink url="http://www.perens.com/FreeSoftware/ElectricFence/">Electric Fence</ulink>
92 <!-- Commenting this out for now until an updated version of the
93 GD library becomes available. Graphviz uses its internal copy for now
94 <ulink url="http://www.boutell.com/gd/">GD Library</ulink>, --></para>
95
96 <bridgehead renderas="sect4">Optional
97 (to Build Language Bindings)</bridgehead>
98 <para role="optional"><ulink url="http://www.swig.org/">SWIG</ulink>
99 (<application>SWIG</application> must be installed or no bindings will be
100 built),
101 <xref linkend="guile"/>,
102 <xref linkend="jdk"/>,
103 <xref linkend="php"/>,
104 <xref linkend="python"/>,
105 <xref linkend="ruby"/>,
106 <xref linkend="tcl"/>,
107 C# (<ulink url="http://www.southern-storm.com.au/portable_net.html">DotGNU Portable.NET</ulink>
108 or <ulink url="http://www.mono-project.com/Main_Page">Mono</ulink>),
109 <ulink url="http://www.iolanguage.com/about/">Io</ulink>,
110 <ulink url="http://www.lua.org/">Lua</ulink>, and
111 <ulink url="http://caml.inria.fr/ocaml/index.en.html">Objective Caml</ulink></para>
112
113 <para condition="html" role="usernotes">User Notes:
114 <ulink url="&blfs-wiki;/graphviz"/></para>
115
116 </sect2>
117
118 <sect2 role="installation">
119 <title>Installation of Graphviz</title>
120
121 <para>Install <application>Graphviz</application> by running the following
122 commands:</para>
123
124<screen><userinput>sed -i 's|JAVA_LIBS=|&amp; \
125if test -n "$JAVA_HOME"; then \
126 CPPFLAGS="$CPPFLAGS -I$JAVA_HOME/include -I$JAVA_HOME/include/linux" \
127fi|' configure &amp;&amp;
128./configure --prefix=/usr &amp;&amp;
129make</userinput></screen>
130
131 <para>This package does not come with a test suite that provides
132 meaningful results.</para>
133
134 <para>Now, as the <systemitem class="username">root</systemitem> user:</para>
135
136<screen role="root"><userinput>make install</userinput></screen>
137
138 <para>If desired, create a symbolic link in the system documents directory
139 to the documentation installed in
140 <filename class='directory'>/usr/share/graphviz/doc</filename> using the
141 following command as the <systemitem class="username">root</systemitem>
142 user:</para>
143
144<screen role="root"><userinput>ln -v -s /usr/share/graphviz/doc \
145 /usr/share/doc/graphviz-&graphviz-version;</userinput></screen>
146
147 </sect2>
148
149 <sect2 role="configuration">
150 <title>Configuring Graphviz</title>
151
152 <sect3 id="graphviz-config">
153 <title>Config Files</title>
154 <para><filename>/usr/lib/graphviz/config</filename></para>
155
156 <indexterm zone="graphviz graphviz-config">
157 <primary sortas="e-usr-share-graphviz-config">/usr/share/graphviz/config</primary>
158 </indexterm>
159
160 </sect3>
161
162 <sect3><title>Configuration Information</title>
163
164 <para>There are no specific configuration requirements for
165 <application>Graphviz</application>. You may consider installing the
166 additional plugins and tools available from the download page at
167 <ulink url="http://www.graphviz.org/Download_source.php"/> for additional
168 capabilities. If additional plugins are installed, you can run
169 <command>dot_static -c</command> (as the
170 <systemitem class="username">root</systemitem> user) to update the
171 <filename>config</filename> file in
172 <filename class='directory'>/usr/lib/graphviz</filename>.</para>
173
174 </sect3>
175
176 </sect2>
177
178 <sect2 role="content">
179 <title>Contents</title>
180
181 <segmentedlist>
182 <segtitle>Installed Programs</segtitle>
183 <segtitle>Installed Libraries</segtitle>
184 <segtitle>Installed Directories</segtitle>
185
186 <seglistitem>
187 <seg>acyclic, bcomps, ccomps, circo, dijkstra, dot, dot2gxl,
188 dot_static, dotty, fdp, gc, gvcolor, gvpack, gvpr, gxl2dot, lefty,
189 lneato, nop, prune, sccmap, tred, twopi and unflatten</seg>
190 <seg>libagraph.{so,a}, libcdt.{so,a}, libexpr.{so,a}, libgraph.{so,a},
191 libpack.{so,a}, libpathplan.{so,a}, additional support libraries
192 and language bindings</seg>
193 <seg>/usr/include/graphviz, /usr/lib/graphviz and
194 /usr/share/graphviz</seg>
195 </seglistitem>
196 </segmentedlist>
197
198 <variablelist>
199 <bridgehead renderas="sect3">Short Descriptions</bridgehead>
200 <?dbfo list-presentation="list"?>
201 <?dbhtml list-presentation="table"?>
202
203 <varlistentry id="acyclic">
204 <term><command>acyclic</command></term>
205 <listitem>
206 <para>is a filter that takes a directed graph as input and outputs a
207 copy of the graph with sufficient edges reversed to make the graph
208 acyclic. The reversed edge inherits all of the attributes of the
209 original edge.</para>
210 <indexterm zone="graphviz acyclic">
211 <primary sortas="b-acyclic">acyclic</primary>
212 </indexterm>
213 </listitem>
214 </varlistentry>
215
216 <varlistentry id="bcomps">
217 <term><command>bcomps</command></term>
218 <listitem>
219 <para>decomposes graphs into their biconnected components, printing
220 the components to standard output.</para>
221 <indexterm zone="graphviz bcomps">
222 <primary sortas="b-bcomps">bcomps</primary>
223 </indexterm>
224 </listitem>
225 </varlistentry>
226
227 <varlistentry id="ccomps">
228 <term><command>ccomps</command></term>
229 <listitem>
230 <para>decomposes graphs into their connected components, printing the
231 components to standard output.</para>
232 <indexterm zone="graphviz ccomps">
233 <primary sortas="b-ccomps">ccomps</primary>
234 </indexterm>
235 </listitem>
236 </varlistentry>
237
238 <varlistentry id="circo">
239 <term><command>circo</command></term>
240 <listitem>
241 <para>draws graphs using a circular layout. The tool identifies
242 biconnected components and draws the nodes of the component on a
243 circle. The block-cutpoint tree is then laid out using a recursive
244 radial algorithm. Edge crossings within a circle are minimized by
245 placing as many edges on the circle's perimeter as possible. In
246 particular, if the component is outerplanar, the component will have
247 a planar layout.</para>
248 <indexterm zone="graphviz circo">
249 <primary sortas="b-circo">circo</primary>
250 </indexterm>
251 </listitem>
252 </varlistentry>
253
254 <varlistentry id="dijkstra">
255 <term><command>dijkstra</command></term>
256 <listitem>
257 <para>reads a stream of graphs and for each computes the distance of
258 every node from sourcenode.</para>
259 <indexterm zone="graphviz dijkstra">
260 <primary sortas="b-dijkstra">dijkstra</primary>
261 </indexterm>
262 </listitem>
263 </varlistentry>
264
265 <varlistentry id="dot">
266 <term><command>dot</command></term>
267 <listitem>
268 <para>draws directed graphs. It works well on DAGs and other graphs
269 that can be drawn as hierarchies. It reads attributed graph files and
270 writes drawings. By default, the output format dot is the input file
271 with layout coordinates appended.</para>
272 <indexterm zone="graphviz dot">
273 <primary sortas="b-dot">dot</primary>
274 </indexterm>
275 </listitem>
276 </varlistentry>
277
278 <varlistentry id="dot2gxl">
279 <term><command>dot2gxl</command></term>
280 <listitem>
281 <para>converts between graphs represented in GXL and in the DOT
282 language. Unless a conversion type is specified using a flag,
283 <command>gxl2dot</command> will deduce the type of conversion from
284 the suffix of the input file, a
285 <filename class='extension'>.dot</filename> suffix causing a
286 conversion from DOT to GXL, and a
287 <filename class='extension'>.gxl</filename> suffix causing a
288 conversion from GXL to DOT.</para>
289 <indexterm zone="graphviz dot2gxl">
290 <primary sortas="b-dot2gxl">dot2gxl</primary>
291 </indexterm>
292 </listitem>
293 </varlistentry>
294
295 <varlistentry id="dot_static">
296 <term><command>dot_static</command></term>
297 <listitem>
298 <para>is a version of <command>dot</command>that has all the
299 <application>Graphviz</application> libraries compiled
300 statically.</para>
301 <indexterm zone="graphviz dot_static">
302 <primary sortas="b-dot_static">dot_static</primary>
303 </indexterm>
304 </listitem>
305 </varlistentry>
306
307 <varlistentry id="dotty">
308 <term><command>dotty</command></term>
309 <listitem>
310 <para>is a graph editor for the X Window System. It may be run as a
311 standalone editor, or as a front end for applications that use
312 graphs. It can control multiple windows viewing different
313 graphs.</para>
314 <indexterm zone="graphviz dotty">
315 <primary sortas="b-dotty">dotty</primary>
316 </indexterm>
317 </listitem>
318 </varlistentry>
319
320 <varlistentry id="fdp">
321 <term><command>fdp</command></term>
322 <listitem>
323 <para>draws undirected graphs using a <quote>spring</quote> model. It
324 relies on a force-directed approach in the spirit of Fruchterman and
325 Reingold.</para>
326 <indexterm zone="graphviz fdp">
327 <primary sortas="b-fdp">fdp</primary>
328 </indexterm>
329 </listitem>
330 </varlistentry>
331
332 <varlistentry id="gc-graphviz">
333 <term><command>gc</command></term>
334 <listitem>
335 <para>is a graph analogue to <command>wc</command> in that it prints
336 to standard output the number of nodes, edges, connected components
337 or clusters contained in the input files. It also prints a total
338 count for all graphs if more than one graph is given.</para>
339 <indexterm zone="graphviz gc-graphviz">
340 <primary sortas="b-gc">gc</primary>
341 </indexterm>
342 </listitem>
343 </varlistentry>
344
345 <varlistentry id="gvcolor">
346 <term><command>gvcolor</command></term>
347 <listitem>
348 <para>is a filter that sets node colors from initial seed values.
349 Colors flow along edges from tail to head, and are averaged (as HSB
350 vectors) at nodes. The graph must already have been processed by
351 <command>dot</command>.</para>
352 <indexterm zone="graphviz gvcolor">
353 <primary sortas="b-gvcolor">gvcolor</primary>
354 </indexterm>
355 </listitem>
356 </varlistentry>
357
358 <varlistentry id="gvpack">
359 <term><command>gvpack</command></term>
360 <listitem>
361 <para>reads in a stream of graphs, combines the graphs into a single
362 layout, and produces a single graph serving as the union of the input
363 graphs. The input graphs must be in <command>dot</command> format, and
364 must have all necessary layout information.</para>
365 <indexterm zone="graphviz gvpack">
366 <primary sortas="b-gvpack">gvpack</primary>
367 </indexterm>
368 </listitem>
369 </varlistentry>
370
371 <varlistentry id="gvpr">
372 <term><command>gvpr</command></term>
373 <listitem>
374 <para>is a graph stream editor inspired by <command>awk</command>. It
375 copies input graphs to its output, possibly transforming their
376 structure and attributes, creating new graphs, or printing arbitrary
377 information.</para>
378 <indexterm zone="graphviz gvpr">
379 <primary sortas="b-gvpr">gvpr</primary>
380 </indexterm>
381 </listitem>
382 </varlistentry>
383
384 <varlistentry id="gxl2dot">
385 <term><command>gxl2dot</command></term>
386 <listitem>
387 <para>converts between graphs represented in GXL and in the DOT
388 language. Unless a conversion type is specified using a flag,
389 <command>gxl2dot</command> will deduce the type of conversion from
390 the suffix of the input file, a
391 <filename class='extension'>.dot</filename> suffix causing a
392 conversion from DOT to GXL, and a
393 <filename class='extension'>.gxl</filename> suffix causing a
394 conversion from GXL to DOT.</para>
395 <indexterm zone="graphviz gxl2dot">
396 <primary sortas="b-gxl2dot">gxl2dot</primary>
397 </indexterm>
398 </listitem>
399 </varlistentry>
400
401 <varlistentry id="lefty">
402 <term><command>lefty</command></term>
403 <listitem>
404 <para>is a two-view graphics editor for technical pictures.</para>
405 <indexterm zone="graphviz lefty">
406 <primary sortas="b-lefty">lefty</primary>
407 </indexterm>
408 </listitem>
409 </varlistentry>
410
411 <varlistentry id="lneato">
412 <term><command>lneato</command></term>
413 <listitem>
414 <para>is a graph editor for the X Window System. It may be run as a
415 standalone editor, or as a front end for applications that use
416 graphs. It can control multiple windows viewing different
417 graphs.</para>
418 <indexterm zone="graphviz lneato">
419 <primary sortas="b-lneato">lneato</primary>
420 </indexterm>
421 </listitem>
422 </varlistentry>
423
424 <varlistentry id="nop">
425 <term><command>nop</command></term>
426 <listitem>
427 <para>reads a stream of graphs and prints each in pretty-printed
428 (canonical) format on stdout. If no files are given, it reads from
429 stdin.</para>
430 <indexterm zone="graphviz nop">
431 <primary sortas="b-nop">nop</primary>
432 </indexterm>
433 </listitem>
434 </varlistentry>
435
436 <varlistentry id="prune">
437 <term><command>prune</command></term>
438 <listitem>
439 <para>reads directed graphs in the same format used by
440 <command>dot</command> and removes subgraphs rooted at nodes
441 specified on the command line via options. These nodes themselves
442 will not be removed, but can be given attributes so that they can be
443 easily located by a graph stream editor such as
444 <command>gpr</command>. <command>prune</command> correctly handles
445 cycles, loops and multi-edges.</para>
446 <indexterm zone="graphviz prune">
447 <primary sortas="b-prune">prune</primary>
448 </indexterm>
449 </listitem>
450 </varlistentry>
451
452 <varlistentry id="sccmap">
453 <term><command>sccmap</command></term>
454 <listitem>
455 <para>decomposes digraphs into strongly connected components and an
456 auxiliary map of the relationship between components. In this map,
457 each component is collapsed into a node. The resulting graphs are
458 printed to standard out. The number of nodes, edges and strongly
459 connected components are printed to standard error.
460 <command>sccmap</command> is a way of partitioning large graphs into
461 more manageable pieces.</para>
462 <indexterm zone="graphviz sccmap">
463 <primary sortas="b-sccmap">sccmap</primary>
464 </indexterm>
465 </listitem>
466 </varlistentry>
467
468 <varlistentry id="tred">
469 <term><command>tred</command></term>
470 <listitem>
471 <para>computes the transitive reduction of directed graphs, and
472 prints the resulting graphs to standard output. This removes edges
473 implied by transitivity. Nodes and subgraphs are not otherwise
474 affected. The <quote>meaning</quote> and validity of the reduced
475 graphs is application dependent. <command>tred</command> is
476 particularly useful as a preprocessor to <command>dot</command> to
477 reduce clutter in dense layouts.</para>
478 <indexterm zone="graphviz tred">
479 <primary sortas="b-tred">tred</primary>
480 </indexterm>
481 </listitem>
482 </varlistentry>
483
484 <varlistentry id="twopi">
485 <term><command>twopi</command></term>
486 <listitem>
487 <para>draws graphs using a radial layout. Basically, one node is
488 chosen as the center and put at the origin. The remaining nodes are
489 placed on a sequence of concentric circles centered about the origin,
490 each a fixed radial distance from the previous circle.</para>
491 <indexterm zone="graphviz twopi">
492 <primary sortas="b-twopi">twopk</primary>
493 </indexterm>
494 </listitem>
495 </varlistentry>
496
497 <varlistentry id="unflatten">
498 <term><command>unflatten</command></term>
499 <listitem>
500 <para>is a preprocessor to <command>dot</command> that is used to
501 improve the aspect ratio of graphs having many leaves or disconnected
502 nodes. The usual layout for such a graph is generally very wide or
503 tall. <command>unflatten</command> inserts invisible edges or adjusts
504 the minlen on edges to improve layout compaction.</para>
505 <indexterm zone="graphviz unflatten">
506 <primary sortas="b-unflatten">unflatten</primary>
507 </indexterm>
508 </listitem>
509 </varlistentry>
510
511 <varlistentry id="libagraph">
512 <term><filename class='libraryfile'>libagraph.{so,a}</filename></term>
513 <listitem>
514 <para>supports graph programming by maintaining graphs in memory and
515 reading and writing graph files. Graphs, nodes and edges may be
516 attributed with programmer-defined records and string name-value
517 pairs. Graphs are composed of nodes, edges, and nested subgraphs.
518 Internally, <filename class='libraryfile'>libagraph</filename>
519 depends extensively on
520 <filename class='libraryfile'>libcdt</filename> (formerly
521 <filename class='libraryfile'>libdict</filename>) for set
522 representation.</para>
523 <indexterm zone="graphviz libagraph">
524 <primary sortas="c-libagraph">libagraph.{so,a}</primary>
525 </indexterm>
526 </listitem>
527 </varlistentry>
528
529 <varlistentry id="libcdt">
530 <term><filename class='libraryfile'>libcdt.{so,a}</filename></term>
531 <listitem>
532 <para>manages run-time dictionaries using standard container data
533 types: unordered set/multiset, ordered set/multiset, list, stack,
534 and queue.</para>
535 <indexterm zone="graphviz libcdt">
536 <primary sortas="c-libcdt">libcdt.{so,a}</primary>
537 </indexterm>
538 </listitem>
539 </varlistentry>
540
541 <varlistentry id="libexpr">
542 <term><filename class='libraryfile'>libexpr.{so,a}</filename></term>
543 <listitem>
544 <para>is a C-like expression library.</para>
545 <indexterm zone="graphviz libexpr">
546 <primary sortas="c-libexpr">libexpr.{so,a}</primary>
547 </indexterm>
548 </listitem>
549 </varlistentry>
550
551 <varlistentry id="libgraph">
552 <term><filename class='libraryfile'>libgraph.{so,a}</filename></term>
553 <listitem>
554 <para>maintains directed and undirected attributed graphs in memory
555 and reads and writes graph files. Graphs are composed of nodes,
556 edges, and nested subgraphs. A subgraph may contain any nodes and
557 edges of its parents, and may be passed to any
558 <filename class='libraryfile'>libgraph</filename> function taking a
559 graph pointer, except the three that create new attributes (where a
560 main graph is required).</para>
561 <indexterm zone="graphviz libgraph">
562 <primary sortas="c-libgraph">libgraph.{so,a}</primary>
563 </indexterm>
564 </listitem>
565 </varlistentry>
566
567 <varlistentry id="libpack">
568 <term><filename class='libraryfile'>libpack.{so,a}</filename></term>
569 <listitem>
570 <para>supports the use of connected components in the context of
571 laying out graphs using other <application>Graphviz</application>
572 libraries. One set of functions can be used to take a single graph
573 and break it apart into connected components. A complementary set of
574 functions takes a collection of graphs (not necessarily components of
575 a single graph) which have been laid out separately, and packs them
576 together moderately tightly. The packing is done using the polyomino
577 algorithm of K. Freivalds et al.</para>
578 <indexterm zone="graphviz libpack">
579 <primary sortas="c-libpack">libpack.{so,a}</primary>
580 </indexterm>
581 </listitem>
582 </varlistentry>
583
584 <varlistentry id="libpathplan">
585 <term><filename class='libraryfile'>libpathplan.{so,a}</filename></term>
586 <listitem>
587 <para>contains functions to find the shortest path between two points
588 in a simple polygon.</para>
589 <indexterm zone="graphviz libpathplan">
590 <primary sortas="c-libpathplan">libpathplan.{so,a}</primary>
591 </indexterm>
592 </listitem>
593 </varlistentry>
594
595 </variablelist>
596
597 </sect2>
598
599</sect1>
Note: See TracBrowser for help on using the repository browser.