mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 04:18:34 +08:00
Documentation for 651d622775
This commit is contained in:
realstealthninja
@@ -145,95 +145,94 @@ $(function(){initNavTree('d2/d48/max__flow__with__ford__fulkerson__and__edmond__
|
||||
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> visited.reset();</div>
|
||||
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span> std::queue<int> q;</div>
|
||||
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> q.push(source);</div>
|
||||
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> <span class="keywordtype">bool</span> is_path_found = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> <span class="keywordflow">while</span> (q.empty() == <span class="keyword">false</span> && is_path_found == <span class="keyword">false</span>) {</div>
|
||||
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> <span class="keywordtype">int</span> current_node = q.front();</div>
|
||||
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> visited.set(current_node);</div>
|
||||
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> q.pop();</div>
|
||||
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < total_nodes; ++i) {</div>
|
||||
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> <span class="keywordflow">if</span> (residual_capacity[current_node][i] > 0 && !visited[i]) {</div>
|
||||
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> visited.set(i);</div>
|
||||
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> parent[i] = current_node;</div>
|
||||
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="keywordflow">if</span> (i == sink) {</div>
|
||||
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> }</div>
|
||||
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> q.push(i);</div>
|
||||
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> }</div>
|
||||
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> }</div>
|
||||
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> }</div>
|
||||
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> }</div>
|
||||
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> </div>
|
||||
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keyword">public</span>:</div>
|
||||
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keywordtype">void</span> set_graph() {</div>
|
||||
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> std::cin >> total_nodes >> total_edges >> source >> sink;</div>
|
||||
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> parent = std::vector<int>(total_nodes, -1);</div>
|
||||
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> capacity = residual_capacity = std::vector<std::vector<int> >(</div>
|
||||
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> total_nodes, std::vector<int>(total_nodes));</div>
|
||||
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> start = 0, destination = 0, capacity_ = 0, i = 0;</div>
|
||||
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> i < total_edges; ++i) {</div>
|
||||
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> std::cin >> start >> destination >> capacity_;</div>
|
||||
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> residual_capacity[start][destination] = capacity_;</div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> capacity[start][destination] = capacity_;</div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> }</div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> }</div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordtype">void</span> ford_fulkerson() {</div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordflow">while</span> (bfs(source, sink)) {</div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordtype">int</span> current_node = sink;</div>
|
||||
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordtype">int</span> flow = std::numeric_limits<int>::max();</div>
|
||||
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keywordflow">while</span> (current_node != source) {</div>
|
||||
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="keywordtype">int</span> parent_ = parent[current_node];</div>
|
||||
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> flow = std::min(flow, residual_capacity[parent_][current_node]);</div>
|
||||
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> current_node = parent_;</div>
|
||||
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> }</div>
|
||||
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> current_node = sink;</div>
|
||||
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> max_flow += flow;</div>
|
||||
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="keywordflow">while</span> (current_node != source) {</div>
|
||||
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keywordtype">int</span> parent_ = parent[current_node];</div>
|
||||
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> residual_capacity[parent_][current_node] -= flow;</div>
|
||||
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> residual_capacity[current_node][parent_] += flow;</div>
|
||||
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> current_node = parent_;</div>
|
||||
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> }</div>
|
||||
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div>
|
||||
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> }</div>
|
||||
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keywordtype">void</span> print_flow_info() {</div>
|
||||
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < total_nodes; ++i) {</div>
|
||||
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < total_nodes; ++j) {</div>
|
||||
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordflow">if</span> (capacity[i][j] &&</div>
|
||||
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> residual_capacity[i][j] < capacity[i][j]) {</div>
|
||||
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> edge_participated.emplace_back(std::make_tuple(</div>
|
||||
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> i, j, capacity[i][j] - residual_capacity[i][j]));</div>
|
||||
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> }</div>
|
||||
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> }</div>
|
||||
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> }</div>
|
||||
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> std::cout << <span class="stringliteral">"\nNodes : "</span> << total_nodes << <span class="stringliteral">"\nMax flow: "</span> << max_flow</div>
|
||||
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> << <span class="stringliteral">"\nEdge present in flow: "</span> << edge_participated.size()</div>
|
||||
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> << <span class="charliteral">'\n'</span>;</div>
|
||||
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> std::cout << <span class="stringliteral">"\nSource\tDestination\tCapacity\total_nodes"</span>;</div>
|
||||
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span>& edge_data : edge_participated) {</div>
|
||||
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="keywordtype">int</span> source = 0, destination = 0, capacity_ = 0;</div>
|
||||
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> std::tie(source, destination, capacity_) = edge_data;</div>
|
||||
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> std::cout << source << <span class="stringliteral">"\t"</span> << destination << <span class="stringliteral">"\t\t"</span> << capacity_</div>
|
||||
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> << <span class="charliteral">'\t'</span>;</div>
|
||||
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> }</div>
|
||||
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> }</div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span>};</div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="comment">/*</span></div>
|
||||
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span><span class="comment"> Input Graph: (for testing )</span></div>
|
||||
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span><span class="comment"> 4 5 0 3</span></div>
|
||||
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span><span class="comment"> 0 1 10</span></div>
|
||||
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span><span class="comment"> 1 2 1</span></div>
|
||||
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span><span class="comment"> 1 3 1</span></div>
|
||||
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span><span class="comment"> 0 2 1</span></div>
|
||||
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span><span class="comment"> 2 3 10</span></div>
|
||||
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span><span class="comment"> */</span></div>
|
||||
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>;</div>
|
||||
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.set_graph();</div>
|
||||
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.ford_fulkerson();</div>
|
||||
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.print_flow_info();</div>
|
||||
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span>}</div>
|
||||
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> <span class="keywordflow">while</span> (q.empty() == <span class="keyword">false</span>) {</div>
|
||||
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> <span class="keywordtype">int</span> current_node = q.front();</div>
|
||||
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> visited.set(current_node);</div>
|
||||
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> q.pop();</div>
|
||||
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < total_nodes; ++i) {</div>
|
||||
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> <span class="keywordflow">if</span> (residual_capacity[current_node][i] > 0 && !visited[i]) {</div>
|
||||
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> visited.set(i);</div>
|
||||
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> parent[i] = current_node;</div>
|
||||
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> <span class="keywordflow">if</span> (i == sink) {</div>
|
||||
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> }</div>
|
||||
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> q.push(i);</div>
|
||||
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> }</div>
|
||||
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> }</div>
|
||||
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> }</div>
|
||||
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> }</div>
|
||||
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> </div>
|
||||
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keyword">public</span>:</div>
|
||||
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keywordtype">void</span> set_graph() {</div>
|
||||
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> std::cin >> total_nodes >> total_edges >> source >> sink;</div>
|
||||
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> parent = std::vector<int>(total_nodes, -1);</div>
|
||||
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> capacity = residual_capacity = std::vector<std::vector<int> >(</div>
|
||||
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> total_nodes, std::vector<int>(total_nodes));</div>
|
||||
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> start = 0, destination = 0, capacity_ = 0, i = 0;</div>
|
||||
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> i < total_edges; ++i) {</div>
|
||||
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> std::cin >> start >> destination >> capacity_;</div>
|
||||
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> residual_capacity[start][destination] = capacity_;</div>
|
||||
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> capacity[start][destination] = capacity_;</div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> }</div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> }</div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keywordtype">void</span> ford_fulkerson() {</div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">while</span> (bfs(source, sink)) {</div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordtype">int</span> current_node = sink;</div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordtype">int</span> flow = std::numeric_limits<int>::max();</div>
|
||||
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordflow">while</span> (current_node != source) {</div>
|
||||
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keywordtype">int</span> parent_ = parent[current_node];</div>
|
||||
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> flow = std::min(flow, residual_capacity[parent_][current_node]);</div>
|
||||
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> current_node = parent_;</div>
|
||||
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> }</div>
|
||||
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> current_node = sink;</div>
|
||||
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> max_flow += flow;</div>
|
||||
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keywordflow">while</span> (current_node != source) {</div>
|
||||
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="keywordtype">int</span> parent_ = parent[current_node];</div>
|
||||
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> residual_capacity[parent_][current_node] -= flow;</div>
|
||||
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> residual_capacity[current_node][parent_] += flow;</div>
|
||||
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> current_node = parent_;</div>
|
||||
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> }</div>
|
||||
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> }</div>
|
||||
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div>
|
||||
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keywordtype">void</span> print_flow_info() {</div>
|
||||
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < total_nodes; ++i) {</div>
|
||||
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < total_nodes; ++j) {</div>
|
||||
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keywordflow">if</span> (capacity[i][j] &&</div>
|
||||
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> residual_capacity[i][j] < capacity[i][j]) {</div>
|
||||
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> edge_participated.emplace_back(std::make_tuple(</div>
|
||||
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> i, j, capacity[i][j] - residual_capacity[i][j]));</div>
|
||||
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> }</div>
|
||||
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> }</div>
|
||||
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> }</div>
|
||||
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> std::cout << <span class="stringliteral">"\nNodes : "</span> << total_nodes << <span class="stringliteral">"\nMax flow: "</span> << max_flow</div>
|
||||
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> << <span class="stringliteral">"\nEdge present in flow: "</span> << edge_participated.size()</div>
|
||||
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> << <span class="charliteral">'\n'</span>;</div>
|
||||
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> std::cout << <span class="stringliteral">"\nSource\tDestination\tCapacity\total_nodes"</span>;</div>
|
||||
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span>& edge_data : edge_participated) {</div>
|
||||
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="keywordtype">int</span> source = 0, destination = 0, capacity_ = 0;</div>
|
||||
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> std::tie(source, destination, capacity_) = edge_data;</div>
|
||||
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> std::cout << source << <span class="stringliteral">"\t"</span> << destination << <span class="stringliteral">"\t\t"</span> << capacity_</div>
|
||||
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> << <span class="charliteral">'\t'</span>;</div>
|
||||
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> }</div>
|
||||
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> }</div>
|
||||
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span>};</div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="comment">/*</span></div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span><span class="comment"> Input Graph: (for testing )</span></div>
|
||||
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span><span class="comment"> 4 5 0 3</span></div>
|
||||
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span><span class="comment"> 0 1 10</span></div>
|
||||
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span><span class="comment"> 1 2 1</span></div>
|
||||
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span><span class="comment"> 1 3 1</span></div>
|
||||
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span><span class="comment"> 0 2 1</span></div>
|
||||
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span><span class="comment"> 2 3 10</span></div>
|
||||
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span><span class="comment"> */</span></div>
|
||||
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>;</div>
|
||||
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.set_graph();</div>
|
||||
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.ford_fulkerson();</div>
|
||||
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.print_flow_info();</div>
|
||||
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span>}</div>
|
||||
<div class="ttc" id="aclass_graph_html"><div class="ttname"><a href="../../da/d9a/class_graph.html">Graph</a></div><div class="ttdef"><b>Definition</b> <a href="../../df/d14/bellman__ford_8cpp_source.html#l00014">bellman_ford.cpp:14</a></div></div>
|
||||
<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
|
||||
<div class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph Algorithms.</div></div>
|
||||
|
||||
@@ -681,24 +681,23 @@ Private Attributes</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 27</span> visited.reset();</div>
|
||||
<div class="line"><span class="lineno"> 28</span> std::queue<int> q;</div>
|
||||
<div class="line"><span class="lineno"> 29</span> q.push(source);</div>
|
||||
<div class="line"><span class="lineno"> 30</span> <span class="keywordtype">bool</span> is_path_found = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 31</span> <span class="keywordflow">while</span> (q.empty() == <span class="keyword">false</span> && is_path_found == <span class="keyword">false</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 32</span> <span class="keywordtype">int</span> current_node = q.front();</div>
|
||||
<div class="line"><span class="lineno"> 33</span> visited.set(current_node);</div>
|
||||
<div class="line"><span class="lineno"> 34</span> q.pop();</div>
|
||||
<div class="line"><span class="lineno"> 35</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < total_nodes; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 36</span> <span class="keywordflow">if</span> (residual_capacity[current_node][i] > 0 && !visited[i]) {</div>
|
||||
<div class="line"><span class="lineno"> 37</span> visited.set(i);</div>
|
||||
<div class="line"><span class="lineno"> 38</span> parent[i] = current_node;</div>
|
||||
<div class="line"><span class="lineno"> 39</span> <span class="keywordflow">if</span> (i == sink) {</div>
|
||||
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 41</span> }</div>
|
||||
<div class="line"><span class="lineno"> 42</span> q.push(i);</div>
|
||||
<div class="line"><span class="lineno"> 43</span> }</div>
|
||||
<div class="line"><span class="lineno"> 44</span> }</div>
|
||||
<div class="line"><span class="lineno"> 45</span> }</div>
|
||||
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 47</span> }</div>
|
||||
<div class="line"><span class="lineno"> 30</span> <span class="keywordflow">while</span> (q.empty() == <span class="keyword">false</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 31</span> <span class="keywordtype">int</span> current_node = q.front();</div>
|
||||
<div class="line"><span class="lineno"> 32</span> visited.set(current_node);</div>
|
||||
<div class="line"><span class="lineno"> 33</span> q.pop();</div>
|
||||
<div class="line"><span class="lineno"> 34</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < total_nodes; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 35</span> <span class="keywordflow">if</span> (residual_capacity[current_node][i] > 0 && !visited[i]) {</div>
|
||||
<div class="line"><span class="lineno"> 36</span> visited.set(i);</div>
|
||||
<div class="line"><span class="lineno"> 37</span> parent[i] = current_node;</div>
|
||||
<div class="line"><span class="lineno"> 38</span> <span class="keywordflow">if</span> (i == sink) {</div>
|
||||
<div class="line"><span class="lineno"> 39</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 40</span> }</div>
|
||||
<div class="line"><span class="lineno"> 41</span> q.push(i);</div>
|
||||
<div class="line"><span class="lineno"> 42</span> }</div>
|
||||
<div class="line"><span class="lineno"> 43</span> }</div>
|
||||
<div class="line"><span class="lineno"> 44</span> }</div>
|
||||
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 46</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -725,26 +724,26 @@ Private Attributes</h2></td></tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 62</span> {</div>
|
||||
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">while</span> (bfs(source, sink)) {</div>
|
||||
<div class="line"><span class="lineno"> 64</span> <span class="keywordtype">int</span> current_node = sink;</div>
|
||||
<div class="line"><span class="lineno"> 65</span> <span class="keywordtype">int</span> flow = std::numeric_limits<int>::max();</div>
|
||||
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">while</span> (current_node != source) {</div>
|
||||
<div class="line"><span class="lineno"> 67</span> <span class="keywordtype">int</span> parent_ = parent[current_node];</div>
|
||||
<div class="line"><span class="lineno"> 68</span> flow = std::min(flow, residual_capacity[parent_][current_node]);</div>
|
||||
<div class="line"><span class="lineno"> 69</span> current_node = parent_;</div>
|
||||
<div class="line"><span class="lineno"> 70</span> }</div>
|
||||
<div class="line"><span class="lineno"> 71</span> current_node = sink;</div>
|
||||
<div class="line"><span class="lineno"> 72</span> max_flow += flow;</div>
|
||||
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">while</span> (current_node != source) {</div>
|
||||
<div class="line"><span class="lineno"> 74</span> <span class="keywordtype">int</span> parent_ = parent[current_node];</div>
|
||||
<div class="line"><span class="lineno"> 75</span> residual_capacity[parent_][current_node] -= flow;</div>
|
||||
<div class="line"><span class="lineno"> 76</span> residual_capacity[current_node][parent_] += flow;</div>
|
||||
<div class="line"><span class="lineno"> 77</span> current_node = parent_;</div>
|
||||
<div class="line"><span class="lineno"> 78</span> }</div>
|
||||
<div class="line"><span class="lineno"> 79</span> }</div>
|
||||
<div class="line"><span class="lineno"> 80</span> }</div>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00061">61</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 61</span> {</div>
|
||||
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">while</span> (bfs(source, sink)) {</div>
|
||||
<div class="line"><span class="lineno"> 63</span> <span class="keywordtype">int</span> current_node = sink;</div>
|
||||
<div class="line"><span class="lineno"> 64</span> <span class="keywordtype">int</span> flow = std::numeric_limits<int>::max();</div>
|
||||
<div class="line"><span class="lineno"> 65</span> <span class="keywordflow">while</span> (current_node != source) {</div>
|
||||
<div class="line"><span class="lineno"> 66</span> <span class="keywordtype">int</span> parent_ = parent[current_node];</div>
|
||||
<div class="line"><span class="lineno"> 67</span> flow = std::min(flow, residual_capacity[parent_][current_node]);</div>
|
||||
<div class="line"><span class="lineno"> 68</span> current_node = parent_;</div>
|
||||
<div class="line"><span class="lineno"> 69</span> }</div>
|
||||
<div class="line"><span class="lineno"> 70</span> current_node = sink;</div>
|
||||
<div class="line"><span class="lineno"> 71</span> max_flow += flow;</div>
|
||||
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">while</span> (current_node != source) {</div>
|
||||
<div class="line"><span class="lineno"> 73</span> <span class="keywordtype">int</span> parent_ = parent[current_node];</div>
|
||||
<div class="line"><span class="lineno"> 74</span> residual_capacity[parent_][current_node] -= flow;</div>
|
||||
<div class="line"><span class="lineno"> 75</span> residual_capacity[current_node][parent_] += flow;</div>
|
||||
<div class="line"><span class="lineno"> 76</span> current_node = parent_;</div>
|
||||
<div class="line"><span class="lineno"> 77</span> }</div>
|
||||
<div class="line"><span class="lineno"> 78</span> }</div>
|
||||
<div class="line"><span class="lineno"> 79</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -832,28 +831,28 @@ Private Attributes</h2></td></tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00081">81</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 81</span> {</div>
|
||||
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < total_nodes; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 83</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < total_nodes; ++j) {</div>
|
||||
<div class="line"><span class="lineno"> 84</span> <span class="keywordflow">if</span> (capacity[i][j] &&</div>
|
||||
<div class="line"><span class="lineno"> 85</span> residual_capacity[i][j] < capacity[i][j]) {</div>
|
||||
<div class="line"><span class="lineno"> 86</span> edge_participated.emplace_back(std::make_tuple(</div>
|
||||
<div class="line"><span class="lineno"> 87</span> i, j, capacity[i][j] - residual_capacity[i][j]));</div>
|
||||
<div class="line"><span class="lineno"> 88</span> }</div>
|
||||
<div class="line"><span class="lineno"> 89</span> }</div>
|
||||
<div class="line"><span class="lineno"> 90</span> }</div>
|
||||
<div class="line"><span class="lineno"> 91</span> std::cout << <span class="stringliteral">"\nNodes : "</span> << total_nodes << <span class="stringliteral">"\nMax flow: "</span> << max_flow</div>
|
||||
<div class="line"><span class="lineno"> 92</span> << <span class="stringliteral">"\nEdge present in flow: "</span> << edge_participated.size()</div>
|
||||
<div class="line"><span class="lineno"> 93</span> << <span class="charliteral">'\n'</span>;</div>
|
||||
<div class="line"><span class="lineno"> 94</span> std::cout << <span class="stringliteral">"\nSource\tDestination\tCapacity\total_nodes"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 95</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span>& edge_data : edge_participated) {</div>
|
||||
<div class="line"><span class="lineno"> 96</span> <span class="keywordtype">int</span> source = 0, destination = 0, capacity_ = 0;</div>
|
||||
<div class="line"><span class="lineno"> 97</span> std::tie(source, destination, capacity_) = edge_data;</div>
|
||||
<div class="line"><span class="lineno"> 98</span> std::cout << source << <span class="stringliteral">"\t"</span> << destination << <span class="stringliteral">"\t\t"</span> << capacity_</div>
|
||||
<div class="line"><span class="lineno"> 99</span> << <span class="charliteral">'\t'</span>;</div>
|
||||
<div class="line"><span class="lineno"> 100</span> }</div>
|
||||
<div class="line"><span class="lineno"> 101</span> }</div>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00080">80</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 80</span> {</div>
|
||||
<div class="line"><span class="lineno"> 81</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < total_nodes; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < total_nodes; ++j) {</div>
|
||||
<div class="line"><span class="lineno"> 83</span> <span class="keywordflow">if</span> (capacity[i][j] &&</div>
|
||||
<div class="line"><span class="lineno"> 84</span> residual_capacity[i][j] < capacity[i][j]) {</div>
|
||||
<div class="line"><span class="lineno"> 85</span> edge_participated.emplace_back(std::make_tuple(</div>
|
||||
<div class="line"><span class="lineno"> 86</span> i, j, capacity[i][j] - residual_capacity[i][j]));</div>
|
||||
<div class="line"><span class="lineno"> 87</span> }</div>
|
||||
<div class="line"><span class="lineno"> 88</span> }</div>
|
||||
<div class="line"><span class="lineno"> 89</span> }</div>
|
||||
<div class="line"><span class="lineno"> 90</span> std::cout << <span class="stringliteral">"\nNodes : "</span> << total_nodes << <span class="stringliteral">"\nMax flow: "</span> << max_flow</div>
|
||||
<div class="line"><span class="lineno"> 91</span> << <span class="stringliteral">"\nEdge present in flow: "</span> << edge_participated.size()</div>
|
||||
<div class="line"><span class="lineno"> 92</span> << <span class="charliteral">'\n'</span>;</div>
|
||||
<div class="line"><span class="lineno"> 93</span> std::cout << <span class="stringliteral">"\nSource\tDestination\tCapacity\total_nodes"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 94</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span>& edge_data : edge_participated) {</div>
|
||||
<div class="line"><span class="lineno"> 95</span> <span class="keywordtype">int</span> source = 0, destination = 0, capacity_ = 0;</div>
|
||||
<div class="line"><span class="lineno"> 96</span> std::tie(source, destination, capacity_) = edge_data;</div>
|
||||
<div class="line"><span class="lineno"> 97</span> std::cout << source << <span class="stringliteral">"\t"</span> << destination << <span class="stringliteral">"\t\t"</span> << capacity_</div>
|
||||
<div class="line"><span class="lineno"> 98</span> << <span class="charliteral">'\t'</span>;</div>
|
||||
<div class="line"><span class="lineno"> 99</span> }</div>
|
||||
<div class="line"><span class="lineno"> 100</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -880,19 +879,19 @@ Private Attributes</h2></td></tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00050">50</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 50</span> {</div>
|
||||
<div class="line"><span class="lineno"> 51</span> std::cin >> total_nodes >> total_edges >> source >> sink;</div>
|
||||
<div class="line"><span class="lineno"> 52</span> parent = std::vector<int>(total_nodes, -1);</div>
|
||||
<div class="line"><span class="lineno"> 53</span> capacity = residual_capacity = std::vector<std::vector<int> >(</div>
|
||||
<div class="line"><span class="lineno"> 54</span> total_nodes, std::vector<int>(total_nodes));</div>
|
||||
<div class="line"><span class="lineno"> 55</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> start = 0, destination = 0, capacity_ = 0, i = 0;</div>
|
||||
<div class="line"><span class="lineno"> 56</span> i < total_edges; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 57</span> std::cin >> start >> destination >> capacity_;</div>
|
||||
<div class="line"><span class="lineno"> 58</span> residual_capacity[start][destination] = capacity_;</div>
|
||||
<div class="line"><span class="lineno"> 59</span> capacity[start][destination] = capacity_;</div>
|
||||
<div class="line"><span class="lineno"> 60</span> }</div>
|
||||
<div class="line"><span class="lineno"> 61</span> }</div>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00049">49</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 49</span> {</div>
|
||||
<div class="line"><span class="lineno"> 50</span> std::cin >> total_nodes >> total_edges >> source >> sink;</div>
|
||||
<div class="line"><span class="lineno"> 51</span> parent = std::vector<int>(total_nodes, -1);</div>
|
||||
<div class="line"><span class="lineno"> 52</span> capacity = residual_capacity = std::vector<std::vector<int> >(</div>
|
||||
<div class="line"><span class="lineno"> 53</span> total_nodes, std::vector<int>(total_nodes));</div>
|
||||
<div class="line"><span class="lineno"> 54</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> start = 0, destination = 0, capacity_ = 0, i = 0;</div>
|
||||
<div class="line"><span class="lineno"> 55</span> i < total_edges; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 56</span> std::cin >> start >> destination >> capacity_;</div>
|
||||
<div class="line"><span class="lineno"> 57</span> residual_capacity[start][destination] = capacity_;</div>
|
||||
<div class="line"><span class="lineno"> 58</span> capacity[start][destination] = capacity_;</div>
|
||||
<div class="line"><span class="lineno"> 59</span> }</div>
|
||||
<div class="line"><span class="lineno"> 60</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
|
||||
Reference in New Issue
Block a user