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

Docs modification for better clarification #424

Merged
merged 6 commits into from
Oct 31, 2021
Merged

Docs modification for better clarification #424

merged 6 commits into from
Oct 31, 2021

Conversation

pratikgl
Copy link
Member

@pratikgl pratikgl commented Oct 26, 2021

Modified Docs to resolve discrepancies

References to other Issues or PRs or Relevant literature

Fixes #406
Fixes #423

Brief description of what is fixed or changed

Other comments

@codecov
Copy link

codecov bot commented Oct 26, 2021

Codecov Report

Merging #424 (32e07f5) into 0.0.1-alpha (9f22c7d) will decrease coverage by 0.050%.
The diff coverage is 81.818%.

@@                Coverage Diff                @@
##           0.0.1-alpha      #424       +/-   ##
=================================================
- Coverage       98.573%   98.523%   -0.051%     
=================================================
  Files               29        29               
  Lines             3646      3657       +11     
=================================================
+ Hits              3594      3603        +9     
- Misses              52        54        +2     
Impacted Files Coverage Δ
pydatastructs/graphs/graph.py 100.000% <ø> (ø)
pydatastructs/linear_data_structures/arrays.py 100.000% <ø> (ø)
pydatastructs/graphs/adjacency_matrix.py 97.916% <80.000%> (-2.084%) ⬇️
pydatastructs/graphs/adjacency_list.py 98.000% <83.333%> (-2.000%) ⬇️

Impacted file tree graph

@czgdp1807 czgdp1807 added documentation Improvements or additions to documentation enhancement New feature or request graphs hacktoberfest-accepted linear_data_structures labels Oct 27, 2021
Comment on lines 62 to 63
" the two methods." %(source))
elif not hasattr(self, target):
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
" the two methods." %(source))
elif not hasattr(self, target):
" the two methods." %(source))
if not hasattr(self, target):

" vertices on its own. This is done to maintain"
" clear separation between the functionality of"
" the two methods." %(target))
else:
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
else:

Comment on lines 56 to 62
raise ValueError("Vertex %s is not present in the graph."
" Call Graph.add_vertex() to add a new"
" vertex. Graph.add_edge is only responsible"
" for adding edges and it will not add new"
" vertices on its own. This is done to maintain"
" clear separation between the functionality of"
" the two methods." %(source))
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I think this whole string can be represented as msg = ("Vertex %s is not present in the graph." " Call Graph.add_vertex() to add a new" " vertex. Graph.add_edge is only responsible" " for adding edges and it will not add new" " vertices on its own. This is done to maintain" " clear separation between the functionality of" " the two methods.")
And then just do msg%(source). I am not sure if it's syntactically correct. But what I am trying to say is the both the messages only differ in the name of the vertex (source, target) rest of the stuff is same. So using a variable will be helpful to avoid repetition.

Comment on lines 53 to 59
Note
====
Steps to create a graph:
1. Create nodes (AdjacencyListGraphNode or AdjacencyListMatrixNode)
2. Add nodes to the graph
3. Add edges b/w these nodes

Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
Note
====
Steps to create a graph:
1. Create nodes (AdjacencyListGraphNode or AdjacencyListMatrixNode)
2. Add nodes to the graph
3. Add edges b/w these nodes
Note
====
Steps to create a graph:
1. Create nodes (AdjacencyListGraphNode or AdjacencyListMatrixNode).
2. Add nodes to the graph.
3. Add edges between these nodes.

@czgdp1807 czgdp1807 merged commit 94e96a2 into codezonediitj:0.0.1-alpha Oct 31, 2021
czgdp1807 added a commit that referenced this pull request Nov 14, 2021
* Changed version to 0.0.1-alpha

* pydatastructs -> pydatastructs_ for PyPI

* pydatasturcts_ -> cz-pydatastructs

* Removed incorrect topic

* Updated installation instructions on website

* Minor typo fix in documentation

* Doc improvements (ODA, DODA) and addition of checks in ``graph``  (#424)

* Made the API of ``RangeQueryStatic`` consistent (#425)

* Added notebook for California road network (#426)

* Added salient features of PyDataStructs (#428)

* Bumped to 0.0.1-beta

* Bumped to 0.0.1

* Updated for master

Co-authored-by: Pratik Goyal <pratikgoyal2712@gmail.com>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
documentation Improvements or additions to documentation enhancement New feature or request graphs linear_data_structures
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants