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.

[FEATURE] New Graph Selection/Inspection Policy: Node, Linked Edges, and Linked Nodes

See original GitHub issue

I am currently using the NodesAndLinkedEdges() policy for my graph inspection policy and selection policy. Currently, a node is selected, and it becomes highlighted along with every edge leading in or out of that node. However, I want every node attached to the highlighted edges to also be highlighted.

If someone could help clarify where exactly the NodesAndLinkedEdges() class is actually implemented, I would consider doing this myself, as my feature request is an extension from that class.

It could be called NodesLinkedEdgesandLinkedNodes().

Issue Analytics

  • State:open
  • Created 4 years ago
  • Comments:15 (6 by maintainers)

github_iconTop GitHub Comments

1reaction
bryevdvcommented, Jan 19, 2022

@ortanative Since it would only appear in a 3.x release, and there is an entire discussion about redesigning how graph selections work (https://github.com/bokeh/bokeh/discussions/11952) it is a few months away, at the least.

1reaction
Pranav143commented, Dec 7, 2021

Hey folks! I see this issue is open and would love to take a shot at it

Read more comments on GitHub >

github_iconTop Results From Across the Web

Graphs in Data Structure: Overview, Types and More [Updated]
A graph is a non-linear kind of data structure made up of nodes or vertices and edges. The edges connect any two nodes...
Read more >
Edge List, Adjacency List, Adjacency Matrix - Why Graphs ...
In this implementation, the underlying data structure for keeping track of all the nodes and edges is a single list of pairs. Each...
Read more >
Graph in petgraph::graph - Rust - Docs.rs
The graph maintains indices for nodes and edges, and node and edge weights may be accessed mutably. Indices range in a compact interval,...
Read more >
StellarGraph API — StellarGraph 1.3.0b documentation
Obtains the collection of neighbouring nodes connected to the given node as an ... method) selecting two nodes in the graph and then...
Read more >
Graph and its representations - GeeksforGeeks
A graph is a data structure that consists of the following two components: 1. A finite set of vertices also called as nodes....
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