File tree Expand file tree Collapse file tree 3 files changed +5
-5
lines changed Expand file tree Collapse file tree 3 files changed +5
-5
lines changed Original file line number Diff line number Diff line change @@ -80,7 +80,7 @@ public function getDegreeMax()
80
80
public function isRegular ()
81
81
{
82
82
// an empty graph is considered regular
83
- if ($ this ->graph ->isEmpty ()) {
83
+ if ($ this ->graph ->getVertices ()-> isEmpty ()) {
84
84
return true ;
85
85
}
86
86
try {
Original file line number Diff line number Diff line change @@ -73,13 +73,13 @@ public function getVertexRoot()
73
73
* checks if this is a tree
74
74
*
75
75
* @return boolean
76
- * @uses Graph ::isEmpty() to skip empty Graphs (an empty Graph is a valid tree)
76
+ * @uses Vertices ::isEmpty() to skip empty Graphs (an empty Graph is a valid tree)
77
77
* @uses self::getVertexRoot() to get root Vertex to start search from
78
78
* @uses self::getVerticesSubtree() to count number of vertices connected to root
79
79
*/
80
80
public function isTree ()
81
81
{
82
- if ($ this ->graph ->isEmpty ()) {
82
+ if ($ this ->graph ->getVertices ()-> isEmpty ()) {
83
83
return true ;
84
84
}
85
85
Original file line number Diff line number Diff line change @@ -49,13 +49,13 @@ class Undirected extends Tree
49
49
* checks if this is a tree
50
50
*
51
51
* @return boolean
52
- * @uses Graph ::isEmpty() to skip empty Graphs (an empty Graph is a valid tree)
52
+ * @uses Vertices ::isEmpty() to skip empty Graphs (an empty Graph is a valid tree)
53
53
* @uses Graph::getVertexFirst() to get get get random "root" Vertex to start search from
54
54
* @uses self::getVerticesSubtreeRecursive() to count number of vertices connected to root
55
55
*/
56
56
public function isTree ()
57
57
{
58
- if ($ this ->graph ->isEmpty ()) {
58
+ if ($ this ->graph ->getVertices ()-> isEmpty ()) {
59
59
return true ;
60
60
}
61
61
You can’t perform that action at this time.
0 commit comments