From c42396c07496e94eff25b37cd93aad2f5c065509 Mon Sep 17 00:00:00 2001 From: "Documenter.jl" Date: Fri, 7 Jun 2024 23:29:57 +0000 Subject: [PATCH] build based on d2da947 --- dev/api/index.html | 4 ++-- dev/index.html | 2 +- dev/installation/index.html | 2 +- dev/search/index.html | 2 +- 4 files changed, 5 insertions(+), 5 deletions(-) diff --git a/dev/api/index.html b/dev/api/index.html index 364a99a..ed9d7da 100644 --- a/dev/api/index.html +++ b/dev/api/index.html @@ -6,7 +6,7 @@ ga('create', 'UA-136089579-2', 'auto'); ga('send', 'pageview', {'page': location.pathname + location.search + location.hash}); -
Edit on GitHub

DirectedAcyclicGraphs

DirectedAcyclicGraphs.NodeType — Type

A trait hierarchy denoting types of DAG nodes NodeType defines an orthogonal type hierarchy of node types, so we can dispatch on node type regardless of the graph type. See @ref{https://docs.julialang.org/en/v1/manual/methods/#Trait-based-dispatch-1}

source
Base.parent — Method

Get the parent of a given tree node (or nothing if the node is root)

source
DirectedAcyclicGraphs.find_inode — Method

Find a binary inner node that has left in its left subtree and right in its right subtree. Supports nothing as a catch-all for either left or right. Returns nothing if no such node exists.

source
DirectedAcyclicGraphs.foldup — Method
foldup(node::DAG, 
+
Edit on GitHub
DirectedAcyclicGraphs
DirectedAcyclicGraphs.NodeType — Type
A trait hierarchy denoting types of DAG nodes NodeType defines an orthogonal type hierarchy of node types, so we can dispatch on node type regardless of the graph type. See @ref{https://docs.julialang.org/en/v1/manual/methods/#Trait-based-dispatch-1}
source
Base.parent — Method
Get the parent of a given tree node (or nothing if the node is root)
source
DirectedAcyclicGraphs.find_inode — Method
Find a binary inner node that has left in its left subtree and right in its right subtree. Supports nothing as a catch-all for either left or right. Returns nothing if no such node exists.
source
DirectedAcyclicGraphs.foldup — Method
foldup(node::DAG, 
     f_leaf::Function, 
     f_inner::Function, 
-    ::Type{T})::T where {T}
Compute a function bottom-up on the graph.  f_leaf is called on leaf nodes, and f_inner is called on inner nodes. Values of type T are passed up the circuit and given to f_inner as a function on the children.
source
DirectedAcyclicGraphs.foldup_aggregate — Method
Compute a function bottom-up on the circuit.  f_leaf is called on leaf nodes, and f_inner is called on inner nodes. Values of type T are passed up the circuit and given to f_inner in aggregate  as a vector from the children.
source
DirectedAcyclicGraphs.lca — Method
Find the least common ancestor. Assumes the Tree has access to a parent.  A given descends_from function is required to quickly check whether a node is an ancestor.
source

+    ::Type{T})::T where {T}

Compute a function bottom-up on the graph. f_leaf is called on leaf nodes, and f_inner is called on inner nodes. Values of type T are passed up the circuit and given to f_inner as a function on the children.

source
DirectedAcyclicGraphs.foldup_aggregate — Method

Compute a function bottom-up on the circuit. f_leaf is called on leaf nodes, and f_inner is called on inner nodes. Values of type T are passed up the circuit and given to f_inner in aggregate as a vector from the children.

source
DirectedAcyclicGraphs.lca — Method

Find the least common ancestor. Assumes the Tree has access to a parent. A given descends_from function is required to quickly check whether a node is an ancestor.

source
diff --git a/dev/index.html b/dev/index.html index 6cb6992..4725dec 100644 --- a/dev/index.html +++ b/dev/index.html @@ -6,4 +6,4 @@ ga('create', 'UA-136089579-2', 'auto'); ga('send', 'pageview', {'page': location.pathname + location.search + location.hash}); -
Edit on GitHub

DirectedAcyclicGraphs.jl

This package provides tools to represent Directed Acyclic Graphs (DAGs), additionaly it includes common tasks that are relevant to DirectedAcyclicGraphs, see the API section for me details.

+
Edit on GitHub

DirectedAcyclicGraphs.jl

This package provides tools to represent Directed Acyclic Graphs (DAGs), additionaly it includes common tasks that are relevant to DirectedAcyclicGraphs, see the API section for me details.

diff --git a/dev/installation/index.html b/dev/installation/index.html index f96fe5a..3d03b12 100644 --- a/dev/installation/index.html +++ b/dev/installation/index.html @@ -6,4 +6,4 @@ ga('create', 'UA-136089579-2', 'auto'); ga('send', 'pageview', {'page': location.pathname + location.search + location.hash}); -
Edit on GitHub

Installation

Prerequisites

Julia 1.6 or greater. For installation, please refer to the official Julia Website.

Installing DirectedAcyclicGraphs

From Command Line

To install the latest stable release, run:

julia -e 'using Pkg; Pkg.add("DirectedAcyclicGraphs")'

To install the package with the latest commits on master branch, run:

julia -e 'using Pkg; Pkg.add(PackageSpec(url="https://github.com/Tractables/DirectedAcyclicGraphs.jl.git"))'

From Julia Pkg REPL

Note

To get to Pkg mode, you need to run julia, then to press ]. Press backspace or ^C to get back to normal REPL mode.

While in Pkg mode, run the following to install the latest release:

] add DirectedAcyclicGraphs

Similarly, to install from the latest commits on main branch, run:

] add DirectedAcyclicGraphs#main

Testing

If you are installing the latest commit, we recommend running the test suite to make sure everything is in order, to do that run:

julia --color=yes -e 'using Pkg; Pkg.test("DirectedAcyclicGraphs")'
+
Edit on GitHub

Installation

Prerequisites

Julia 1.6 or greater. For installation, please refer to the official Julia Website.

Installing DirectedAcyclicGraphs

From Command Line

To install the latest stable release, run:

julia -e 'using Pkg; Pkg.add("DirectedAcyclicGraphs")'

To install the package with the latest commits on master branch, run:

julia -e 'using Pkg; Pkg.add(PackageSpec(url="https://github.com/Tractables/DirectedAcyclicGraphs.jl.git"))'

From Julia Pkg REPL

Note

To get to Pkg mode, you need to run julia, then to press ]. Press backspace or ^C to get back to normal REPL mode.

While in Pkg mode, run the following to install the latest release:

] add DirectedAcyclicGraphs

Similarly, to install from the latest commits on main branch, run:

] add DirectedAcyclicGraphs#main

Testing

If you are installing the latest commit, we recommend running the test suite to make sure everything is in order, to do that run:

julia --color=yes -e 'using Pkg; Pkg.test("DirectedAcyclicGraphs")'
diff --git a/dev/search/index.html b/dev/search/index.html index 9144001..1467104 100644 --- a/dev/search/index.html +++ b/dev/search/index.html @@ -6,4 +6,4 @@ ga('create', 'UA-136089579-2', 'auto'); ga('send', 'pageview', {'page': location.pathname + location.search + location.hash}); -

Loading search...

    +

    Loading search...