Back to Glossary Index
Dagster Data Engineering Glossary:
Undirected Graph
A graph in which edges have no orientation, meaning the edge from vertex A to vertex B is identical to the edge from vertex B to vertex A.
Dagster Data Engineering Glossary:
A graph in which edges have no orientation, meaning the edge from vertex A to vertex B is identical to the edge from vertex B to vertex A.