Bewusstsein Labs - Graphs

Introduction

• This is a library dedicated to graph based data structures and algorithms.
• Complex systems will be built on top of this library and sibling libraries.
• Further features and optimizations are planned.

Graph Types

• Undirected Graph Functional
• Directed Graph Functional
• Function Graph Partially Functional

Graph Methods

• New Functional
• Add Node Functional
• Get Node Functional
• Get Node Mutable Functional
• Contains Node Functional
• Remove Node Functional
• Delete Node Functional
• Add Edge Functional
• Get Edge Functional
• Get Edge Mutable Functional
• Contains Edge Functional
• Remove Edge Functional
• Delete Edge Functional
• Clear Functional
• Clear Edges Functional

Graph Properties

• Is Complete Functional
• Is Empty Functional
• Is Trivial Functional
• Is Null Functional
• Is Child Node Functional
• Is Subgraph Functional
• Is Proper Subgraph Functional
• Is Improper Subgraph Functional
• Is Spanning Subgraph Functional
• Are Adjacent Nodes Functional
• Are Adjacent Edges Functional
• Order Functional
• Size Functional

Graph Traversal

• Breadth First Search Functional
• Depth First Search Functional

Copyright © 2024 Bewusstsein Labs