| /dports/x11-toolkits/gtkada3/gtkada-1688bb8/src/ |
| H A D | glib-graphs.adb | 573 Acyclic : aliased Boolean; variable
575 return Depth_First_Search (G, Acyclic'Access);
584 Acyclic : access Boolean;
637 Acyclic.all := False;
659 Acyclic.all := True;
676 Acyclic : Boolean := True; variable
695 if not Acyclic then
699 Acyclic := False;
718 return Acyclic;
|
| H A D | glib-graphs.ads | 209 Acyclic : access Boolean;
|
| H A D | glib-graphs-layouts.adb | 286 Acyclic : aliased Boolean; variable
289 Acyclic => Acyclic'Access,
|
| /dports/x11-toolkits/gtkada/gtkada-2.24.4.0/src/ |
| H A D | glib-graphs.adb | 565 Acyclic : aliased Boolean; variable
567 return Depth_First_Search (G, Acyclic'Access);
576 Acyclic : access Boolean;
623 Acyclic.all := False;
640 Acyclic.all := True;
657 Acyclic : Boolean := True; variable
676 if not Acyclic then
680 Acyclic := False;
699 return Acyclic;
|
| H A D | glib-graphs.ads | 205 Acyclic : access Boolean;
|
| /dports/graphics/graphviz/graphviz-2.44.1/windows/ws/ |
| H A D | tools.dsw | 6 Project: "Acyclic"="..\cmd\tools\Acyclic.dsp" - Package Owner=<4>
|
| /dports/math/py-networkx/networkx-2.6.3/doc/reference/algorithms/ |
| H A D | dag.rst | 2 Directed Acyclic Graphs
|
| /dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/wrappers/pyAgrum/doc/sphinx/ |
| H A D | graph.rst | 29 Directed Acyclic Graph
|
| /dports/graphics/tesseract/tesseract-5.0.0/doc/ |
| H A D | dawg2wordlist.1.asc | 15 dawg2wordlist(1) converts a Tesseract Directed Acyclic Word
|
| H A D | wordlist2dawg.1.asc | 23 wordlist2dawg(1) converts a wordlist to a Directed Acyclic Word Graph
|
| /dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/test/ |
| H A D | Main.hs | 1 import Algebra.Graph.Test.Acyclic.AdjacencyMap
|
| /dports/graphics/graphviz/graphviz-2.44.1/windows/ |
| H A D | wmake.sh | 42 TOOLS=(Acyclic ccomps gvcolor gc nop sccmap tred unflatten gxl2dot dijkstra bcomps gvpack)
|
| /dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/doc/ci/pipelines/ |
| H A D | pipeline_architectures.md | 17 - [Directed Acyclic Graph](#directed-acyclic-graph-pipelines): Good for large, complex projects tha…
95 ## Directed Acyclic Graph Pipelines
98 you can use [Directed Acyclic Graphs (DAG)](../directed_acyclic_graph/index.md). Use the
|
| H A D | pipeline_efficiency.md | 89 ### Directed Acyclic Graphs (DAG) visualization
91 The [Directed Acyclic Graph](../directed_acyclic_graph/index.md) (DAG) visualization can help analy…
185 ### Directed Acyclic Graphs (DAG)
189 cases. [Directed Acyclic Graphs](../directed_acyclic_graph/index.md) and
|
| /dports/graphics/gegl/gegl-0.4.34/docs/ |
| H A D | glossary.adoc | 12 Directed Acyclic Graph, see xref:graph[graph].
|
| /dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/ |
| H A D | algebraic-graphs.cabal | 100 Algebra.Graph.Acyclic.AdjacencyMap,
133 Algebra.Graph.Test.Acyclic.AdjacencyMap,
|
| /dports/databases/pgrouting/pgrouting-3.2.0/doc/dagShortestPath/ |
| H A D | pgr_dagShortestPath.rst | 49 Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest …
181 :Example: Using a combinations table on a Directed Acyclic Graph.
|
| /dports/www/libhsts/libhsts-0.1.0/docs/ |
| H A D | hsts-make-dafsa.md | 21 …Acyclic Finite State Automaton (DAFSA) from a textual representation of Chromium's HSTS preload li…
|
| /dports/devel/py-orange-canvas-core/orange-canvas-core-0.1.20/docs/source/orangecanvas/ |
| H A D | overview.rst | 10 speaking a workflow is a simple graph structure(a Directed Acyclic
|
| /dports/science/plumed/plumed2-2.7.2/user-doc/tutorials/others/isdb-1/charmm36-eef1sb.ff/ |
| H A D | forcefield.doc | 97 All-Atom Force Field for Acyclic Polyalcohols, Acyclic Carbohydrates
|
| /dports/devel/py-ipyparallel/ipyparallel-6.3.0/docs/source/ |
| H A D | dag_dependencies.rst | 7 Often, parallel workflow is described in terms of a `Directed Acyclic Graph
22 on a, whereas the edge (b,a) would mean a depends on b. The 'A' is 'Acyclic', meaning that
|
| /dports/lang/gcc12-devel/gcc-12-20211205/gcc/ada/libgnat/ |
| H A D | s-pehage.adb | 279 function Acyclic return Boolean; subprogspec
423 function Acyclic return Boolean is subprogram
492 end Acyclic;
686 if 0 < Edges_Len and then Acyclic then
|
| /dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/gcc/ada/ |
| H A D | g-pehage.adb | 290 function Acyclic return Boolean; subprogspec
439 function Acyclic return Boolean subprogram
516 end Acyclic;
627 exit when 0 < Edges_Len and then Acyclic;
|
| /dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/gcc/ada/ |
| H A D | g-pehage.adb | 290 function Acyclic return Boolean;
439 function Acyclic return Boolean
516 end Acyclic;
627 exit when 0 < Edges_Len and then Acyclic;
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/docs/CommandGuide/ |
| H A D | tblgen.rst | 101 Generate a DAG (Directed Acyclic Graph) instruction selector.
|