mirror of
https://codeberg.org/qg-info-unterricht/zpg-graphentester.git
synced 2026-03-25 04:58:24 +01:00
Sync with upstream
This commit is contained in:
Frank Schiebel
parent
39a2f13410
commit
66e8fa72bf
135 changed files with 38902 additions and 37757 deletions
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
|
|
@ -1,365 +1,365 @@
|
|||
<!DOCTYPE HTML>
|
||||
<!-- NewPage -->
|
||||
<html lang="de">
|
||||
<head>
|
||||
<!-- Generated by javadoc (11.0.2) on Sat Jan 30 12:26:45 CET 2021 -->
|
||||
<title>algorithmen (1_graphentester)</title>
|
||||
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
||||
<meta name="dc.created" content="2021-01-30">
|
||||
<link rel="stylesheet" type="text/css" href="../stylesheet.css" title="Style">
|
||||
<link rel="stylesheet" type="text/css" href="../jquery/jquery-ui.css" title="Style">
|
||||
<script type="text/javascript" src="../script.js"></script>
|
||||
<script type="text/javascript" src="../jquery/jszip/dist/jszip.min.js"></script>
|
||||
<script type="text/javascript" src="../jquery/jszip-utils/dist/jszip-utils.min.js"></script>
|
||||
<!--[if IE]>
|
||||
<script type="text/javascript" src="../jquery/jszip-utils/dist/jszip-utils-ie.min.js"></script>
|
||||
<![endif]-->
|
||||
<script type="text/javascript" src="../jquery/jquery-3.3.1.js"></script>
|
||||
<script type="text/javascript" src="../jquery/jquery-migrate-3.0.1.js"></script>
|
||||
<script type="text/javascript" src="../jquery/jquery-ui.js"></script>
|
||||
</head>
|
||||
<body>
|
||||
<script type="text/javascript"><!--
|
||||
try {
|
||||
if (location.href.indexOf('is-external=true') == -1) {
|
||||
parent.document.title="algorithmen (1_graphentester)";
|
||||
}
|
||||
}
|
||||
catch(err) {
|
||||
}
|
||||
//-->
|
||||
var pathtoroot = "../";
|
||||
var useModuleDirectories = true;
|
||||
loadScripts(document, 'script');</script>
|
||||
<noscript>
|
||||
<div>JavaScript is disabled on your browser.</div>
|
||||
</noscript>
|
||||
<header role="banner">
|
||||
<nav role="navigation">
|
||||
<div class="fixedNav">
|
||||
<!-- ========= START OF TOP NAVBAR ======= -->
|
||||
<div class="topNav"><a id="navbar.top">
|
||||
<!-- -->
|
||||
</a>
|
||||
<div class="skipNav"><a href="#skip.navbar.top" title="Skip navigation links">Skip navigation links</a></div>
|
||||
<a id="navbar.top.firstrow">
|
||||
<!-- -->
|
||||
</a>
|
||||
<ul class="navList" title="Navigation">
|
||||
<li><a href="../index.html">Overview</a></li>
|
||||
<li class="navBarCell1Rev">Package</li>
|
||||
<li>Class</li>
|
||||
<li><a href="package-tree.html">Tree</a></li>
|
||||
<li><a href="../index-all.html">Index</a></li>
|
||||
<li><a href="../help-doc.html">Help</a></li>
|
||||
</ul>
|
||||
</div>
|
||||
<div class="subNav">
|
||||
<ul class="navList" id="allclasses_navbar_top">
|
||||
<li><a href="../allclasses.html">All Classes</a></li>
|
||||
</ul>
|
||||
<ul class="navListSearch">
|
||||
<li><label for="search">SEARCH:</label>
|
||||
<input type="text" id="search" value="search" disabled="disabled">
|
||||
<input type="reset" id="reset" value="reset" disabled="disabled">
|
||||
</li>
|
||||
</ul>
|
||||
<div>
|
||||
<script type="text/javascript"><!--
|
||||
allClassesLink = document.getElementById("allclasses_navbar_top");
|
||||
if(window==top) {
|
||||
allClassesLink.style.display = "block";
|
||||
}
|
||||
else {
|
||||
allClassesLink.style.display = "none";
|
||||
}
|
||||
//-->
|
||||
</script>
|
||||
<noscript>
|
||||
<div>JavaScript is disabled on your browser.</div>
|
||||
</noscript>
|
||||
</div>
|
||||
<a id="skip.navbar.top">
|
||||
<!-- -->
|
||||
</a></div>
|
||||
<!-- ========= END OF TOP NAVBAR ========= -->
|
||||
</div>
|
||||
<div class="navPadding"> </div>
|
||||
<script type="text/javascript"><!--
|
||||
$('.navPadding').css('padding-top', $('.fixedNav').css("height"));
|
||||
//-->
|
||||
</script>
|
||||
</nav>
|
||||
</header>
|
||||
<main role="main">
|
||||
<div class="header">
|
||||
<h1 title="Package" class="title">Package algorithmen</h1>
|
||||
</div>
|
||||
<div class="contentContainer">
|
||||
<ul class="blockList">
|
||||
<li class="blockList">
|
||||
<table class="typeSummary">
|
||||
<caption><span>Class Summary</span><span class="tabEnd"> </span></caption>
|
||||
<tr>
|
||||
<th class="colFirst" scope="col">Class</th>
|
||||
<th class="colLast" scope="col">Description</th>
|
||||
</tr>
|
||||
<tbody>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo.html" title="class in algorithmen">GraphAlgo</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">description</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_BellmanFord.html" title="class in algorithmen">GraphAlgo_BellmanFord</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus findet die kürzesten Pfade in einem gewichteten Graphen.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_Breitensuche.html" title="class in algorithmen">GraphAlgo_Breitensuche</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus nummeriert alle Knoten des Graphen.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_ColoringBacktracking.html" title="class in algorithmen">GraphAlgo_ColoringBacktracking</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus färbt einen Graphen, so dass keine benachbarten Knoten
|
||||
die gleiche Farbe haben und möglichst wenige Farben benutzt werden.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_ColoringGreedy.html" title="class in algorithmen">GraphAlgo_ColoringGreedy</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus färbt einen Graphen, so dass keine benachbarten Knoten
|
||||
die gleiche Farbe haben und möglichst wenige Farben benutzt werden.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_ColoringGreedyRandom.html" title="class in algorithmen">GraphAlgo_ColoringGreedyRandom</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus färbt einen Graphen, so dass keine benachbarten Knoten
|
||||
die gleiche Farbe haben und möglichst wenige Farben benutzt werden.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_Dijkstra.html" title="class in algorithmen">GraphAlgo_Dijkstra</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus findet die kürzesten Pfade in einem gewichteten Graphen.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetBacktracking.html" title="class in algorithmen">GraphAlgo_DominatingSetBacktracking</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGenetisch.html" title="class in algorithmen">GraphAlgo_DominatingSetGenetisch</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGreedyA.html" title="class in algorithmen">GraphAlgo_DominatingSetGreedyA</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGreedyB.html" title="class in algorithmen">GraphAlgo_DominatingSetGreedyB</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGreedyC.html" title="class in algorithmen">GraphAlgo_DominatingSetGreedyC</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGreedyD.html" title="class in algorithmen">GraphAlgo_DominatingSetGreedyD</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGreedyE.html" title="class in algorithmen">GraphAlgo_DominatingSetGreedyE</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGreedyF.html" title="class in algorithmen">GraphAlgo_DominatingSetGreedyF</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGreedyG.html" title="class in algorithmen">GraphAlgo_DominatingSetGreedyG</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGreedyH.html" title="class in algorithmen">GraphAlgo_DominatingSetGreedyH</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGreedyI.html" title="class in algorithmen">GraphAlgo_DominatingSetGreedyI</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_EulerkreisExistenz.html" title="class in algorithmen">GraphAlgo_EulerkreisExistenz</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus testet, ob ein Eulerkreis existiert.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_Moore.html" title="class in algorithmen">GraphAlgo_Moore</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus findet die kürzesten Pfade in einem ungewichteten Graphen.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_MST_Kruskal.html" title="class in algorithmen">GraphAlgo_MST_Kruskal</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus sucht einen minimal Spanning Tree
|
||||
Algorithmus: Kruskal</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_MST_Prim.html" title="class in algorithmen">GraphAlgo_MST_Prim</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus sucht einen minimal Spanning Tree
|
||||
Algorithmus: Prim</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_Tiefensuche.html" title="class in algorithmen">GraphAlgo_Tiefensuche</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus nummeriert alle Knoten des Graphen.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_TiefensucheRek.html" title="class in algorithmen">GraphAlgo_TiefensucheRek</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus nummeriert alle Knoten des Graphen.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_toplogischeSortierung.html" title="class in algorithmen">GraphAlgo_toplogischeSortierung</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus findet eine topologische Sortierung des Graphen.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_TSPBacktracking.html" title="class in algorithmen">GraphAlgo_TSPBacktracking</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus sucht einen möglichst kurzen Hamilton-Kreis (Traveling
|
||||
Salesman Problem).</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_TSPGenetisch.html" title="class in algorithmen">GraphAlgo_TSPGenetisch</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">description</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_TSPGreedy.html" title="class in algorithmen">GraphAlgo_TSPGreedy</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus sucht einen möglichst kurzen Hamilton-Kreis (Traveling
|
||||
Salesman Problem).</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_TSPGreedy2.html" title="class in algorithmen">GraphAlgo_TSPGreedy2</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus sucht einen möglichst kurzen Hamilton-Kreis (Traveling
|
||||
Salesman Problem).</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_TSPGreedyOpt.html" title="class in algorithmen">GraphAlgo_TSPGreedyOpt</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus sucht einen möglichst kurzen Hamilton-Kreis (Traveling
|
||||
Salesman Problem).</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_ZyklusBacktracking.html" title="class in algorithmen">GraphAlgo_ZyklusBacktracking</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus ist ein Beispiel für einen Backtracking-Algorithmus.</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
</li>
|
||||
</ul>
|
||||
</div>
|
||||
</main>
|
||||
<footer role="contentinfo">
|
||||
<nav role="navigation">
|
||||
<!-- ======= START OF BOTTOM NAVBAR ====== -->
|
||||
<div class="bottomNav"><a id="navbar.bottom">
|
||||
<!-- -->
|
||||
</a>
|
||||
<div class="skipNav"><a href="#skip.navbar.bottom" title="Skip navigation links">Skip navigation links</a></div>
|
||||
<a id="navbar.bottom.firstrow">
|
||||
<!-- -->
|
||||
</a>
|
||||
<ul class="navList" title="Navigation">
|
||||
<li><a href="../index.html">Overview</a></li>
|
||||
<li class="navBarCell1Rev">Package</li>
|
||||
<li>Class</li>
|
||||
<li><a href="package-tree.html">Tree</a></li>
|
||||
<li><a href="../index-all.html">Index</a></li>
|
||||
<li><a href="../help-doc.html">Help</a></li>
|
||||
</ul>
|
||||
</div>
|
||||
<div class="subNav">
|
||||
<ul class="navList" id="allclasses_navbar_bottom">
|
||||
<li><a href="../allclasses.html">All Classes</a></li>
|
||||
</ul>
|
||||
<div>
|
||||
<script type="text/javascript"><!--
|
||||
allClassesLink = document.getElementById("allclasses_navbar_bottom");
|
||||
if(window==top) {
|
||||
allClassesLink.style.display = "block";
|
||||
}
|
||||
else {
|
||||
allClassesLink.style.display = "none";
|
||||
}
|
||||
//-->
|
||||
</script>
|
||||
<noscript>
|
||||
<div>JavaScript is disabled on your browser.</div>
|
||||
</noscript>
|
||||
</div>
|
||||
<a id="skip.navbar.bottom">
|
||||
<!-- -->
|
||||
</a></div>
|
||||
<!-- ======== END OF BOTTOM NAVBAR ======= -->
|
||||
</nav>
|
||||
</footer>
|
||||
</body>
|
||||
</html>
|
||||
<!DOCTYPE HTML>
|
||||
<!-- NewPage -->
|
||||
<html lang="de">
|
||||
<head>
|
||||
<!-- Generated by javadoc (11.0.2) on Sat Jan 30 12:26:45 CET 2021 -->
|
||||
<title>algorithmen (1_graphentester)</title>
|
||||
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
||||
<meta name="dc.created" content="2021-01-30">
|
||||
<link rel="stylesheet" type="text/css" href="../stylesheet.css" title="Style">
|
||||
<link rel="stylesheet" type="text/css" href="../jquery/jquery-ui.css" title="Style">
|
||||
<script type="text/javascript" src="../script.js"></script>
|
||||
<script type="text/javascript" src="../jquery/jszip/dist/jszip.min.js"></script>
|
||||
<script type="text/javascript" src="../jquery/jszip-utils/dist/jszip-utils.min.js"></script>
|
||||
<!--[if IE]>
|
||||
<script type="text/javascript" src="../jquery/jszip-utils/dist/jszip-utils-ie.min.js"></script>
|
||||
<![endif]-->
|
||||
<script type="text/javascript" src="../jquery/jquery-3.3.1.js"></script>
|
||||
<script type="text/javascript" src="../jquery/jquery-migrate-3.0.1.js"></script>
|
||||
<script type="text/javascript" src="../jquery/jquery-ui.js"></script>
|
||||
</head>
|
||||
<body>
|
||||
<script type="text/javascript"><!--
|
||||
try {
|
||||
if (location.href.indexOf('is-external=true') == -1) {
|
||||
parent.document.title="algorithmen (1_graphentester)";
|
||||
}
|
||||
}
|
||||
catch(err) {
|
||||
}
|
||||
//-->
|
||||
var pathtoroot = "../";
|
||||
var useModuleDirectories = true;
|
||||
loadScripts(document, 'script');</script>
|
||||
<noscript>
|
||||
<div>JavaScript is disabled on your browser.</div>
|
||||
</noscript>
|
||||
<header role="banner">
|
||||
<nav role="navigation">
|
||||
<div class="fixedNav">
|
||||
<!-- ========= START OF TOP NAVBAR ======= -->
|
||||
<div class="topNav"><a id="navbar.top">
|
||||
<!-- -->
|
||||
</a>
|
||||
<div class="skipNav"><a href="#skip.navbar.top" title="Skip navigation links">Skip navigation links</a></div>
|
||||
<a id="navbar.top.firstrow">
|
||||
<!-- -->
|
||||
</a>
|
||||
<ul class="navList" title="Navigation">
|
||||
<li><a href="../index.html">Overview</a></li>
|
||||
<li class="navBarCell1Rev">Package</li>
|
||||
<li>Class</li>
|
||||
<li><a href="package-tree.html">Tree</a></li>
|
||||
<li><a href="../index-all.html">Index</a></li>
|
||||
<li><a href="../help-doc.html">Help</a></li>
|
||||
</ul>
|
||||
</div>
|
||||
<div class="subNav">
|
||||
<ul class="navList" id="allclasses_navbar_top">
|
||||
<li><a href="../allclasses.html">All Classes</a></li>
|
||||
</ul>
|
||||
<ul class="navListSearch">
|
||||
<li><label for="search">SEARCH:</label>
|
||||
<input type="text" id="search" value="search" disabled="disabled">
|
||||
<input type="reset" id="reset" value="reset" disabled="disabled">
|
||||
</li>
|
||||
</ul>
|
||||
<div>
|
||||
<script type="text/javascript"><!--
|
||||
allClassesLink = document.getElementById("allclasses_navbar_top");
|
||||
if(window==top) {
|
||||
allClassesLink.style.display = "block";
|
||||
}
|
||||
else {
|
||||
allClassesLink.style.display = "none";
|
||||
}
|
||||
//-->
|
||||
</script>
|
||||
<noscript>
|
||||
<div>JavaScript is disabled on your browser.</div>
|
||||
</noscript>
|
||||
</div>
|
||||
<a id="skip.navbar.top">
|
||||
<!-- -->
|
||||
</a></div>
|
||||
<!-- ========= END OF TOP NAVBAR ========= -->
|
||||
</div>
|
||||
<div class="navPadding"> </div>
|
||||
<script type="text/javascript"><!--
|
||||
$('.navPadding').css('padding-top', $('.fixedNav').css("height"));
|
||||
//-->
|
||||
</script>
|
||||
</nav>
|
||||
</header>
|
||||
<main role="main">
|
||||
<div class="header">
|
||||
<h1 title="Package" class="title">Package algorithmen</h1>
|
||||
</div>
|
||||
<div class="contentContainer">
|
||||
<ul class="blockList">
|
||||
<li class="blockList">
|
||||
<table class="typeSummary">
|
||||
<caption><span>Class Summary</span><span class="tabEnd"> </span></caption>
|
||||
<tr>
|
||||
<th class="colFirst" scope="col">Class</th>
|
||||
<th class="colLast" scope="col">Description</th>
|
||||
</tr>
|
||||
<tbody>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo.html" title="class in algorithmen">GraphAlgo</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">description</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_BellmanFord.html" title="class in algorithmen">GraphAlgo_BellmanFord</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus findet die kürzesten Pfade in einem gewichteten Graphen.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_Breitensuche.html" title="class in algorithmen">GraphAlgo_Breitensuche</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus nummeriert alle Knoten des Graphen.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_ColoringBacktracking.html" title="class in algorithmen">GraphAlgo_ColoringBacktracking</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus färbt einen Graphen, so dass keine benachbarten Knoten
|
||||
die gleiche Farbe haben und möglichst wenige Farben benutzt werden.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_ColoringGreedy.html" title="class in algorithmen">GraphAlgo_ColoringGreedy</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus färbt einen Graphen, so dass keine benachbarten Knoten
|
||||
die gleiche Farbe haben und möglichst wenige Farben benutzt werden.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_ColoringGreedyRandom.html" title="class in algorithmen">GraphAlgo_ColoringGreedyRandom</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus färbt einen Graphen, so dass keine benachbarten Knoten
|
||||
die gleiche Farbe haben und möglichst wenige Farben benutzt werden.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_Dijkstra.html" title="class in algorithmen">GraphAlgo_Dijkstra</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus findet die kürzesten Pfade in einem gewichteten Graphen.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetBacktracking.html" title="class in algorithmen">GraphAlgo_DominatingSetBacktracking</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGenetisch.html" title="class in algorithmen">GraphAlgo_DominatingSetGenetisch</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGreedyA.html" title="class in algorithmen">GraphAlgo_DominatingSetGreedyA</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGreedyB.html" title="class in algorithmen">GraphAlgo_DominatingSetGreedyB</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGreedyC.html" title="class in algorithmen">GraphAlgo_DominatingSetGreedyC</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGreedyD.html" title="class in algorithmen">GraphAlgo_DominatingSetGreedyD</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGreedyE.html" title="class in algorithmen">GraphAlgo_DominatingSetGreedyE</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGreedyF.html" title="class in algorithmen">GraphAlgo_DominatingSetGreedyF</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGreedyG.html" title="class in algorithmen">GraphAlgo_DominatingSetGreedyG</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGreedyH.html" title="class in algorithmen">GraphAlgo_DominatingSetGreedyH</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_DominatingSetGreedyI.html" title="class in algorithmen">GraphAlgo_DominatingSetGreedyI</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus bestimmt die kleinste dominierende Menge in einem Graphen
|
||||
und bestimmt den Zeitbedarf.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_EulerkreisExistenz.html" title="class in algorithmen">GraphAlgo_EulerkreisExistenz</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus testet, ob ein Eulerkreis existiert.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_Moore.html" title="class in algorithmen">GraphAlgo_Moore</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus findet die kürzesten Pfade in einem ungewichteten Graphen.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_MST_Kruskal.html" title="class in algorithmen">GraphAlgo_MST_Kruskal</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus sucht einen minimal Spanning Tree
|
||||
Algorithmus: Kruskal</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_MST_Prim.html" title="class in algorithmen">GraphAlgo_MST_Prim</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus sucht einen minimal Spanning Tree
|
||||
Algorithmus: Prim</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_Tiefensuche.html" title="class in algorithmen">GraphAlgo_Tiefensuche</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus nummeriert alle Knoten des Graphen.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_TiefensucheRek.html" title="class in algorithmen">GraphAlgo_TiefensucheRek</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus nummeriert alle Knoten des Graphen.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_toplogischeSortierung.html" title="class in algorithmen">GraphAlgo_toplogischeSortierung</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus findet eine topologische Sortierung des Graphen.</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_TSPBacktracking.html" title="class in algorithmen">GraphAlgo_TSPBacktracking</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus sucht einen möglichst kurzen Hamilton-Kreis (Traveling
|
||||
Salesman Problem).</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_TSPGenetisch.html" title="class in algorithmen">GraphAlgo_TSPGenetisch</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">description</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_TSPGreedy.html" title="class in algorithmen">GraphAlgo_TSPGreedy</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus sucht einen möglichst kurzen Hamilton-Kreis (Traveling
|
||||
Salesman Problem).</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_TSPGreedy2.html" title="class in algorithmen">GraphAlgo_TSPGreedy2</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus sucht einen möglichst kurzen Hamilton-Kreis (Traveling
|
||||
Salesman Problem).</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="rowColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_TSPGreedyOpt.html" title="class in algorithmen">GraphAlgo_TSPGreedyOpt</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus sucht einen möglichst kurzen Hamilton-Kreis (Traveling
|
||||
Salesman Problem).</div>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="altColor">
|
||||
<th class="colFirst" scope="row"><a href="GraphAlgo_ZyklusBacktracking.html" title="class in algorithmen">GraphAlgo_ZyklusBacktracking</a></th>
|
||||
<td class="colLast">
|
||||
<div class="block">Dieser Algorithmus ist ein Beispiel für einen Backtracking-Algorithmus.</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
</li>
|
||||
</ul>
|
||||
</div>
|
||||
</main>
|
||||
<footer role="contentinfo">
|
||||
<nav role="navigation">
|
||||
<!-- ======= START OF BOTTOM NAVBAR ====== -->
|
||||
<div class="bottomNav"><a id="navbar.bottom">
|
||||
<!-- -->
|
||||
</a>
|
||||
<div class="skipNav"><a href="#skip.navbar.bottom" title="Skip navigation links">Skip navigation links</a></div>
|
||||
<a id="navbar.bottom.firstrow">
|
||||
<!-- -->
|
||||
</a>
|
||||
<ul class="navList" title="Navigation">
|
||||
<li><a href="../index.html">Overview</a></li>
|
||||
<li class="navBarCell1Rev">Package</li>
|
||||
<li>Class</li>
|
||||
<li><a href="package-tree.html">Tree</a></li>
|
||||
<li><a href="../index-all.html">Index</a></li>
|
||||
<li><a href="../help-doc.html">Help</a></li>
|
||||
</ul>
|
||||
</div>
|
||||
<div class="subNav">
|
||||
<ul class="navList" id="allclasses_navbar_bottom">
|
||||
<li><a href="../allclasses.html">All Classes</a></li>
|
||||
</ul>
|
||||
<div>
|
||||
<script type="text/javascript"><!--
|
||||
allClassesLink = document.getElementById("allclasses_navbar_bottom");
|
||||
if(window==top) {
|
||||
allClassesLink.style.display = "block";
|
||||
}
|
||||
else {
|
||||
allClassesLink.style.display = "none";
|
||||
}
|
||||
//-->
|
||||
</script>
|
||||
<noscript>
|
||||
<div>JavaScript is disabled on your browser.</div>
|
||||
</noscript>
|
||||
</div>
|
||||
<a id="skip.navbar.bottom">
|
||||
<!-- -->
|
||||
</a></div>
|
||||
<!-- ======== END OF BOTTOM NAVBAR ======= -->
|
||||
</nav>
|
||||
</footer>
|
||||
</body>
|
||||
</html>
|
||||
|
|
|
|||
|
|
@ -1,197 +1,197 @@
|
|||
<!DOCTYPE HTML>
|
||||
<!-- NewPage -->
|
||||
<html lang="de">
|
||||
<head>
|
||||
<!-- Generated by javadoc (11.0.2) on Sat Jan 30 12:26:45 CET 2021 -->
|
||||
<title>algorithmen Class Hierarchy (1_graphentester)</title>
|
||||
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
||||
<meta name="dc.created" content="2021-01-30">
|
||||
<link rel="stylesheet" type="text/css" href="../stylesheet.css" title="Style">
|
||||
<link rel="stylesheet" type="text/css" href="../jquery/jquery-ui.css" title="Style">
|
||||
<script type="text/javascript" src="../script.js"></script>
|
||||
<script type="text/javascript" src="../jquery/jszip/dist/jszip.min.js"></script>
|
||||
<script type="text/javascript" src="../jquery/jszip-utils/dist/jszip-utils.min.js"></script>
|
||||
<!--[if IE]>
|
||||
<script type="text/javascript" src="../jquery/jszip-utils/dist/jszip-utils-ie.min.js"></script>
|
||||
<![endif]-->
|
||||
<script type="text/javascript" src="../jquery/jquery-3.3.1.js"></script>
|
||||
<script type="text/javascript" src="../jquery/jquery-migrate-3.0.1.js"></script>
|
||||
<script type="text/javascript" src="../jquery/jquery-ui.js"></script>
|
||||
</head>
|
||||
<body>
|
||||
<script type="text/javascript"><!--
|
||||
try {
|
||||
if (location.href.indexOf('is-external=true') == -1) {
|
||||
parent.document.title="algorithmen Class Hierarchy (1_graphentester)";
|
||||
}
|
||||
}
|
||||
catch(err) {
|
||||
}
|
||||
//-->
|
||||
var pathtoroot = "../";
|
||||
var useModuleDirectories = true;
|
||||
loadScripts(document, 'script');</script>
|
||||
<noscript>
|
||||
<div>JavaScript is disabled on your browser.</div>
|
||||
</noscript>
|
||||
<header role="banner">
|
||||
<nav role="navigation">
|
||||
<div class="fixedNav">
|
||||
<!-- ========= START OF TOP NAVBAR ======= -->
|
||||
<div class="topNav"><a id="navbar.top">
|
||||
<!-- -->
|
||||
</a>
|
||||
<div class="skipNav"><a href="#skip.navbar.top" title="Skip navigation links">Skip navigation links</a></div>
|
||||
<a id="navbar.top.firstrow">
|
||||
<!-- -->
|
||||
</a>
|
||||
<ul class="navList" title="Navigation">
|
||||
<li><a href="../index.html">Overview</a></li>
|
||||
<li><a href="package-summary.html">Package</a></li>
|
||||
<li>Class</li>
|
||||
<li class="navBarCell1Rev">Tree</li>
|
||||
<li><a href="../index-all.html">Index</a></li>
|
||||
<li><a href="../help-doc.html">Help</a></li>
|
||||
</ul>
|
||||
</div>
|
||||
<div class="subNav">
|
||||
<ul class="navList" id="allclasses_navbar_top">
|
||||
<li><a href="../allclasses.html">All Classes</a></li>
|
||||
</ul>
|
||||
<ul class="navListSearch">
|
||||
<li><label for="search">SEARCH:</label>
|
||||
<input type="text" id="search" value="search" disabled="disabled">
|
||||
<input type="reset" id="reset" value="reset" disabled="disabled">
|
||||
</li>
|
||||
</ul>
|
||||
<div>
|
||||
<script type="text/javascript"><!--
|
||||
allClassesLink = document.getElementById("allclasses_navbar_top");
|
||||
if(window==top) {
|
||||
allClassesLink.style.display = "block";
|
||||
}
|
||||
else {
|
||||
allClassesLink.style.display = "none";
|
||||
}
|
||||
//-->
|
||||
</script>
|
||||
<noscript>
|
||||
<div>JavaScript is disabled on your browser.</div>
|
||||
</noscript>
|
||||
</div>
|
||||
<a id="skip.navbar.top">
|
||||
<!-- -->
|
||||
</a></div>
|
||||
<!-- ========= END OF TOP NAVBAR ========= -->
|
||||
</div>
|
||||
<div class="navPadding"> </div>
|
||||
<script type="text/javascript"><!--
|
||||
$('.navPadding').css('padding-top', $('.fixedNav').css("height"));
|
||||
//-->
|
||||
</script>
|
||||
</nav>
|
||||
</header>
|
||||
<main role="main">
|
||||
<div class="header">
|
||||
<h1 class="title">Hierarchy For Package algorithmen</h1>
|
||||
<span class="packageHierarchyLabel">Package Hierarchies:</span>
|
||||
<ul class="horizontal">
|
||||
<li><a href="../overview-tree.html">All Packages</a></li>
|
||||
</ul>
|
||||
</div>
|
||||
<div class="contentContainer">
|
||||
<section role="region">
|
||||
<h2 title="Class Hierarchy">Class Hierarchy</h2>
|
||||
<ul>
|
||||
<li class="circle">java.lang.<a href="https://docs.oracle.com/en/java/javase/11/docs/api/java.base/java/lang/Object.html?is-external=true" title="class or interface in java.lang" class="externalLink"><span class="typeNameLink">Object</span></a>
|
||||
<ul>
|
||||
<li class="circle">java.lang.<a href="https://docs.oracle.com/en/java/javase/11/docs/api/java.base/java/lang/Thread.html?is-external=true" title="class or interface in java.lang" class="externalLink"><span class="typeNameLink">Thread</span></a> (implements java.lang.<a href="https://docs.oracle.com/en/java/javase/11/docs/api/java.base/java/lang/Runnable.html?is-external=true" title="class or interface in java.lang" class="externalLink">Runnable</a>)
|
||||
<ul>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo</span></a>
|
||||
<ul>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_BellmanFord.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_BellmanFord</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_Breitensuche.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_Breitensuche</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_ColoringBacktracking.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_ColoringBacktracking</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_ColoringGreedy.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_ColoringGreedy</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_ColoringGreedyRandom.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_ColoringGreedyRandom</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_Dijkstra.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_Dijkstra</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetBacktracking.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetBacktracking</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGenetisch.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGenetisch</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGreedyA.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGreedyA</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGreedyB.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGreedyB</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGreedyC.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGreedyC</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGreedyD.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGreedyD</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGreedyE.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGreedyE</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGreedyF.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGreedyF</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGreedyG.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGreedyG</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGreedyH.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGreedyH</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGreedyI.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGreedyI</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_EulerkreisExistenz.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_EulerkreisExistenz</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_Moore.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_Moore</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_MST_Kruskal.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_MST_Kruskal</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_MST_Prim.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_MST_Prim</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_Tiefensuche.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_Tiefensuche</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_TiefensucheRek.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_TiefensucheRek</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_toplogischeSortierung.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_toplogischeSortierung</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_TSPBacktracking.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_TSPBacktracking</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_TSPGenetisch.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_TSPGenetisch</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_TSPGreedy.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_TSPGreedy</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_TSPGreedy2.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_TSPGreedy2</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_TSPGreedyOpt.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_TSPGreedyOpt</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_ZyklusBacktracking.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_ZyklusBacktracking</span></a></li>
|
||||
</ul>
|
||||
</li>
|
||||
</ul>
|
||||
</li>
|
||||
</ul>
|
||||
</li>
|
||||
</ul>
|
||||
</section>
|
||||
</div>
|
||||
</main>
|
||||
<footer role="contentinfo">
|
||||
<nav role="navigation">
|
||||
<!-- ======= START OF BOTTOM NAVBAR ====== -->
|
||||
<div class="bottomNav"><a id="navbar.bottom">
|
||||
<!-- -->
|
||||
</a>
|
||||
<div class="skipNav"><a href="#skip.navbar.bottom" title="Skip navigation links">Skip navigation links</a></div>
|
||||
<a id="navbar.bottom.firstrow">
|
||||
<!-- -->
|
||||
</a>
|
||||
<ul class="navList" title="Navigation">
|
||||
<li><a href="../index.html">Overview</a></li>
|
||||
<li><a href="package-summary.html">Package</a></li>
|
||||
<li>Class</li>
|
||||
<li class="navBarCell1Rev">Tree</li>
|
||||
<li><a href="../index-all.html">Index</a></li>
|
||||
<li><a href="../help-doc.html">Help</a></li>
|
||||
</ul>
|
||||
</div>
|
||||
<div class="subNav">
|
||||
<ul class="navList" id="allclasses_navbar_bottom">
|
||||
<li><a href="../allclasses.html">All Classes</a></li>
|
||||
</ul>
|
||||
<div>
|
||||
<script type="text/javascript"><!--
|
||||
allClassesLink = document.getElementById("allclasses_navbar_bottom");
|
||||
if(window==top) {
|
||||
allClassesLink.style.display = "block";
|
||||
}
|
||||
else {
|
||||
allClassesLink.style.display = "none";
|
||||
}
|
||||
//-->
|
||||
</script>
|
||||
<noscript>
|
||||
<div>JavaScript is disabled on your browser.</div>
|
||||
</noscript>
|
||||
</div>
|
||||
<a id="skip.navbar.bottom">
|
||||
<!-- -->
|
||||
</a></div>
|
||||
<!-- ======== END OF BOTTOM NAVBAR ======= -->
|
||||
</nav>
|
||||
</footer>
|
||||
</body>
|
||||
</html>
|
||||
<!DOCTYPE HTML>
|
||||
<!-- NewPage -->
|
||||
<html lang="de">
|
||||
<head>
|
||||
<!-- Generated by javadoc (11.0.2) on Sat Jan 30 12:26:45 CET 2021 -->
|
||||
<title>algorithmen Class Hierarchy (1_graphentester)</title>
|
||||
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
||||
<meta name="dc.created" content="2021-01-30">
|
||||
<link rel="stylesheet" type="text/css" href="../stylesheet.css" title="Style">
|
||||
<link rel="stylesheet" type="text/css" href="../jquery/jquery-ui.css" title="Style">
|
||||
<script type="text/javascript" src="../script.js"></script>
|
||||
<script type="text/javascript" src="../jquery/jszip/dist/jszip.min.js"></script>
|
||||
<script type="text/javascript" src="../jquery/jszip-utils/dist/jszip-utils.min.js"></script>
|
||||
<!--[if IE]>
|
||||
<script type="text/javascript" src="../jquery/jszip-utils/dist/jszip-utils-ie.min.js"></script>
|
||||
<![endif]-->
|
||||
<script type="text/javascript" src="../jquery/jquery-3.3.1.js"></script>
|
||||
<script type="text/javascript" src="../jquery/jquery-migrate-3.0.1.js"></script>
|
||||
<script type="text/javascript" src="../jquery/jquery-ui.js"></script>
|
||||
</head>
|
||||
<body>
|
||||
<script type="text/javascript"><!--
|
||||
try {
|
||||
if (location.href.indexOf('is-external=true') == -1) {
|
||||
parent.document.title="algorithmen Class Hierarchy (1_graphentester)";
|
||||
}
|
||||
}
|
||||
catch(err) {
|
||||
}
|
||||
//-->
|
||||
var pathtoroot = "../";
|
||||
var useModuleDirectories = true;
|
||||
loadScripts(document, 'script');</script>
|
||||
<noscript>
|
||||
<div>JavaScript is disabled on your browser.</div>
|
||||
</noscript>
|
||||
<header role="banner">
|
||||
<nav role="navigation">
|
||||
<div class="fixedNav">
|
||||
<!-- ========= START OF TOP NAVBAR ======= -->
|
||||
<div class="topNav"><a id="navbar.top">
|
||||
<!-- -->
|
||||
</a>
|
||||
<div class="skipNav"><a href="#skip.navbar.top" title="Skip navigation links">Skip navigation links</a></div>
|
||||
<a id="navbar.top.firstrow">
|
||||
<!-- -->
|
||||
</a>
|
||||
<ul class="navList" title="Navigation">
|
||||
<li><a href="../index.html">Overview</a></li>
|
||||
<li><a href="package-summary.html">Package</a></li>
|
||||
<li>Class</li>
|
||||
<li class="navBarCell1Rev">Tree</li>
|
||||
<li><a href="../index-all.html">Index</a></li>
|
||||
<li><a href="../help-doc.html">Help</a></li>
|
||||
</ul>
|
||||
</div>
|
||||
<div class="subNav">
|
||||
<ul class="navList" id="allclasses_navbar_top">
|
||||
<li><a href="../allclasses.html">All Classes</a></li>
|
||||
</ul>
|
||||
<ul class="navListSearch">
|
||||
<li><label for="search">SEARCH:</label>
|
||||
<input type="text" id="search" value="search" disabled="disabled">
|
||||
<input type="reset" id="reset" value="reset" disabled="disabled">
|
||||
</li>
|
||||
</ul>
|
||||
<div>
|
||||
<script type="text/javascript"><!--
|
||||
allClassesLink = document.getElementById("allclasses_navbar_top");
|
||||
if(window==top) {
|
||||
allClassesLink.style.display = "block";
|
||||
}
|
||||
else {
|
||||
allClassesLink.style.display = "none";
|
||||
}
|
||||
//-->
|
||||
</script>
|
||||
<noscript>
|
||||
<div>JavaScript is disabled on your browser.</div>
|
||||
</noscript>
|
||||
</div>
|
||||
<a id="skip.navbar.top">
|
||||
<!-- -->
|
||||
</a></div>
|
||||
<!-- ========= END OF TOP NAVBAR ========= -->
|
||||
</div>
|
||||
<div class="navPadding"> </div>
|
||||
<script type="text/javascript"><!--
|
||||
$('.navPadding').css('padding-top', $('.fixedNav').css("height"));
|
||||
//-->
|
||||
</script>
|
||||
</nav>
|
||||
</header>
|
||||
<main role="main">
|
||||
<div class="header">
|
||||
<h1 class="title">Hierarchy For Package algorithmen</h1>
|
||||
<span class="packageHierarchyLabel">Package Hierarchies:</span>
|
||||
<ul class="horizontal">
|
||||
<li><a href="../overview-tree.html">All Packages</a></li>
|
||||
</ul>
|
||||
</div>
|
||||
<div class="contentContainer">
|
||||
<section role="region">
|
||||
<h2 title="Class Hierarchy">Class Hierarchy</h2>
|
||||
<ul>
|
||||
<li class="circle">java.lang.<a href="https://docs.oracle.com/en/java/javase/11/docs/api/java.base/java/lang/Object.html?is-external=true" title="class or interface in java.lang" class="externalLink"><span class="typeNameLink">Object</span></a>
|
||||
<ul>
|
||||
<li class="circle">java.lang.<a href="https://docs.oracle.com/en/java/javase/11/docs/api/java.base/java/lang/Thread.html?is-external=true" title="class or interface in java.lang" class="externalLink"><span class="typeNameLink">Thread</span></a> (implements java.lang.<a href="https://docs.oracle.com/en/java/javase/11/docs/api/java.base/java/lang/Runnable.html?is-external=true" title="class or interface in java.lang" class="externalLink">Runnable</a>)
|
||||
<ul>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo</span></a>
|
||||
<ul>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_BellmanFord.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_BellmanFord</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_Breitensuche.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_Breitensuche</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_ColoringBacktracking.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_ColoringBacktracking</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_ColoringGreedy.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_ColoringGreedy</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_ColoringGreedyRandom.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_ColoringGreedyRandom</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_Dijkstra.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_Dijkstra</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetBacktracking.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetBacktracking</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGenetisch.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGenetisch</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGreedyA.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGreedyA</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGreedyB.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGreedyB</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGreedyC.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGreedyC</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGreedyD.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGreedyD</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGreedyE.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGreedyE</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGreedyF.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGreedyF</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGreedyG.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGreedyG</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGreedyH.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGreedyH</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_DominatingSetGreedyI.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_DominatingSetGreedyI</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_EulerkreisExistenz.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_EulerkreisExistenz</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_Moore.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_Moore</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_MST_Kruskal.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_MST_Kruskal</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_MST_Prim.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_MST_Prim</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_Tiefensuche.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_Tiefensuche</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_TiefensucheRek.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_TiefensucheRek</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_toplogischeSortierung.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_toplogischeSortierung</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_TSPBacktracking.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_TSPBacktracking</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_TSPGenetisch.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_TSPGenetisch</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_TSPGreedy.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_TSPGreedy</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_TSPGreedy2.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_TSPGreedy2</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_TSPGreedyOpt.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_TSPGreedyOpt</span></a></li>
|
||||
<li class="circle">algorithmen.<a href="GraphAlgo_ZyklusBacktracking.html" title="class in algorithmen"><span class="typeNameLink">GraphAlgo_ZyklusBacktracking</span></a></li>
|
||||
</ul>
|
||||
</li>
|
||||
</ul>
|
||||
</li>
|
||||
</ul>
|
||||
</li>
|
||||
</ul>
|
||||
</section>
|
||||
</div>
|
||||
</main>
|
||||
<footer role="contentinfo">
|
||||
<nav role="navigation">
|
||||
<!-- ======= START OF BOTTOM NAVBAR ====== -->
|
||||
<div class="bottomNav"><a id="navbar.bottom">
|
||||
<!-- -->
|
||||
</a>
|
||||
<div class="skipNav"><a href="#skip.navbar.bottom" title="Skip navigation links">Skip navigation links</a></div>
|
||||
<a id="navbar.bottom.firstrow">
|
||||
<!-- -->
|
||||
</a>
|
||||
<ul class="navList" title="Navigation">
|
||||
<li><a href="../index.html">Overview</a></li>
|
||||
<li><a href="package-summary.html">Package</a></li>
|
||||
<li>Class</li>
|
||||
<li class="navBarCell1Rev">Tree</li>
|
||||
<li><a href="../index-all.html">Index</a></li>
|
||||
<li><a href="../help-doc.html">Help</a></li>
|
||||
</ul>
|
||||
</div>
|
||||
<div class="subNav">
|
||||
<ul class="navList" id="allclasses_navbar_bottom">
|
||||
<li><a href="../allclasses.html">All Classes</a></li>
|
||||
</ul>
|
||||
<div>
|
||||
<script type="text/javascript"><!--
|
||||
allClassesLink = document.getElementById("allclasses_navbar_bottom");
|
||||
if(window==top) {
|
||||
allClassesLink.style.display = "block";
|
||||
}
|
||||
else {
|
||||
allClassesLink.style.display = "none";
|
||||
}
|
||||
//-->
|
||||
</script>
|
||||
<noscript>
|
||||
<div>JavaScript is disabled on your browser.</div>
|
||||
</noscript>
|
||||
</div>
|
||||
<a id="skip.navbar.bottom">
|
||||
<!-- -->
|
||||
</a></div>
|
||||
<!-- ======== END OF BOTTOM NAVBAR ======= -->
|
||||
</nav>
|
||||
</footer>
|
||||
</body>
|
||||
</html>
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue