Skip to content

Thread-Safe version of Floyed-Warshall Algorithm #77

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.

Sign up for GitHub

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

Merged
ZigRazor merged 7 commits into from
Oct 12, 2021
Merged

Thread-Safe version of Floyed-Warshall Algorithm #77

Changes from all commits
Commits
Show all changes
7 commits
Select commit Hold shift + click to select a range
20785bf
Update Graph_TS.hpp
Dishantdhillon Oct 12, 2021
a337af2
Merge pull request #2 from Dishantdhillon/Dishantdhillon-patch-2
Dishantdhillon Oct 12, 2021
ab11955
Merge branch 'ZigRazor:master' into master
Dishantdhillon Oct 12, 2021
e396a97
Update Graph_TS.hpp
Dishantdhillon Oct 12, 2021
cbc50b8
Merge pull request #3 from Dishantdhillon/Dishantdhillon-patch-3
Dishantdhillon Oct 12, 2021
f74522f
Update Graph_TS.hpp
Dishantdhillon Oct 12, 2021
42bef07
Merge pull request #4 from Dishantdhillon/Dishantdhillon-patch-4
Dishantdhillon Oct 12, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
24 changes: 22 additions & 2 deletions include/Graph/Graph_TS.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -124,6 +124,17 @@ namespace CXXGRAPH
* there is error in the computation.
*/
const BellmanFordResult bellmanford(const Node<T> &source, const Node<T> &target) const override;
/**
* @brief Function runs the floyd-Warshall algorithm for every node
* in the graph and returns the shortest distance of each node from
* another node if there is no negative cycle in the graph.
* Note: Thread Safe
*
* @return shortest distance if any node is reachable from other node else ERROR in
* case if target is not reachable from source or there is negative cycle or
* there is error in the computation.
*/
const FWResult floydWarshall() const override;
/**
* \brief
* Function performs the breadth first search algorithm over the graph
Expand Down Expand Up @@ -323,11 +334,20 @@ namespace CXXGRAPH
const BellmanFordResult Graph_TS<T>::bellmanford(const Node<T> &source, const Node<T> &target) const
{
getLock();
auto bellford = Graph<T>::bellmanFord(source, target);
auto bellford = Graph<T>::bellmanford(source, target);
releaseLock();
return bellford;
}


template <typename T>
const FWResult Graph_TS<T>::floydWarshall() const
{
getLock();
auto fw = Graph<T>::floydWarshall();
releaseLock();
return fw;
}

template <typename T>
const std::vector<Node<T>> Graph_TS<T>::breadth_first_search(const Node<T> &start) const
{
Expand Down