summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/tex/latex/adigraph
diff options
context:
space:
mode:
authorKarl Berry <karl@freefriends.org>2019-01-29 22:12:09 +0000
committerKarl Berry <karl@freefriends.org>2019-01-29 22:12:09 +0000
commit7051618f193878d7680d2575f4878c65c9a7826a (patch)
treeb35fadc5dd7f95c785c86fc1aaa03507b63f21c4 /Master/texmf-dist/tex/latex/adigraph
parent6bfe500db52351270f34959f456fd5955a83d386 (diff)
adigraph (29jan19)
git-svn-id: svn://tug.org/texlive/trunk@49862 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Master/texmf-dist/tex/latex/adigraph')
-rw-r--r--Master/texmf-dist/tex/latex/adigraph/adigraph.sty94
1 files changed, 53 insertions, 41 deletions
diff --git a/Master/texmf-dist/tex/latex/adigraph/adigraph.sty b/Master/texmf-dist/tex/latex/adigraph/adigraph.sty
index 52f9e8de77d..e472ebd59fe 100644
--- a/Master/texmf-dist/tex/latex/adigraph/adigraph.sty
+++ b/Master/texmf-dist/tex/latex/adigraph/adigraph.sty
@@ -7,7 +7,7 @@
%
% THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
%
-\def\AdigraphVersionNumber{v1.7.0}
+\def\AdigraphVersionNumber{v1.7.1}
\NeedsTeXFormat{LaTeX2e}[1994/06/01]
\ProvidesPackage{adigraph}
@@ -26,6 +26,8 @@
\def\AdigraphDefaultWidth{0.4}
\def\AdigraphRed{red!90}
\def\AdigraphCyan{cyan!90}
+\providebool{AdigraphDrawGraphs}
+\booltrue{AdigraphDrawGraphs}
\makeatletter
\newcommand{\AdigraphRom}[1]{\expandafter\@slowromancap\romannumeral #1@}
@@ -712,53 +714,55 @@
% #5 -> Current augmenting paths
% #6 -> Style
%
- \def\AdigraphNodeList{}
- \def\AdigraphEdgeList{}
- \letcs{\AdigraphAugmentingPaths}{#3}
- \begin{tikzpicture}
- \tikzset{%
- vertex/.style={circle,draw,minimum size=2em},
- edge/.style={#6}
- }
+ \ifbool{AdigraphDrawGraphs}{%
+ \def\AdigraphNodeList{}
+ \def\AdigraphEdgeList{}
+ \letcs{\AdigraphAugmentingPaths}{#3}
+ \begin{tikzpicture}
+ \tikzset{%
+ vertex/.style={circle,draw,minimum size=2em},
+ edge/.style={#6}
+ }
- % vertices
- \ifblank{#1}{%
- % List is empty
- }{%
- \AdigraphNodesCounter{#1}
- \AdigraphProcessNodes{#1}
- }
+ % vertices
+ \ifblank{#1}{%
+ % List is empty
+ }{%
+ \AdigraphNodesCounter{#1}
+ \AdigraphProcessNodes{#1}
+ }
- \ifblank{#2}{%
- % List is empty
- }{%
- \AdigraphProcessEdges{#2}
- }
+ \ifblank{#2}{%
+ % List is empty
+ }{%
+ \AdigraphProcessEdges{#2}
+ }
- \ifblank{\AdigraphAugmentingPaths}{%
- % List is empty
- }{%
- \ifblank{#5}{%
- \defcounter{AdigraphNumberOfPaths}{100000}
+ \ifblank{\AdigraphAugmentingPaths}{%
+ % List is empty
}{%
+ \ifblank{#5}{%
+ \defcounter{AdigraphNumberOfPaths}{100000}
+ }{%
+ }
+ \forlistloop{\AdigraphCountPaths}{\AdigraphAugmentingPaths}
+ \forlistloop{\AdigraphProcessPaths}{\AdigraphAugmentingPaths}
}
- \forlistloop{\AdigraphCountPaths}{\AdigraphAugmentingPaths}
- \forlistloop{\AdigraphProcessPaths}{\AdigraphAugmentingPaths}
- }
- \ifblank{#2}{%
- % List is empty
- }{%
- \forlistloop{\AdigraphEdgeDrawer}{\AdigraphEdgeList}
- }
+ \ifblank{#2}{%
+ % List is empty
+ }{%
+ \forlistloop{\AdigraphEdgeDrawer}{\AdigraphEdgeList}
+ }
- % %cuts
- \ifblank{#4}{%
- % List is empty
- }{%
- \AdigraphProcessCuts{#4}
- }
- \end{tikzpicture}
+ % %cuts
+ \ifblank{#4}{%
+ % List is empty
+ }{%
+ \AdigraphProcessCuts{#4}
+ }
+ \end{tikzpicture}
+ }{}
}
\NewDocumentCommand{\AdigraphProcessAugmentingPaths}{m}{}
@@ -834,6 +838,14 @@
}
}
+\NewDocumentCommand{\DisableAdigraphs}{}{%
+ \boolfalse{AdigraphDrawGraphs}
+}
+
+\NewDocumentCommand{\EnableAdigraphs}{}{%
+ \booltrue{AdigraphDrawGraphs}
+}
+
\endinput
%%