pgmodeler | source data modeling tool designed for PostgreSQL | Database library
kandi X-RAY | pgmodeler Summary
kandi X-RAY | pgmodeler Summary
pgModeler - PostgreSQL Database Modeler - is an open-source data modeling tool designed for PostgreSQL. No more typing DDL commands. Let pgModeler do the work for you! This software unites the concepts of entity-relationship diagrams and the features that PostgreSQL implements as extensions of SQL standards. It also counts with a minimalist but functional database server administration module which allows the execution of any sort of SQL commands, database objects browsing, and data handling in a simple and intuitive UI. For more details about additional features, screenshots, and other useful information, please, visit the project's official website. Please let me know how pgModeler is working on your system. Help improve this project, give your feedback about the software or report any bugs on the Issues page. Additionally, follow pgModeler on Twitter and be up-to-date with new features, fixes, and releases.
Support
Quality
Security
License
Reuse
Top functions reviewed by kandi - BETA
Currently covering the most popular Java, JavaScript and Python libraries. See a Sample of pgmodeler
pgmodeler Key Features
pgmodeler Examples and Code Snippets
Community Discussions
Trending Discussions on pgmodeler
QUESTION
I have custom data structures like this :
...ANSWER
Answered 2019-May-19 at 00:00The documentation for the Graph concepts is conveniently here: https://www.boost.org/doc/libs/1_70_0/libs/graph/doc/graph_concepts.html
So - you never told us what algorithms you intend to use.
So let me pick an examples: BFS. The docs say it requires:
A directed or undirected graph. The graph type must be a model of Vertex List Graph and Incidence Graph.
Looking at your pre-existing data structures, it looks like you only cover the Vertex List use case easily.
The edges are implemented more as an Edge List. It's not possible to emulate Incidence Graph from Edge List without runtime or storage overhead (that's mathematics, nothing to do with library or code quality).
In reality, it's pretty likely that you omitted parts of your pre-existing data-structures that are relevant to the problem, as most algorithms will be highly sub-optimal on just Vertex+Edge lists.
In practice I suppose you Edge list might be organized like a classical adjacency list (e.g. ordering by source vertex, so you CAN have a O(log(n)) lookup by source vertex).
For the example below I'm assuming this is the case. Keep in mind we're only approaching the complexity guarantees from Incidence Graph Concept:
Complexity guaranteesThe
source()
,target()
, andout_edges()
functions must all be constant time. Theout_degree()
function must be linear in the number of out-edges.To actually meet these requirements, you will need to have dedicated storage of out-edges per vertex
So, let'st have a go:
Mocking YourLibraryCommunity Discussions, Code Snippets contain sources that include Stack Exchange Network
Vulnerabilities
No vulnerabilities reported
Install pgmodeler
Support
Reuse Trending Solutions
Find, review, and download reusable Libraries, Code Snippets, Cloud APIs from over 650 million Knowledge Items
Find more librariesStay Updated
Subscribe to our newsletter for trending solutions and developer bootcamps
Share this Page