Berack/upo-graphs
0
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 1 Wiki Activity
Files
master
upo-graphs/doc/index-files/index-4.html
Giacomo Bertolazzi ddc81330ab dsadasdasd 
* added a method where you can get all the marks
* implemented and tested
* moved main
* changed README
* builded JavaDoc
* builded jar
2019-06-21 23:50:34 +02:00

205 lines
14 KiB
HTML
Raw Permalink Blame History

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<!-- NewPage -->
<html lang="en">
<head>
<!-- Generated by javadoc (1.8.0_144) on Fri Jun 21 23:35:58 CEST 2019 -->
<title>D-Index</title>
<meta name="date" content="2019-06-21">
<link rel="stylesheet" type="text/css" href="../stylesheet.css" title="Style">
<script type="text/javascript" src="../script.js"></script>
</head>
<body>
<script type="text/javascript"><!--
try {
if (location.href.indexOf('is-external=true') == -1) {
parent.document.title="D-Index";
}
}
catch(err) {
}
//-->
</script>
<noscript>
<div>JavaScript is disabled on your browser.</div>
</noscript>
<!-- ========= START OF TOP NAVBAR ======= -->
<div class="topNav"><a name="navbar.top">
<!-- -->
</a>
<div class="skipNav"><a href="#skip.navbar.top" title="Skip navigation links">Skip navigation links</a></div>
<a name="navbar.top.firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../overview-summary.html">Overview</a></li>
<li>Package</li>
<li>Class</li>
<li>Use</li>
<li><a href="../overview-tree.html">Tree</a></li>
<li><a href="../deprecated-list.html">Deprecated</a></li>
<li class="navBarCell1Rev">Index</li>
<li><a href="../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li><a href="index-3.html">Prev Letter</a></li>
<li><a href="index-5.html">Next Letter</a></li>
</ul>
<ul class="navList">
<li><a href="../index.html?index-files/index-4.html" target="_top">Frames</a></li>
<li><a href="index-4.html" target="_top">No&nbsp;Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_top">
<li><a href="../allclasses-noframe.html">All&nbsp;Classes</a></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>
</div>
<a name="skip.navbar.top">
<!-- -->
</a></div>
<!-- ========= END OF TOP NAVBAR ========= -->
<div class="contentContainer"><a href="index-1.html">A</a>&nbsp;<a href="index-2.html">B</a>&nbsp;<a href="index-3.html">C</a>&nbsp;<a href="index-4.html">D</a>&nbsp;<a href="index-5.html">E</a>&nbsp;<a href="index-6.html">F</a>&nbsp;<a href="index-7.html">G</a>&nbsp;<a href="index-8.html">H</a>&nbsp;<a href="index-9.html">I</a>&nbsp;<a href="index-10.html">K</a>&nbsp;<a href="index-11.html">L</a>&nbsp;<a href="index-12.html">M</a>&nbsp;<a href="index-13.html">N</a>&nbsp;<a href="index-14.html">O</a>&nbsp;<a href="index-15.html">P</a>&nbsp;<a href="index-16.html">R</a>&nbsp;<a href="index-17.html">S</a>&nbsp;<a href="index-18.html">T</a>&nbsp;<a href="index-19.html">U</a>&nbsp;<a href="index-20.html">V</a>&nbsp;<a href="index-21.html">W</a>&nbsp;<a name="I:D">
<!-- -->
</a>
<h2 class="title">D</h2>
<dl>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/Graph.html#degree-V-">degree(V)</a></span> - Method in interface berack96.lib.graph.<a href="../berack96/lib/graph/Graph.html" title="interface in berack96.lib.graph">Graph</a></dt>
<dd>
<div class="block">Tells the degree of a vertex.<br>
The degree of a vertex is the quantity of edges that have.<br>
Basically, it'll count how many edge it have.</div>
</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/impl/AdjGraph.html#degree-V-">degree(V)</a></span> - Method in class berack96.lib.graph.impl.<a href="../berack96/lib/graph/impl/AdjGraph.html" title="class in berack96.lib.graph.impl">AdjGraph</a></dt>
<dd>&nbsp;</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/impl/MapGraph.html#degree-V-">degree(V)</a></span> - Method in class berack96.lib.graph.impl.<a href="../berack96/lib/graph/impl/MapGraph.html" title="class in berack96.lib.graph.impl">MapGraph</a></dt>
<dd>&nbsp;</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/impl/MatrixGraph.html#degree-V-">degree(V)</a></span> - Method in class berack96.lib.graph.impl.<a href="../berack96/lib/graph/impl/MatrixGraph.html" title="class in berack96.lib.graph.impl">MatrixGraph</a></dt>
<dd>&nbsp;</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/Graph.html#degreeIn-V-">degreeIn(V)</a></span> - Method in interface berack96.lib.graph.<a href="../berack96/lib/graph/Graph.html" title="interface in berack96.lib.graph">Graph</a></dt>
<dd>
<div class="block">Tells the degree of all the edges that goes to this vertex.<br>
Basically, it'll count how many edge towards himself it have.</div>
</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/impl/AdjGraph.html#degreeIn-V-">degreeIn(V)</a></span> - Method in class berack96.lib.graph.impl.<a href="../berack96/lib/graph/impl/AdjGraph.html" title="class in berack96.lib.graph.impl">AdjGraph</a></dt>
<dd>&nbsp;</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/impl/MapGraph.html#degreeIn-V-">degreeIn(V)</a></span> - Method in class berack96.lib.graph.impl.<a href="../berack96/lib/graph/impl/MapGraph.html" title="class in berack96.lib.graph.impl">MapGraph</a></dt>
<dd>&nbsp;</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/impl/MatrixGraph.html#degreeIn-V-">degreeIn(V)</a></span> - Method in class berack96.lib.graph.impl.<a href="../berack96/lib/graph/impl/MatrixGraph.html" title="class in berack96.lib.graph.impl">MatrixGraph</a></dt>
<dd>&nbsp;</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/Graph.html#degreeOut-V-">degreeOut(V)</a></span> - Method in interface berack96.lib.graph.<a href="../berack96/lib/graph/Graph.html" title="interface in berack96.lib.graph">Graph</a></dt>
<dd>
<div class="block">Tells the degree of all the edges that goes form this vertex to others.<br>
Basically, it'll count how many edge towards any other vertex it have.</div>
</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/impl/AdjGraph.html#degreeOut-V-">degreeOut(V)</a></span> - Method in class berack96.lib.graph.impl.<a href="../berack96/lib/graph/impl/AdjGraph.html" title="class in berack96.lib.graph.impl">AdjGraph</a></dt>
<dd>&nbsp;</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/impl/MapGraph.html#degreeOut-V-">degreeOut(V)</a></span> - Method in class berack96.lib.graph.impl.<a href="../berack96/lib/graph/impl/MapGraph.html" title="class in berack96.lib.graph.impl">MapGraph</a></dt>
<dd>&nbsp;</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/impl/MatrixGraph.html#degreeOut-V-">degreeOut(V)</a></span> - Method in class berack96.lib.graph.impl.<a href="../berack96/lib/graph/impl/MatrixGraph.html" title="class in berack96.lib.graph.impl">MatrixGraph</a></dt>
<dd>&nbsp;</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/models/EdgeSaveStructure.html#dest">dest</a></span> - Variable in class berack96.lib.graph.models.<a href="../berack96/lib/graph/models/EdgeSaveStructure.html" title="class in berack96.lib.graph.models">EdgeSaveStructure</a></dt>
<dd>&nbsp;</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/view/edge/EdgeComponent.html#destination">destination</a></span> - Variable in class berack96.lib.graph.view.edge.<a href="../berack96/lib/graph/view/edge/EdgeComponent.html" title="class in berack96.lib.graph.view.edge">EdgeComponent</a></dt>
<dd>&nbsp;</dd>
<dt><a href="../berack96/lib/graph/visit/impl/DFS.html" title="class in berack96.lib.graph.visit.impl"><span class="typeNameLink">DFS</span></a>&lt;<a href="../berack96/lib/graph/visit/impl/DFS.html" title="type parameter in DFS">V</a>,<a href="../berack96/lib/graph/visit/impl/DFS.html" title="type parameter in DFS">W</a> extends java.lang.Number&gt; - Class in <a href="../berack96/lib/graph/visit/impl/package-summary.html">berack96.lib.graph.visit.impl</a></dt>
<dd>
<div class="block">Depth-first search<br>
The algorithm starts at the root node and explores as far as possible along each branch before backtracking.</div>
</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/visit/impl/DFS.html#DFS--">DFS()</a></span> - Constructor for class berack96.lib.graph.visit.impl.<a href="../berack96/lib/graph/visit/impl/DFS.html" title="class in berack96.lib.graph.visit.impl">DFS</a></dt>
<dd>&nbsp;</dd>
<dt><a href="../berack96/lib/graph/visit/impl/Dijkstra.html" title="class in berack96.lib.graph.visit.impl"><span class="typeNameLink">Dijkstra</span></a>&lt;<a href="../berack96/lib/graph/visit/impl/Dijkstra.html" title="type parameter in Dijkstra">V</a>,<a href="../berack96/lib/graph/visit/impl/Dijkstra.html" title="type parameter in Dijkstra">W</a> extends java.lang.Number&gt; - Class in <a href="../berack96/lib/graph/visit/impl/package-summary.html">berack96.lib.graph.visit.impl</a></dt>
<dd>
<div class="block">Class that implements the Dijkstra algorithm and uses it for getting all the distance from a source</div>
</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/visit/impl/Dijkstra.html#Dijkstra--">Dijkstra()</a></span> - Constructor for class berack96.lib.graph.visit.impl.<a href="../berack96/lib/graph/visit/impl/Dijkstra.html" title="class in berack96.lib.graph.visit.impl">Dijkstra</a></dt>
<dd>&nbsp;</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/Graph.html#distance-V-V-">distance(V, V)</a></span> - Method in interface berack96.lib.graph.<a href="../berack96/lib/graph/Graph.html" title="interface in berack96.lib.graph">Graph</a></dt>
<dd>
<div class="block">Get the minimum path from the source vertex to the destination vertex.<br>
If the source vertex can't reach the destination, then an exception is thrown.</div>
</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/Graph.html#distance-V-">distance(V)</a></span> - Method in interface berack96.lib.graph.<a href="../berack96/lib/graph/Graph.html" title="interface in berack96.lib.graph">Graph</a></dt>
<dd>
<div class="block">Get the minimum path from the source vertex to all the possible reachable vertices.</div>
</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/impl/AdjGraph.html#distance-V-V-">distance(V, V)</a></span> - Method in class berack96.lib.graph.impl.<a href="../berack96/lib/graph/impl/AdjGraph.html" title="class in berack96.lib.graph.impl">AdjGraph</a></dt>
<dd>&nbsp;</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/impl/AdjGraph.html#distance-V-">distance(V)</a></span> - Method in class berack96.lib.graph.impl.<a href="../berack96/lib/graph/impl/AdjGraph.html" title="class in berack96.lib.graph.impl">AdjGraph</a></dt>
<dd>&nbsp;</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/impl/MapGraph.html#distance-V-V-">distance(V, V)</a></span> - Method in class berack96.lib.graph.impl.<a href="../berack96/lib/graph/impl/MapGraph.html" title="class in berack96.lib.graph.impl">MapGraph</a></dt>
<dd>&nbsp;</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/impl/MapGraph.html#distance-V-">distance(V)</a></span> - Method in class berack96.lib.graph.impl.<a href="../berack96/lib/graph/impl/MapGraph.html" title="class in berack96.lib.graph.impl">MapGraph</a></dt>
<dd>&nbsp;</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/impl/MatrixGraph.html#distance-V-V-">distance(V, V)</a></span> - Method in class berack96.lib.graph.impl.<a href="../berack96/lib/graph/impl/MatrixGraph.html" title="class in berack96.lib.graph.impl">MatrixGraph</a></dt>
<dd>&nbsp;</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/impl/MatrixGraph.html#distance-V-">distance(V)</a></span> - Method in class berack96.lib.graph.impl.<a href="../berack96/lib/graph/impl/MatrixGraph.html" title="class in berack96.lib.graph.impl">MatrixGraph</a></dt>
<dd>&nbsp;</dd>
<dt><span class="memberNameLink"><a href="../berack96/lib/graph/visit/VisitDistSourceDest.html#distance-berack96.lib.graph.Graph-V-V-">distance(Graph&lt;V, W&gt;, V, V)</a></span> - Method in interface berack96.lib.graph.visit.<a href="../berack96/lib/graph/visit/VisitDistSourceDest.html" title="interface in berack96.lib.graph.visit">VisitDistSourceDest</a></dt>
<dd>
<div class="block">Get the distance from the source to the destination<br>
The list contains the minimum path from the vertex marked as source to the destination vertex</div>
</dd>
</dl>
<a href="index-1.html">A</a>&nbsp;<a href="index-2.html">B</a>&nbsp;<a href="index-3.html">C</a>&nbsp;<a href="index-4.html">D</a>&nbsp;<a href="index-5.html">E</a>&nbsp;<a href="index-6.html">F</a>&nbsp;<a href="index-7.html">G</a>&nbsp;<a href="index-8.html">H</a>&nbsp;<a href="index-9.html">I</a>&nbsp;<a href="index-10.html">K</a>&nbsp;<a href="index-11.html">L</a>&nbsp;<a href="index-12.html">M</a>&nbsp;<a href="index-13.html">N</a>&nbsp;<a href="index-14.html">O</a>&nbsp;<a href="index-15.html">P</a>&nbsp;<a href="index-16.html">R</a>&nbsp;<a href="index-17.html">S</a>&nbsp;<a href="index-18.html">T</a>&nbsp;<a href="index-19.html">U</a>&nbsp;<a href="index-20.html">V</a>&nbsp;<a href="index-21.html">W</a>&nbsp;</div>
<!-- ======= START OF BOTTOM NAVBAR ====== -->
<div class="bottomNav"><a name="navbar.bottom">
<!-- -->
</a>
<div class="skipNav"><a href="#skip.navbar.bottom" title="Skip navigation links">Skip navigation links</a></div>
<a name="navbar.bottom.firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../overview-summary.html">Overview</a></li>
<li>Package</li>
<li>Class</li>
<li>Use</li>
<li><a href="../overview-tree.html">Tree</a></li>
<li><a href="../deprecated-list.html">Deprecated</a></li>
<li class="navBarCell1Rev">Index</li>
<li><a href="../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li><a href="index-3.html">Prev Letter</a></li>
<li><a href="index-5.html">Next Letter</a></li>
</ul>
<ul class="navList">
<li><a href="../index.html?index-files/index-4.html" target="_top">Frames</a></li>
<li><a href="index-4.html" target="_top">No&nbsp;Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_bottom">
<li><a href="../allclasses-noframe.html">All&nbsp;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>
</div>
<a name="skip.navbar.bottom">
<!-- -->
</a></div>
<!-- ======== END OF BOTTOM NAVBAR ======= -->
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink