Can QuickGraph support these requirements? (includes support for saving the database)

Question

Can QuickGraph help me with my requirements below?

(a) want to simulate a graph of nodes and directed relationships between nodes — for example, to simulate web pages / files linked by URL, or to simulate IT infrastructure and dependencies between hardware / software. The library will include methods such as

* Node.GetDirectParents()   //i.e. there could be more than one direct parent for a node
* Node.GetRootParents()  //i.e. traverse the tree to the top root parent(s) for the given node
* Node.GetDirectChildren()
* Node.GetAllChildren()

(b) data must be stored in the database - therefore, it must support SQL Server and, ideally, SQLite.

If he supports these requirements, I would like to hear:

• any pointers to any parts of QuickGraph to search for?

• What is the best concept? use from the point of view of use database persistence is a simpler design so that the search / method works directly on the database or supports QuickGraph mind to be able to work in memory and “save” to the database all changes at the corresponding point in time (for example as ADO.net DataTable does, etc.)

Thanks in advance

Answer 1

Greg

and. Yes, Quickgraph can pretty easily search for nodes this way. I already gave one example in your other question .

. , SQL "" QuickGraph; . , , ( ) QuickGraph, .

• GraphML QuickGraph. .
• QuickGraph , "" ( ). , . , QuickGraph, VertexAdded, VertexRemoved, EdgeAdded EdgeRemoved, , , .

-Doug