Skip to content

Add Graph.connected #131

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.

Sign up for GitHub

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

Merged
merged 2 commits into from
Oct 1, 2024
Merged

Add Graph.connected #131

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
fc4aec8
modify .gitignore
weilycoder Sep 30, 2024
0ae2aec
add Graph.connected
weilycoder Sep 30, 2024
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: 5 additions & 1 deletion .gitignore
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,7 @@
config.py
*.in
*.out
*.exe

# Created by .ignore support plugin (hsz.mobi)
### Python template
Expand Down Expand Up @@ -131,4 +132,7 @@ docs/_build/
target/

# Pycharm
venv
venv

# VS Code
.vscode
16 changes: 14 additions & 2 deletions cyaron/graph.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -290,7 +290,7 @@ def graph(point_count, edge_count, **kwargs):
@staticmethod
def DAG(point_count, edge_count, **kwargs):
"""DAG(point_count, edge_count, **kwargs) -> Graph
Factory method. Return a graph with point_count vertexes and edge_count edges.
Factory method. Return a directed connected graph with point_count vertexes and edge_count edges.
int point_count -> the count of vertexes
int edge_count -> the count of edges
**kwargs(Keyword args):
Expand Down Expand Up @@ -352,7 +352,7 @@ def DAG(point_count, edge_count, **kwargs):
@staticmethod
def UDAG(point_count, edge_count, **kwargs):
"""UDAG(point_count, edge_count, **kwargs) -> Graph
Factory method. Return a graph with point_count vertexes and edge_count edges.
Factory method. Return a undirected connected graph with point_count vertexes and edge_count edges.
int point_count -> the count of vertexes
int edge_count -> the count of edges
**kwargs(Keyword args):
Expand Down Expand Up @@ -402,6 +402,18 @@ def UDAG(point_count, edge_count, **kwargs):
i += 1

return graph

@staticmethod
def connected(point_count, edge_count, directed=False, **kwargs):
"""connected(point_count, edge_count, **kwargs) -> Graph
Factory method. Return a connected graph with point_count vertexes
int point_count -> the count of vertexes
bool directed -> whether the graph is directed
"""
if directed:
return Graph.DAG(point_count, edge_count, **kwargs)
else:
return Graph.UDAG(point_count, edge_count, **kwargs)

@staticmethod
def hack_spfa(point_count, **kwargs):
Expand Down