quickgraph | 易学教程

Saving a wpf layout to pdf using pdfsharp, c#

阅读更多关于 Saving a wpf layout to pdf using pdfsharp, c#

问题 I'm new to c#, wpf and the pdfsharp library. This is my XAML Code: <Grid> <zoom:ZoomControl> <graphsharp:GraphLayout x:Name="graphLayout" Graph="{Binding ElementName=root, Path=GraphToVisualize}" LayoutAlgorithmType="FR" OverlapRemovalAlgorithmType="FSA" HighlightAlgorithmType="Simple"></graphsharp:GraphLayout> </zoom:ZoomControl> <Button Content="Button" Height="23" Name="button1" Width="75" Margin="12,294,658,412" Click="button1_Click" /> </Grid> I want now save my "graphLayout" to a pdf

QuickGraph - How can I associate an Edge with a Class? (i.e. like you can with a Vertex)

阅读更多关于 QuickGraph - How can I associate an Edge with a Class? (i.e. like you can with a Vertex)

问题 Q1 - How can I associate an Edge with a Class? (i.e. like you can with a Vertex) In my case there are various types of edges I want to be able to model. So my real question I guess is how can I associate some level of data with Edges (e.g. edge type). The graph I was looking at using was: http://quickgraph.codeplex.com/wikipage?title=BidirectionalGraph&referringTitle=Documentation thanks 回答1: An edge by default only connects two vertices on the graph. If you need more information associated

can QuickGraph support these requirements? (includes database persistence support)

阅读更多关于 can QuickGraph support these requirements? (includes database persistence support)

问题 Would QuickGraph be able to help me out with my requirements below? (a) want to model a graph of nodes and directional relationships between nodes - for example to model web pages/files linked under a URL, or modeling IT infrastructure and dependencies between hardware/software. The library would 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

QuickGraph - How can I associate an Edge with a Class? (i.e. like you can with a Vertex)

阅读更多关于 QuickGraph - How can I associate an Edge with a Class? (i.e. like you can with a Vertex)

Q1 - How can I associate an Edge with a Class? (i.e. like you can with a Vertex) In my case there are various types of edges I want to be able to model. So my real question I guess is how can I associate some level of data with Edges (e.g. edge type). The graph I was looking at using was: http://quickgraph.codeplex.com/wikipage?title=BidirectionalGraph&referringTitle=Documentation thanks An edge by default only connects two vertices on the graph. If you need more information associated with an edge (i.e. a "Relationship"), you can implement the IEdge<T> interfaces or subclass Edge<T> . Then,

How to set target vertex in QuickGraph Dijkstra or A*

阅读更多关于 How to set target vertex in QuickGraph Dijkstra or A*

问题 I am using QuickGraph version 3.6 and I found function SetRootVertex, but no SetTagretVertex. I need this because I am searching short paths in huge graph and this would speed up program a lot. Clases in question are DijkstraShortestPathAlgorithm and AStarShortestPathAlgorithm. 回答1: I don't think there is a way to this without using events. You could wrap the necessary code in one extension method, making things clear, e.g.: public static class Extensions { class AStarWrapper<TVertex, TEdge>

How to set target vertex in QuickGraph Dijkstra or A*

阅读更多关于 How to set target vertex in QuickGraph Dijkstra or A*

I am using QuickGraph version 3.6 and I found function SetRootVertex, but no SetTagretVertex. I need this because I am searching short paths in huge graph and this would speed up program a lot. Clases in question are DijkstraShortestPathAlgorithm and AStarShortestPathAlgorithm. I don't think there is a way to this without using events. You could wrap the necessary code in one extension method, making things clear, e.g.: public static class Extensions { class AStarWrapper<TVertex, TEdge> where TEdge : IEdge<TVertex> { private TVertex target; private AStarShortestPathAlgorithm<TVertex, TEdge>

QuickGraph - is there algorithm for find all parents (up to root vertex's) of a set of vertex's

阅读更多关于 QuickGraph - is there algorithm for find all parents (up to root vertex's) of a set of vertex's

问题 In QuickGraph - is there algorithm for find all parents (up to root vertex's) of a set of vertex's. In other words all vertex's which have somewhere under them (on the way to the leaf nodes) one or more of the vertexs input. So if the vertexs were Nodes, and the edges were a depends on relationship, find all nodes that would be impacted by a given set of nodes. If not how hard is it to write one's own algorithms? 回答1: Here's what I've used to accomplish a predecessor search on a given vertex: