Issue with pgr_nodeNetwork Verification: Edges Table Not Found

pgRouting pgrouting-dev
1

Hello, @cvvergara @robe Actually I was solving issue#2628 and I was trying to verify my changes so I followed this documentation but this didn’t work properly : pgr_nodeNetwork — pgRouting Manual (3.7) . Could you please guide me with this. The error I faced is :

Saloni-2005_routing=# SELECT pgr_nodeNetwork(‘edges’, 0.001);
NOTICE: PROCESSING:
NOTICE: id: id
NOTICE: the_geom: the_geom
NOTICE: table_ending: noded
NOTICE: rows_where:
NOTICE: outall: f
NOTICE: pgr_nodeNetwork(‘edges’, 0.001, ‘id’, ‘the_geom’, ‘noded’, ‘’, f)
NOTICE: Performing checks, please wait …
NOTICE: -------> edges NOT found
pgr_nodenetwork

FAIL
(1 row)

Saloni-2005_routing=#
Could you please highlight what I did wrong or how to resolve?
Thankyou!

2

Do you have an edges table? That error sounds like it can’t find the edges table.

3

I don’t have actually. How can I create one ?

4

You can also create from real data which is detailed in the workshop pgr_NodeNetwork - 1. Prepare Data — Workshop - FOSS4G Belém - Routing with pgRouting
AS @cvvergara has stated before, the best way to understand pgrouting and to help is try to go thru the workshop and figure out what might be made clearer and make sure all the steps are followable.

Also Look at some of the sample data files in docqueries

like this one:

pgrouting/docqueries/src/sampledata.result at main · pgRouting/pgrouting · GitHub or

this one - pgrouting/docqueries/src/concepts.result at main · pgRouting/pgrouting · GitHub

5

pgr_nodeNetwork has a lot of problems.
Please skip that one.

6

Hello @robe , @cvvergara ,
I just wanted to know if I can add more pgtap test cases for pgr_topologicalSort and add raise its PR.
Thankyou!

7

Hello @Saloni-2005

Sure you can:

  • Edge cases are simple as possible
  • Use the sample data of the documentation when possible

Recommendation if they do not exist

  • Topological sort of an empty graph
  • Topological sort of a graph with one node graph
  • Topological sort of a graph with two nodes graph (one edge)
  • Topological sort of a graph with two nodes graph (two edges)
  • Topological sort of a graph with three nodes graph (a - b - c)
  • Topological sort of a graph with three nodes graph (a - b - c - a)
  • Topological sort of a graph with three nodes graph (a - {b, c})
  • Topological sort of a graph with three nodes graph (a - {b, c})
  • etc.

As many with no more than 5 nodes.

1 Like
8

@Saloni-2005 , please don’t forget you need t o compile develop branch from the main repository for task #3

9

Yes mam sure.

10

Hello @cvvergara mam,
Actually, I emailed you to review my proposal, but I haven’t received a response yet. Could you kindly take a look at it?

11

Found the mail got lost in between many mails I get.

Could not add comments to your proposal could only read.
I think I sent you a mail about requesting access.
but please make it to who has the link can add comments as I need to pass it to the other mentors.

12

Hello @cvvergara mam, I have updated the proposal after getting reviewed. Could you please review it again.