Is there a language (or language spec) to extract elements from a DAG [closed] - directed-acyclic-graphs

Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
Questions asking us to recommend or find a tool, library or favorite off-site resource are off-topic for Stack Overflow as they tend to attract opinionated answers and spam. Instead, describe the problem and what has been done so far to solve it.
Closed 8 years ago.
Improve this question
I have a problem where I have a huge number of DAGs and I have to visit each DAG, and extract many different sets of items.
This may sound a bit abstract so let me use an example. Xpath or JSONPath are languages that specify how i can extract an element from an xml document or a json document. They are an efficient way to represent a specific element from such a document. So if I had a huge number of xml documents and I wanted to allow consumers to specify what they want from each document, I would have them provide me with an xpath expression and I would use that to provide each of them the element they are looking for from every document.
In this case I have many DAGs and my consumers each want to extract several items from each DAG (not just one item). I'm trying to design a specification whereby people can represent what they want from each such DAG (with the ability to specify specific elements, with predicates of different complexity). I'm wondering if there already is a language spec that makes sense for the purpose I'm describing.
If this does not exist for DAGs, but exists for Trees, that too would be very useful.

Related

Which place api service giving more accurate data [closed]

Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
Questions asking us to recommend or find a tool, library or favorite off-site resource are off-topic for Stack Overflow as they tend to attract opinionated answers and spam. Instead, describe the problem and what has been done so far to solve it.
Closed 9 years ago.
Improve this question
I'm working windows phone app and going to use place api from web service and after doing some searching I get 3 web service : here place api, google place api, and foursquare api... so which one have the most accurate, informative data for user and location coverage?
Accurate and Informative are subjective terms. Informative in what way? Is it breadth of data you are after (i.e. most locations) or depth (most information about a place, more reviews, pictures etc.) or freshness (weeding out closed places, updating phone numbers etc.) Must the location be precise down to eight decimal places or is four good enough? What use is excellent coverage in Europe say, if the market for my app is based in Indonesia? and so on.
In my opinion, your best option here would be to run a simple beauty contest as described in a similar question here and base the results on the factors that are most important to you.

Qt Graph Drawing [closed]

Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
Questions asking us to recommend or find a tool, library or favorite off-site resource are off-topic for Stack Overflow as they tend to attract opinionated answers and spam. Instead, describe the problem and what has been done so far to solve it.
Closed 9 years ago.
Improve this question
I've recently begun development on a project that requires me to visualize graphs, and I am looking for a decent algorithm to tackle this problem.
The graphs I'm drawing model data flow, so a reasonable drawing could be left-to-right or top-to-bottom. They are, of course, directed and mostly acyclic -- that is, there might be a few backwards edges, but these would be a small proportion and I would be happy to remove these before calculating vertex positions if having a DAG as input would substantially improve runtime.
I'm using C++ and Qt for this project and am already very familiar with the Elastic Nodes and the Diagram Scene examples Qt provides. If anyone has seen KCacheGrind, what I'm trying to do is similar to its call graph visualization.
My current attempts have included an original algorithm that assigns each node to a layer based on its minimum distance from the root and then tries to position the nodes inside each layer in such a way that edge crossings are minimized. I was unable to implement the last part of that correctly, and I believe the problem to be NP-Hard.
What I'm looking for is guidance as to what kinds of algorithms have been used to efficiently solve this problem in the past.
I'd suggest using QGraphicsScene to implement directed acyclic graph. Also please check these links to help you out with implementation:
https://github.com/qknight/automate
http://invalidmagic.wordpress.com/2009/12/10/qgraphicsscene-used-as-a-qabstractitemmodel/
http://socnetv.sourceforge.net/

Is there a software project index? [closed]

Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
Questions asking us to recommend or find a tool, library or favorite off-site resource are off-topic for Stack Overflow as they tend to attract opinionated answers and spam. Instead, describe the problem and what has been done so far to solve it.
Closed 8 years ago.
Improve this question
I am working on a platform to collect various data of software projects (e.g. code repository, issues, etc). Now I would like to create an index over software project, but before I do so on my own, I wanted to ask whether such an index already exists.
Ideally, such an index would list various (open source) software projects and offer data and URLs related to them. What I would need is at least the project name as well as the URLs to the code repository and to the issue tracker. An API to gather this information then would make it perfect.
Is anybody aware of such an index?
Have you come across ohloh.net? It's the closest thing I can think of from what you have stated.

List of C++ libraries for Graph Theory [closed]

Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
Questions asking us to recommend or find a tool, library or favorite off-site resource are off-topic for Stack Overflow as they tend to attract opinionated answers and spam. Instead, describe the problem and what has been done so far to solve it.
Closed 9 years ago.
Improve this question
I'm going to start a scientific project about automata and graph theory, and I'm searching for a graph library that supports features like:
directed/undirected graphs
graph isomorphism test (i.e. is graph g1 isomorphic w.r.t. g2?)
subgraph isomorphism test (i.e. is a graph g1 isomorphic to a subgraph of g2?)
graph search, visits and such
possibly, quite fast since I need to make some serious computations
I know about the Boost Graph Library, but it lacks subgraph testing as far as I understood from its documentation.
So, my question is: which are the best c++ graph libraries, please?
They do not have to provide support for every feature I need, I know it's certainly possible that no existing library fits perfectly my needs.
You could use iGraph: http://igraph.sourceforge.net/ which is a C library which should satisfy what you are after.
There is also http://ubietylab.net/ubigraph/, there is a related SO post here: https://stackoverflow.com/questions/2751826/which-c-graph-library-should-i-use.
I have not used ubigraph so cannot comment on that, I mainly use networkX and iGraph
UPDATE
It seems that ubigraph is dead now so only igraph is maintained currently
You may use Cliquer library http://users.tkk.fi/pat/cliquer.html for all calculations related to finding cliques.

Can anyone recommend a concurrent, real-time diagramming/flowchart collaboration tool? [closed]

Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
Questions asking us to recommend or find a tool, library or favorite off-site resource are off-topic for Stack Overflow as they tend to attract opinionated answers and spam. Instead, describe the problem and what has been done so far to solve it.
Closed 9 years ago.
Improve this question
I'm looking to work with others to quickly build a rather large class flow diagram that may or may not be strict UML. Can anyone recommend a networked, concurrent collaboration tool for such a task? Price is not an issue, but the target system must be Windows.
Surely someone must have done something like this in the past.
Any ideas?
DabbleBoard has an online diagramming tool that may do what you want. It should work on Windows, although it is a web-based and fairly low-level.
I don't know exactly how concurrent you need it, but Google Docs have just introduced a 'drawing' document type, which is basically a stencil based system like visio. It includes flowchart elements, and of course can be shared.