Algorithmics 25

        • NetworkX Cheatsheet
        • NetworkX Edges
        • NetworkX Nodes
        • Python Concepts
            • Array
            • Dictionary
            • List
            • Priority queue
            • Queue
            • Set
            • Stack
          • Abstract data type
          • Abstract data type signature
          • Combination ADTs
          • Data type
          • Non-primitive data type
          • Primitive data type
            • Communication of Algorithms
                • DAG source
                • Pigeon hole principle
            • Correctness
            • Proof
            • Algorithm design
            • Modular design
          • Algorithm
          • Algorithm Types
          • Algorithm types
          • Function
          • PrecomputationProcrastination
          • Pseudocode
          • State diagram
              • path finding
              • Bellman-Ford algorithm
              • Dijkstra's algorithm
              • Floyd-Warshall algorithm
              • Warshall's Transitive Closure Algorithm
              • Best-first search
              • Breadth-first search
              • Breadth-first search (graphs)
              • Breadth-first search (trees)
              • Comparison between traversal algorithms
              • Depth-first search
              • Prim's Algorithm
            • Comparing Graph Algorithms
            • PageRank
            • Merge sort
            • Quick sort
          • Boolean Algebra
          • Boolean algebra
          • Conjunction (boolean algebra)
          • Disjunction (boolean algebra)
          • Logic statement
          • Negation (boolean algebra)
          • Properties of Equivalence
          • Truth table
            • Directed edge
            • Edge
            • Edge endpoints
            • Weighted edge
            • Graph coloring
            • Graph coloring
            • Diameter (graph theory)
            • Distance (graph theory)
            • Adjacency list
            • Adjacency matrix
            • Distance Matrix
            • distance matrix
            • Incidence matrix
            • Transitive Closure
            • transitive closure
            • Weight Matrix
            • weight matrix
            • Circuit
            • Cycle
            • Eulerian circuit
            • Eulerian trail
            • Hamiltonian cycle
            • Hamiltonian path
            • Negative weight cycle
            • Path
            • Trail
            • Walk
              • Decision tree
              • Directed tree
              • Forest
              • Minimum spanning tree
              • Rooted tree
              • Spanning tree
              • Tree
            • Acyclic
            • Complete graph
            • Connected graph
            • Cyclic
            • Directed acyclic graph
            • Directed graph
            • Isomorphic Graph
            • Isomorphic graph
            • Labelled graph
            • Planar graph
            • Simple graph
            • Subgraph
            • Undirected graph
            • Weighted graph
            • Adjacent nodes
            • Degree
            • Node
            • Source node
            • Target node
            • Weighted nodes
            • Isomorphism
            • Topography
            • Topological Sorting
            • Topological sorting
          • Applications of graph theory
          • Graph
          • Graph topology
          • Notation
        • Properties of Equivalence
            • Big O examples
            • Fibanachi
            • Other Examples of Big-O
          • Algorithm analysis
          • Auxiliary space
          • Big-O Analysis
          • Combinatorial Explosion
          • Efficiency T(n)
          • Loop invariant
          • Other Notation
          • Space complexity
          • Backtracking
          • Dynamic programming
          • Naive programming
            • Heuristic function
            • Heuristics
            • Hill climbing
            • Simulated Annealing
          • A(star) Search Algorithm
          • Algorithms
          • Binary search
            • Binary classification
            • Feature
            • Linear classifier
            • Support Vector Machine
            • Training with Data
            • Types of Machine Learning
            • Forward Propagation
            • Layer (neural network)
            • Model training
            • Multi-layer Perceptron
            • Overfitting and Underfitting
            • Perceptron
            • Resurgence in neural networks
          • Artificial Intelligence
          • Chinese Room Responses
          • Ethics of AI
          • Searle's Chinese Room Argument
          • Turing Test
          • Weak and Strong AI
          • 0-1 Knapsack Problem
          • Graph Coloring Problem
          • Travelling Salesman Problem (TSP)
          • Entscheidungsproblem
          • Halting Problem
          • Limits of Computability
          • Foundational crisis of mathematics
          • Hilbert's Program
          • State diagram (Turing machine)
          • Turing Machine
        • Complexity Classes
        • Deterministic algorithm
        • Master Theorem
        • Tractable problems
        • Untitled
      • About the authors
      • Study Design
    Home

    ❯

    Unit 3

    ❯

    Graph theory

    ❯

    Graph types

    ❯

    Tree

    ❯

    Directed tree

    Directed tree

    Aug 23, 20251 min read

    A tree that is directed, that is, the edges can represent direction through arrows.

    Properties

    • it is a directed acrylic graph.
    • its underlying undirected graph is a tree.

    Graph View

    Backlinks

    • Graph

    Generated using Quartz © 2025