diff options
| -rw-r--r-- | content/graph/graph.tex | 2 | ||||
| -rw-r--r-- | content/graph/kuhn.cpp (renamed from content/graph/maxCarBiMatch.cpp) | 0 | ||||
| -rw-r--r-- | test/graph/hopcroftKarp.cpp | 2 | ||||
| -rw-r--r-- | test/graph/kuhn.cpp (renamed from test/graph/maxCarBiMatch.cpp) | 2 |
4 files changed, 3 insertions, 3 deletions
diff --git a/content/graph/graph.tex b/content/graph/graph.tex index b38e96e..6e8e20b 100644 --- a/content/graph/graph.tex +++ b/content/graph/graph.tex @@ -188,7 +188,7 @@ Sei $a_{ij}$ die Adjazenzmatrix von $G$ \textcolor{gray}{(mit $a_{ii} = 1$)}, da \begin{itemize} \item die ersten [0..l) Knoten in \code{adj} sind die linke Seite des Graphen \end{itemize} - \sourcecode{graph/maxCarBiMatch.cpp} + \sourcecode{graph/kuhn.cpp} \begin{methods} \method{hopcroft\_karp}{berechnet Matching}{\sqrt{\abs{V}}\*\abs{E}} \end{methods} diff --git a/content/graph/maxCarBiMatch.cpp b/content/graph/kuhn.cpp index e928387..e928387 100644 --- a/content/graph/maxCarBiMatch.cpp +++ b/content/graph/kuhn.cpp diff --git a/test/graph/hopcroftKarp.cpp b/test/graph/hopcroftKarp.cpp index 05599dd..df2cec2 100644 --- a/test/graph/hopcroftKarp.cpp +++ b/test/graph/hopcroftKarp.cpp @@ -1,6 +1,6 @@ #include "../util.h" namespace kuhn { -#include <graph/maxCarBiMatch.cpp> +#include <graph/kuhn.cpp> } namespace hk { #include <graph/hopcroftKarp.cpp> diff --git a/test/graph/maxCarBiMatch.cpp b/test/graph/kuhn.cpp index 6d7fad0..8b7e13b 100644 --- a/test/graph/maxCarBiMatch.cpp +++ b/test/graph/kuhn.cpp @@ -1,6 +1,6 @@ #include "../util.h" namespace kuhn { -#include <graph/maxCarBiMatch.cpp> +#include <graph/kuhn.cpp> } namespace hk { #include <graph/hopcroftKarp.cpp> |