question-mark
Stuck on an issue?

Lightrun Answers was designed to reduce the constant googling that comes with debugging 3rd party libraries. It collects links to all the places you might be looking at while hunting down a tough bug.

And, if you’re still stuck at the end, we’re happy to hop on a call to see how we can help out.

Docs Issue: Flow.edges_from() and edges_to()

See original GitHub issue

They are documented as:

Returns:
dict with the key as the task passed in and the value as a set of all edges leading from that task

However their actual signature is not a dictionary, but rather:

    def edges_from(self, task: Task) -> Set[Edge]:

(which makes sense, as why pass task and then also index by task to get the edges you requested.)

Issue Analytics

  • State:closed
  • Created 3 years ago
  • Comments:5 (2 by maintainers)

github_iconTop GitHub Comments

1reaction
shaunccommented, Aug 9, 2020

Thanks @andykawabata ! You’re encouraging me by example. 😃

1reaction
cicdwcommented, Aug 9, 2020

Hi @andykawabata and welcome! Yes that would work; to better fit with our other doc Return signatures (which are of the form - type: description you might also do:

- Set: set of all edges leading from that task

but it’s not super important either way. Also note that this needs updating on both flow.edges_from and flow.edges_to 👍

Read more comments on GitHub >

github_iconTop Results From Across the Web

How do I loop dynamically over more than one task #3074
What I was trying to do is have them both raise "LOOP()", give them both state handlers ... a hack -- the problem...
Read more >
Edge Options API - React Flow
You create edges by adding them to your edges or defaultEdges array of the ReactFlow component.
Read more >
scipy.sparse.csgraph.maximum_flow — SciPy v1.9.3 Manual
This solves the maximum flow problem on a given directed weighted graph: A flow associates to every edge a value, also called a...
Read more >
flow augmentation in a directed network with the constraint ...
1 Answer 1 · Adjust capacity of every out edge to be equal to the minimum capacity of all out edges from the...
Read more >
Source code for networkx.algorithms.flow.maxflow
Source code for networkx.algorithms.flow.maxflow. """ Maximum flow (and minimum cut) algorithms on capacitated graphs.
Read more >

github_iconTop Related Medium Post

No results found

github_iconTop Related StackOverflow Question

No results found

github_iconTroubleshoot Live Code

Lightrun enables developers to add logs, metrics and snapshots to live code - no restarts or redeploys required.
Start Free

github_iconTop Related Reddit Thread

No results found

github_iconTop Related Hackernoon Post

No results found

github_iconTop Related Tweet

No results found

github_iconTop Related Dev.to Post

No results found

github_iconTop Related Hashnode Post

No results found