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

Fix typing error #1057

Closed
wants to merge 2 commits into from
Closed
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
2 changes: 1 addition & 1 deletion graspologic/layouts/colors.py
Expand Up @@ -159,7 +159,7 @@ def sequential_colors(
keys, values = zip(*node_and_value.items())

if use_log_scale:
values = map(math.log, values)
values = map(math.log, values) # type: ignore

np_values = np.array(values).reshape(1, -1)
new_values = minmax_scale(np_values, feature_range=(0, num_colors - 1), axis=1)
Expand Down
1 change: 1 addition & 0 deletions graspologic/pipeline/__init__.py
Expand Up @@ -15,6 +15,7 @@
is to bridge this gap.

"""

# Copyright (c) Microsoft Corporation.
# Licensed under the MIT license.

Expand Down
6 changes: 3 additions & 3 deletions graspologic/pipeline/embed/omnibus_embedding.py
Expand Up @@ -165,9 +165,9 @@ def omnibus_embedding_pairwise(
for graph in graphs[1:]:
union_graph.add_edges_from(graph.edges())

union_graph_lcc: Union[
nx.Graph, nx.Digraph, nx.OrderedGraph, nx.OrderedDiGraph
] = largest_connected_component(union_graph)
union_graph_lcc: Union[nx.Graph, nx.Digraph, nx.OrderedGraph, nx.OrderedDiGraph] = (
largest_connected_component(union_graph)
)
union_graph_lcc_nodes: Set[Any] = set(list(union_graph_lcc.nodes()))

union_node_ids = np.array(list(union_graph_lcc_nodes))
Expand Down