Welcome to AlgoTree’s documentation!

Getting Started:

• Introduction
  • Getting Started
  • Features
  • Node-Centric API
• AlgoTree Fluent API Guide
  • Modern Node Class
  • TreeBuilder - Fluent Tree Construction
  • FluentNode - Chainable Operations
  • Tree DSL - Multiple Format Support
  • Complete Examples
  • Migration from Dict-based API
  • Best Practices
  • Performance Considerations
  • Next Steps
• Pattern Matching
  • Basic Usage
  • Pattern Syntax
  • Advanced Matching
  • Fluent API Integration
  • Pattern Replacement
  • Real-World Examples
  • Dot Notation (dotsuite-inspired)
  • Command-Line Usage
  • Performance Considerations
  • See Also
• Tree Transformations
  • Dot Notation and Escaping
  • Closed Transformations (dotmod family)
  • Open Transformations (dotpipe family)
  • In-Place vs Copy Operations
  • Chaining Transformations
  • Pattern Matching Reference
• AlgoTree: Comprehensive Tutorial
  • 1. Introduction
  • 2. Installation
  • 3. Core Concepts
  • 4. FlatForest: A Flexible Tree Structure
  • 5. TreeNode: A Simple Recursive Tree Structure
  • 6. Tree Traversal and Manipulation
  • 7. Tree Visualization
  • 8. Tree Conversion
  • 9. Advanced Features
  • 10. Working with Subtrees
  • 11. Expression Trees and Evaluation
  • 12. Conclusion
• AlgoTree Cookbook
  • Tree Construction Patterns
  • Tree Navigation Patterns
  • Tree Transformation Patterns
  • Tree Analysis Patterns
  • Tree Comparison Patterns
  • Export and Visualization Patterns
  • Advanced Patterns
  • Performance Patterns
  • See Also

Traditional API:

• FlatForest
  • Tree Data Format
  • Theoretical Background
  • FlatForest Class
  • Tree Conversions
  • Conclusion
• TreeNode
  • TreeNode Structure
  • Attributes and Methods
  • Tree API
  • Example Usage
• FlatForest Notebook
  • Introduction
  • Creating a FlatForest
  • Storing and Transmitting Trees
  • Algorithm Examples
  • Conclusion
• Expression Trees and Evaluation
  • Visualizing the Tree Structure
  • Post-order Traversal
  • Expression Tree Evaluator
  • Converting to FlatForest
  • Handling Undefined Variables
  • Post-order vs. Pre-order Traversal
• Understanding Equality in Trees and Nodes
  • Identity: The Strict Definition
  • Equality: Intrinsic and Extrinsic Properties
  • Equality in Trees and Nodes
  • Hashing and Equality
  • Philosophical Perspective: The Ship of Theseus
  • Conclusion

Tools & Reference:

• jt Command-Line Tool
  • Installation
  • Basic Usage
  • Input Formats
  • Output Formats
  • Filtering and Queries
  • Tree Navigation
  • Tree Transformations
  • Tree Analysis
  • Format Conversion
  • Advanced Examples
  • Comparison with v0.8
  • Tips and Tricks
  • See Also
• API Reference
  • Core Classes
  • Pattern Matching
  • Closed Transformations (Tree → Tree)
  • Open Transformations (Tree → Any)
  • Tree DSL Parsing
  • Export Functions
  • Visualization
• AlgoTree
  • AlgoTree package

Indices and tables

• Index

• Module Index

• Search Page