max/graph-algorithms
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

updates

Browse source
This commit is contained in:
GregorSamsa42 2024-08-01 23:05:04 +02:00
parent 54cef5809d
commit 0785d87519
2 changed files with 4 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
Kosaraju/main.cpp
View file

@ -6,7 +6,7 @@
#include <vector> #include <vector>
#include <stack> #include <stack>
#include "digraph.h" #include "../digraph.h"
// push nodes in post-order // push nodes in post-order
void dfs1(Digraph const & G, int n, std::vector<bool> & vis, std::stack<int> & node_order) { void dfs1(Digraph const & G, int n, std::vector<bool> & vis, std::stack<int> & node_order) {

3
min_spanning_tree/prim/prim.cpp
View file

@ -89,6 +89,9 @@ int main() {
G.add_edge(7,3,9); G.add_edge(7,3,9);
G.add_edge(0,3,1); G.add_edge(0,3,1);
G.add_edge(3,0,5); G.add_edge(3,0,5);
G.add_edge(4,6,3);
G.add_edge(0,7,0.5);
G.add_edge(4,2,1);
prim(G); prim(G);