Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update Main with Changes from Developer #80

Merged
merged 11 commits into from
Dec 6, 2023
Merged

Update Main with Changes from Developer #80

merged 11 commits into from
Dec 6, 2023

Conversation

LibraChris
Copy link
Collaborator

Added from Developer:

  • Longest Path Algorithm:

    • Introduced a new Longest Path Algorithm to calculate the longest paths in a graph.
  • Tests for Longest Path Algorithm:

    • Implemented tests to verify the correctness and reliability of the Longest Path Algorithm.
  • Mapping Functions for FGraph and AdjGraph:

    • Included mapping functions for both FGraph (Functional Graph) and AdjGraph (Adjacency Graph) to facilitate transformations and manipulations on graph structures.
  • Filter Functions for FGraph and AdjGraph:

    • Added filter functions for both FGraph and AdjGraph, allowing users to selectively include or exclude elements based on specific criteria.
  • Minor Fix for Documentation

LibraChris and others added 11 commits November 27, 2023 16:33
Add a function to calculate the longest path of an directed acyclic FGraph
- mapEdges
- mapiEdges
- setEdgeData
- hasLoops
- isSimple
- getNodeLabel
- getSubgraphOfNodeSeq
- getSubgraphOfNodeLabelFilter
- getSubgraphOfNodeFilter
Fix Eccecentricety and Digraph docs
Add function to check if graph is Cyclic
Rename check functions and add the check to the compute expressions
Add simple tests for LongestPath
@LibraChris LibraChris merged commit 1d9bb2e into main Dec 6, 2023
4 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant