mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-07 01:35:16 +08:00
remove makefile and update docs
This commit is contained in:
@ -42,6 +42,9 @@ class AdjacencyListGraph<E extends Comparable<E>> {
|
|||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
* this method removes an edge from the graph between two specified
|
||||||
|
* verticies
|
||||||
|
*
|
||||||
* @param from the data of the vertex the edge is from
|
* @param from the data of the vertex the edge is from
|
||||||
* @param to the data of the vertex the edge is going to
|
* @param to the data of the vertex the edge is going to
|
||||||
* @return returns false if the edge doesn't exist, returns true if the edge exists and is removed
|
* @return returns false if the edge doesn't exist, returns true if the edge exists and is removed
|
||||||
@ -58,6 +61,9 @@ class AdjacencyListGraph<E extends Comparable<E>> {
|
|||||||
return fromV.removeAdjacentVertex(to);
|
return fromV.removeAdjacentVertex(to);
|
||||||
}
|
}
|
||||||
/**
|
/**
|
||||||
|
* this method adds an edge to the graph between two specified
|
||||||
|
* verticies
|
||||||
|
*
|
||||||
* @param from the data of the vertex the edge is from
|
* @param from the data of the vertex the edge is from
|
||||||
* @param to the data of the vertex the edge is going to
|
* @param to the data of the vertex the edge is going to
|
||||||
* @return returns true if the edge did not exist, return false if it already did
|
* @return returns true if the edge did not exist, return false if it already did
|
||||||
@ -84,6 +90,7 @@ class AdjacencyListGraph<E extends Comparable<E>> {
|
|||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
* this gives a list of verticies in the graph and their adjacencies
|
||||||
*
|
*
|
||||||
* @return returns a string describing this graph
|
* @return returns a string describing this graph
|
||||||
*/
|
*/
|
||||||
|
@ -1,3 +0,0 @@
|
|||||||
test:
|
|
||||||
javac Graphs.java
|
|
||||||
java -ea Graphs
|
|
Reference in New Issue
Block a user