QuickGraph, Graph Data Structures And Algorithms for .Net

New Post: Vertex-Induced Subgraphs

pelikhan — Thu, 02 Jul 2009 14:32:07 GMT

The simply add the outedges into a new graph or build a new delegate-based graph our the currified outedges method.

On Thu, Jul 2, 2009 at 6:59 AM, Michael_Dorfman <notifications@codeplex.com> wrote:

From: Michael_Dorfman

I want all the edges that are present within that sub-graph. (My immediate plan is to look for cliques within the subgraph, as a start). So, if my target node has an out-degree of 10, I want all of the edges that exist between those 11 (10 + 1) vertices.

On Thu, Jul 2, 2009 at 3:56 PM, pelikhan <notifications@codeplex.com> wrote:

From: pelikhan

Do you just want to immediate adjacent edges or are you looking for the reachable edges (i.e. do a depth first search from that vertex)?

Read the full discussion online.

To add a post to this discussion, reply to this email (quickgraph@discussions.codeplex.com)

To start a new discussion for this project, email quickgraph@discussions.codeplex.com

You are receiving this email because you subscribed to this discussion on CodePlex. You can unsubscribe on codePlex.com.

Please note: Images and attachments will be removed from emails. Any posts to this discussion will also be available online at codeplex.com

Read the full discussion online.

To add a post to this discussion, reply to this email (quickgraph@discussions.codeplex.com)

To start a new discussion for this project, email quickgraph@discussions.codeplex.com

You are receiving this email because you subscribed to this discussion on CodePlex. You can unsubscribe or change your settings on codePlex.com.

Please note: Images and attachments will be removed from emails. Any posts to this discussion will also be available online at codeplex.com

--
This posting is provided "AS IS" with no warranties, and confers no rights.

New Post: Vertex-Induced Subgraphs

Michael_Dorfman — Thu, 02 Jul 2009 13:58:57 GMT

I want all the edges that are present within that sub-graph. (My immediate plan is to look for cliques within the subgraph, as a start). So, if my target node has an out-degree of 10, I want all of the edges that exist between those 11 (10 + 1) vertices.

On Thu, Jul 2, 2009 at 3:56 PM, pelikhan <notifications@codeplex.com> wrote:

From: pelikhan

Do you just want to immediate adjacent edges or are you looking for the reachable edges (i.e. do a depth first search from that vertex)?

Read the full discussion online.

To add a post to this discussion, reply to this email (quickgraph@discussions.codeplex.com)

To start a new discussion for this project, email quickgraph@discussions.codeplex.com

You are receiving this email because you subscribed to this discussion on CodePlex. You can unsubscribe on codePlex.com.

Please note: Images and attachments will be removed from emails. Any posts to this discussion will also be available online at codeplex.com

New Post: Vertex-Induced Subgraphs

pelikhan — Thu, 02 Jul 2009 13:56:47 GMT

Do you just want to immediate adjacent edges or are you looking for the reachable edges (i.e. do a depth first search from that vertex)?

New Post: Vertex-Induced Subgraphs

Michael_Dorfman — Thu, 02 Jul 2009 12:32:28 GMT

I've got a large DelegateVertexAndEdgeListGraph, and I'd like to induce a subgraph from it.

Specially, I'd like to choose a Vertex from my original graph, and create a new subgraph that contains my target vertex, all of the adjacent vertices, and all of the edges present between this new set of vertices.

What's the recommended way to do something like this?

New Post: Examples of use of Entity Framework/LINQ

Michael_Dorfman — Wed, 01 Jul 2009 15:38:07 GMT

Thanks! I synced, and it works great now.

Thanks again for all the help.

On Wed, Jul 1, 2009 at 4:49 PM, pelikhan <notifications@codeplex.com> wrote:

From: pelikhan

Oops... I"ve made the impl of OutEdges more merciful. Sync or have the tryGetOutEdges method return true always.

Read the full discussion online.

To add a post to this discussion, reply to this email (quickgraph@discussions.codeplex.com)

To start a new discussion for this project, email quickgraph@discussions.codeplex.com

You are receiving this email because you subscribed to this discussion on CodePlex. You can unsubscribe on codePlex.com.

Please note: Images and attachments will be removed from emails. Any posts to this discussion will also be available online at codeplex.com

New Post: Examples of use of Entity Framework/LINQ

pelikhan — Wed, 01 Jul 2009 14:49:37 GMT

Oops... I"ve made the impl of OutEdges more merciful. Sync or have the tryGetOutEdges method return true always.

Source code checked in, #35064

pelikhan — Wed, 01 Jul 2009 14:49:15 GMT

merciful OutEdges implementation

New Post: Examples of use of Entity Framework/LINQ

Michael_Dorfman — Wed, 01 Jul 2009 07:55:57 GMT

Sorry, I should have been more clear: I was actually trying to walk the graph. My code was:

foreach (var vtx in g.Vertices) {

foreach (var ed in g.OutEdges(vtx)) {

Console.WriteLine(ed);
which followed after the sample code you provided to create the DelegateVertexAndEdgeListGraph.

On Wed, Jul 1, 2009 at 6:47 AM, pelikhan <notifications@codeplex.com> wrote:

From: pelikhan

Is 'myVertex' a valid vertex id?

Read the full discussion online.

To add a post to this discussion, reply to this email (quickgraph@discussions.codeplex.com)

To start a new discussion for this project, email quickgraph@discussions.codeplex.com

You are receiving this email because you subscribed to this discussion on CodePlex. You can unsubscribe on codePlex.com.

Please note: Images and attachments will be removed from emails. Any posts to this discussion will also be available online at codeplex.com

Closed Issue: strong name for QuickGarph.Silverlight

pelikhan — Wed, 01 Jul 2009 07:18:57 GMT

I have just started using QuickGraph in Silverlight. It will be light (but important) use. Thanks.

I want to include a reference to the Silverlight-version dll in a combined Silverlight/WPF project. My application is desktop/web/online/offline. I have created some base User Controls in Silverlight that can be shared between both modules. I was able to use the Silverlight 2 System.Windows in the WFP base module, not QuickGraph.

When I try to compile my common classes in VS 2008 which include references to QuickGraph, I receive the following:

Error 7 Assembly generation failed -- Referenced assembly 'QuickGraph.Silverlight' does not have a strong name

Would it be possible to generate a strong-named version in the next build?

I am trying to avoid the possible workaround of dissembly followed by reassembly with my own strong key :)
Comments:

Commented Issue: strong name for QuickGarph.Silverlight

pelikhan — Wed, 01 Jul 2009 07:18:48 GMT

Fixed.

Source code checked in, #35060

pelikhan — Wed, 01 Jul 2009 07:18:02 GMT

strongly signed silverlight assembly

New Post: Removing Vertex

pelikhan — Wed, 01 Jul 2009 04:50:18 GMT

Looks like you are missing a namespace. My advice: don't use extension methods. Write Enumerable.First(d.GraphToVisualize.Edges) and intellisense will tell you the rest. There might be helpers for that in GraphExtensions too.

New Post: Examples of use of Entity Framework/LINQ

pelikhan — Wed, 01 Jul 2009 04:47:49 GMT

Is 'myVertex' a valid vertex id?

New Post: strong name

pelikhan — Wed, 01 Jul 2009 04:46:30 GMT

This discussion has been copied to a work item. Click here to go to the work item and continue the discussion.

Created Issue: strong name for QuickGarph.Silverlight

pelikhan — Wed, 01 Jul 2009 04:46:28 GMT

New Post: strong name

rich55 — Wed, 01 Jul 2009 01:09:55 GMT

I have just started using QuickGraph in Silverlight. It will be light (but important) use. Thanks.

I want to include a reference to the Silverlight-version dll in a combined Silverlight/WPF project. My application is desktop/web/online/offline. I have created some base User Controls in Silverlight that can be shared between both modules. I was able to use the Silverlight 2 System.Windows in the WFP base module, not QuickGraph.

When I try to compile my common classes in VS 2008 which include references to QuickGraph, I receive the following:

Error 7 Assembly generation failed -- Referenced assembly 'QuickGraph.Silverlight' does not have a strong name

Would it be possible to generate a strong-named version in the next build?

I am trying to avoid the possible workaround of dissembly followed by reassembly with my own strong key :)

New Post: Removing Vertex

dbugger — Tue, 30 Jun 2009 16:52:33 GMT

Something this simple is giving me a lot of headache! Why do I get this error message?

private void removeTransitionButton_Click(object sender, EventArgs e)
        {
            if (this.transitionListBox.SelectedItem != null)
            {
                Diagram d = (Diagram)((DocumentChild)((DockPanel)this.ParentForm.Parent.Parent.Parent).ActiveDocument).ElementHost.Child;


                d.GraphToVisualize.RemoveEdge(
                    d.GraphToVisualize.Edges.First<Edge<object>>(
                        delegate(Edge<object> edge)
                        {
                            return true;
                        })
                    );
            }
        }

Error    1    'System.Collections.Generic.IEnumerable<QuickGraph.IEdge<object>>' does not contain a definition for 'First' and the best extension method overload 'System.Linq.Queryable.First<TSource>(System.Linq.IQueryable<TSource>, System.Linq.Expressions.Expression<System.Func<TSource,bool>>)' has some invalid arguments    F:\Documents and Settings\Enrique\My Documents\Visual Studio 2008\Projects\PFCEditor\PFCEditor\TransitionListPanel.cs    60    21    PFCEditor
Error    2    Instance argument: cannot convert from 'System.Collections.Generic.IEnumerable<QuickGraph.IEdge<object>>' to 'System.Linq.IQueryable<QuickGraph.Edge<object>>'    F:\Documents and Settings\Enrique\My Documents\Visual Studio 2008\Projects\PFCEditor\PFCEditor\TransitionListPanel.cs    60    21    PFCEditor
Error    3    Argument '2': cannot convert from 'anonymous method' to 'System.Linq.Expressions.Expression<System.Func<QuickGraph.Edge<object>,bool>>'    F:\Documents and Settings\Enrique\My Documents\Visual Studio 2008\Projects\PFCEditor\PFCEditor\TransitionListPanel.cs    61    25    PFCEditor
Error    4    Unknown build error, 'Could not load file or assembly 'file:///F:\Documents and Settings\Enrique\My Documents\Visual Studio 2008\Projects\PFCEditor\PFCEditor\obj\Debug\PFCEditor.exe' or one of its dependencies. The system cannot find the file specified. Line 8 Position 14.'     F:\Documents and Settings\Enrique\My Documents\Visual Studio 2008\Projects\PFCEditor\PFCEditor\Diagram.xaml    8    14    PFCEditor

I know the "return true" is kinda idiotic when I could use a simple "First();" but it's just to simplify :)

New Post: Examples of use of Entity Framework/LINQ

Michael_Dorfman — Mon, 29 Jun 2009 15:17:05 GMT

I made the fixes that you suggested, and everything compiles fine. I can build my graph, and see the Vertices.

Unfortunately, when I try to access g.OutEdges(myVertex) on a given vertex, I get the following exception:

System.ArgumentOutOfRangeException was unhandled
Message=Specified argument was out of the range of valid values.
Parameter name: v
Source=QuickGraph
ParamName=v

Any ideas?

New Post: finding a circular reference

Rudi — Fri, 26 Jun 2009 18:57:05 GMT

Thanks for your help.

New Post: finding a circular reference

pelikhan — Fri, 26 Jun 2009 16:24:05 GMT

One correction: the topological sort algorithm will throw an exception but the DFS is a better solution for you.

The DFS will raise the ForwardOrCrossEdge event when it detects an edge that creates a loop. You can listen to that event which gives you the problematic edge. Using a vertex predecessor recorder, you can also figure the path to that edge from the root.

See http://quickgraph.codeplex.com/Wiki/View.aspx?title=Depth%20First%20Search%20Example&referringTitle=Home for more info on how DFS and observers work.