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.

[Question] Best option for moving nodes in real time

See original GitHub issue

This question is extremely similar to #376

I would like to move nodes around within a session with new location info that is not known ahead of time. Looking over the mobility section (link) it seems like ns-2 scripting and EMANE events are not viable options since they rely on locations being compiled before runtime.

Expanding on #376:

  1. Using the setposition() method of CoreNode, can I just move the nodes around within a while loop whenever new location info comes in? e.g.
# Setup session
node = session.add_node(CoreNode)

while True:
	if new_location_info:
	        node.setposition(x=new_x, y=new_y)
  1. Has there been any update to the gRPC documentation, besides link? gRPC seems to be the solution landed on in #376

Issue Analytics

  • State:closed
  • Created 3 years ago
  • Comments:12 (7 by maintainers)

github_iconTop GitHub Comments

bharndencommented, Jul 16, 2020

They are updated on develop branch now and yes gRPC would likely be the best. The assumed behavior for relative links working, only works within the repo and when the documentation pages are generated it broke the links =(.

On develop I am making the links hard coded to master, for better or worse =(.

If you look at the doc file directly, they will work:

The specific method you likely care about is:

Which is using the grpc call:

lemon-lymancommented, Aug 6, 2020

Apologies for the delay.

I just did a clean install of an Ubuntu 20.04 VM and CORE 7.0.1. After changing the InterfaceHelper.create_interface() method to .create_iface() to accommodate for 7.0.1, the above script worked as expected. Thanks for your help!

Read more comments on GitHub >

github_iconTop Results From Across the Web

Moving structure elements from one node level to another? is ...
Hi All, In SOLAR01, we currently have a structure that is 4-level deep (from Project -- > Scenario --> B. Process --> Process...
Read more >
6 Best Network Topologies Explained - Pros & Cons [Including ...
Discover the 6 main types of Network Topology, learn the Pros & Cons of each. We also look at which topology is best...
Read more >
Best First Search Algorithm in AI | Concept, Implementation ...
The best First Search algorithm in artificial intelligence is used for for finding the shortest path from a given starting node to a...
Read more >
Find first node of loop in a linked list - GeeksforGeeks
2. Move both slow and fast pointers one node at a time. 3. The point at which they meet is the start of...
Read more >
Top Linked List Interview Questions (2022) - InterviewBit
Now, one element at a time, move each pointer. ... Why is merge sort a better option than quicksort for linked lists?
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 Post

No results found

github_iconTop Related Hashnode Post

No results found