Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Increased code coverage #95

Merged
merged 33 commits into from
Mar 2, 2020
Merged
Show file tree
Hide file tree
Changes from 8 commits
Commits
Show all changes
33 commits
Select commit Hold shift + click to select a range
cde1601
improved tests
iamrajiv Feb 23, 2020
3789a66
imported raises
iamrajiv Feb 23, 2020
d10f50b
improved raises
iamrajiv Feb 23, 2020
f82517d
increased coverage in adjacency_matrix.py
iamrajiv Feb 23, 2020
c9a5682
increased coverage in adjacency_matrix.py
iamrajiv Feb 23, 2020
569daa2
increased coverage in adjacency_matrix.py
iamrajiv Feb 23, 2020
efeaeb8
increased coverage in adjacency_matrix.py
iamrajiv Feb 23, 2020
268c4e0
increased coverage in adjacency_matrix.py
iamrajiv Feb 23, 2020
72e9536
increased coverage in adjacency_matrix.py
iamrajiv Feb 23, 2020
384809d
increased coverage in queue
iamrajiv Feb 23, 2020
3822500
increased coverage in adjacency_matrix.py
iamrajiv Feb 23, 2020
526c45d
removed adjacencylist from global namespace
iamrajiv Feb 23, 2020
5aae92b
improved coverage in heaps.py
iamrajiv Feb 23, 2020
9887a24
improved coverage in heaps.py
iamrajiv Feb 23, 2020
92c82ec
reverted code in heaps.py
iamrajiv Feb 23, 2020
22b566c
improved coverage in binary trees
iamrajiv Feb 23, 2020
9f2612a
improved coverage in binary trees
iamrajiv Feb 23, 2020
33af38f
improved coverage in binary trees
iamrajiv Feb 23, 2020
25dba7c
improved coverage in binary trees
iamrajiv Feb 23, 2020
170f71a
improved coverage in binary trees
iamrajiv Feb 23, 2020
ab07685
improved coverage in binary trees
iamrajiv Feb 23, 2020
a180cb2
improved coverage in binary trees
iamrajiv Feb 23, 2020
2491551
improved coverage in binary trees
iamrajiv Feb 23, 2020
ba6e7d3
improved coverage in binary trees
iamrajiv Feb 23, 2020
76b9a2a
added .coveragerc and improved coverage
iamrajiv Feb 24, 2020
7bc77a7
removed unwanted codes
iamrajiv Feb 24, 2020
f2066fa
removed unwanted codes
iamrajiv Feb 24, 2020
936a680
removed unwanted codes
iamrajiv Feb 24, 2020
33e023f
merged coveragerc_travis in .coveragerc
iamrajiv Feb 24, 2020
119ffbf
removed unwanted files
iamrajiv Feb 25, 2020
3ab9560
updated .gitignore
iamrajiv Feb 25, 2020
65b09a2
updated .gitignore
iamrajiv Feb 25, 2020
d2458b9
deleted unwanted files
iamrajiv Feb 25, 2020
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 6 additions & 0 deletions pydatastructs/graphs/__init__.py
Original file line number Diff line number Diff line change
Expand Up @@ -11,3 +11,9 @@
AdjacencyList
)
__all__.extend(adjacency_list.__all__)

from . import adjacency_matrix
from .adjacency_matrix import (
AdjacencyMatrix
)
__all__.extend(adjacency_matrix.__all__)
iamrajiv marked this conversation as resolved.
Show resolved Hide resolved
2 changes: 2 additions & 0 deletions pydatastructs/graphs/tests/test_adjacency_list.py
Original file line number Diff line number Diff line change
@@ -1,5 +1,6 @@
from pydatastructs.graphs import Graph
from pydatastructs.utils import AdjacencyListGraphNode
from pydatastructs.utils.raises_util import raises

def test_adjacency_list():
v_1 = AdjacencyListGraphNode('v_1', 1)
Expand Down Expand Up @@ -32,3 +33,4 @@ def test_adjacency_list():
g.remove_vertex('v')
assert g.is_adjacent('v_2', 'v') is False
assert g.is_adjacent('v_3', 'v') is False
assert raises(NotImplementedError, lambda: Graph(implementation=''))
3 changes: 3 additions & 0 deletions pydatastructs/graphs/tests/test_adjacency_matrix.py
Original file line number Diff line number Diff line change
@@ -1,5 +1,7 @@
from pydatastructs.graphs import Graph
from pydatastructs.utils import AdjacencyMatrixGraphNode
from pydatastructs.utils.raises_util import raises
from pydatastructs.graphs import AdjacencyMatrix

def test_AdjacencyMatrix():
v_0 = AdjacencyMatrixGraphNode(0, 0)
Expand All @@ -19,3 +21,4 @@ def test_AdjacencyMatrix():
assert neighbors == [v_1]
g.remove_edge(0, 1)
assert g.is_adjacent(0, 1) is False
assert raises(NotImplementedError, lambda: Graph(implementation=''))