sp
/
MaxFlowDinic
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
A simple students project implementing Dinic's Algorithm to compute the max flow/min cut of a network.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
9 Commits
1 Branch
0 Tags
58 KiB
Branch: main
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'main'
${ noResults }
MaxFlowDinic/util/GraphParser.h

16 lines
529 B
Raw Permalink Normal View History

initial commit Finished basic implementation of Dinic's algorithm
3 years ago
​
​
​
​
​
​
​
​
​
​
​
​
​
​
​
  1. #pragma once
  3. #include <set>
  4. #include <string>
  5. #include <vector>
  7. #include "Vertex.h"
  8. #include "Arc.h"
  10. class Vertex;
  12. namespace parser {
  13. void parseString(const std::string &graph_string, std::vector<Arc> &m_arc_list, std::vector<Vertex> &m_vertices, VertexID &source_id, VertexID &sink_id, int &m_num_vertices, int &m_num_arcs);
  15. void parseFile(const std::string &graph_filename, std::vector<Arc> &m_arc_list, std::vector<Vertex> &m_vertices, VertexID &source_id, VertexID &sink_id, int &m_num_vertices, int &m_num_arcs);
  16. }