jyapayne/langflow
1
0
Fork 0
Code Issues Pull requests Projects Releases 1 Packages Wiki Activity Actions

docs: updates for release (#6762)

Browse source 
* chat-io-new-inputs

* split-text-new-inputs-and-outputs

* update-structured-data-io

* bump-python-prereq-to-3.13

* reactflow

* structured-output-component

* chat-io-page-cleanup

* typo

* collapse-nav-by-default

* move-up-api-in-sidebar

* add-text-output-to-duck-duck-go

* Apply suggestions from code review

Co-authored-by: Edwin Jose <edwin.jose@datastax.com>

* clarify-chat-and-text-inputs

* changes-for-text-io

* no-playground-output

* Apply suggestions from code review

Co-authored-by: KimberlyFields <46325568+KimberlyFields@users.noreply.github.com>

* code-review

---------

Co-authored-by: Edwin Jose <edwin.jose@datastax.com>
Co-authored-by: KimberlyFields <46325568+KimberlyFields@users.noreply.github.com>
This commit is contained in:
Mendon Kissling 2025-02-25 18:08:18 -05:00 • committed by GitHub
commit c57ed6f464
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
9 changed files with 127 additions and 75 deletions
Download patch file Download diff file Expand all files Collapse all files

2
docs/docs/Concepts/concepts-overview.md
View file

@ -21,7 +21,7 @@ A flow can be as simple as the [basic prompting flow](/get-started-quickstart),
* Each component has a **Configuration** menu. Click the **Code** pane to see a component's underlying Python code.
* Components are connected with **edges** to form flows.
If you're familiar with [ReactFlow](https://reactflow.dev/learn), a **flow** is a node-based application, a **component** is a node, and the connections between components are **edges**.
If you're familiar with [React Flow](https://reactflow.dev/learn), a **flow** is a node-based application, a **component** is a node, and the connections between components are **edges**.
When a flow is run, Langflow builds a Directed Acyclic Graph (DAG) graph object from the nodes (components) and edges (connections between components), with the nodes sorted to determine the order of execution. The graph build calls the individual components' `def_build` functions to validate and prepare the nodes. This graph is then processed in dependency order. Each node is built and executed sequentially, with results from each built node being passed to nodes that are dependent on the previous node's results.