Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 814615
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 15, 20262026-05-15T01:33:01+00:00 2026-05-15T01:33:01+00:00

I have a very complex graph, and there is no way that I can

  • 0

I have a very complex graph, and there is no way that I can show it all and understand it. I need to make simplified versions of it showing only some nodes and not others. I don’t just want the other nodes to be invisible, but to really be absent (so that the graph is simplified).

The solution would be to make a graph with only some layers. But is that possible? What other options are there?

Thanks,
Pietro

  • 1 1 Answer
  • 1 View
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-15T01:33:01+00:00Added an answer on May 15, 2026 at 1:33 am

    I found a possible solution. It uses gvpr which is already installed if you have graphviz (at least it was in my machine).

    You can set up gvpr to read a .dot file, follow some instructions and produce another .dot file.

    So I added a property “tag=”TAGfoo TAGgoo TAGsoo”. There are probably better ways but since I need to use regular expression, this works well enough.

    Then the command:

    gvpr  -i 'N[tag=="(*TAGfoo*|*TAGgoo*)"]'  filesource.dot >fileproduced.dot
    

    will take all and only the nodes that have TAGfoo or TAGgoo.

    It could be made cleaner.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

We have a very complex Oracle package here (over 4,100 lines of code) that's
I have a very complex Linq to SQL query that returns a result set
We have a very complex config file for JSF managed beans that looks like
I have a very complex issue that Me and my coworker have been discussing
I've worked on projects that have very complex XML configuration, and one problem that's
I have written a very complex database migration script in Groovy, that runs just
I have a very complex MySQL query that includes use of the same subquery
I have a very complex input message whose node names and values I need
I have a very precise question: I want to make an android application that
I have a win32 project which is very complex and i successfully referenced that

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.